An Efficiently Computable Support Measure for Frequent Subgraph Pattern Mining

No abstract is available for this paper.

• Publication year

  2012

• Venue

  ECML/PKDD

• Publication date

  2012-09-24

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-33460-3_29
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Nearly exact mining of frequent trees in large networks

  2012cited by this paper
• All normalized anti-monotonic overlap graph measures are bounded

  2011influential reference
• Approximating Semidefinite Packing Programs

  2011cited by this paper
• Convex optimization

  2010cited by this paper
• Mining Graph Evolution Rules

  2009cited by this paper
• An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function

  2009cited by this paper
• Support Computation for Mining Frequent Subgraphs in a Single Graph

  2007cited by this paper
• What Is Frequent in a Single Graph?

  2007cited by this paper
• A survey of research and practices of Network-on-chip

  2006cited by this paper
• Graph mining: Laws, generators, and algorithms

  2006cited by this paper
• Support measures for graph data*

  2006influential reference
• A (sub)graph isomorphism algorithm for matching large graphs

  2004influential reference
• Finding Frequent Patterns in a Large Sparse Graph*

  2004cited by this paper
• Computing frequent graph patterns from semistructured data

  2002cited by this paper
• Emergence of Scaling in Random Networks

  1999cited by this paper
• Emergence of scaling in random networks

  1999cited by this paper
• Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING

  1996cited by this paper
• The Sandwich Theorem

  1993cited by this paper
• Mining association rules between sets of items in large databases

  1993cited by this paper
• Approximating clique is almost NP-complete

  1991cited by this paper
• Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

  1979cited by this paper
• On the Shannon capacity of a graph

  1979cited by this paper
• Probabilities on finite models

  1976cited by this paper
• Emergence of Scaling in Random Networks

  year unknowncited by this paper

• A spanning hypertree theory for support measures in single graphs

  2026cites this paper
• Counting frequent patterns in large labeled graphs: a hypergraph-based approach

  2020influential citation
• Peregrine: a pattern-aware graph mining system

  2020cites this paper
• Generalizing Design of Support Measures for Counting Frequent Patterns in Graphs

  2019cites this paper
• A New Polynomial-time Support Measure for Counting Frequent Patterns in Graphs

  2019cites this paper
• Finding Network Motifs in Large Graphs using Compression as a Measure of Relevance

  2017cites this paper
• Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs

  2017cites this paper
• Large-scale network motif analysis using compression

  2017cites this paper
• A Theory-based Study of Graph Mining

  2016cites this paper
• From graph patterns to networked statistics

  2015cites this paper
• An efficient algorithm for finding frequent and diverse subgraph patterns in PPI networks

  2014cites this paper
• An efficiently computable subgraph pattern support measure: counting independent observations

  2013cites this paper
• A New Viewpoint for Mining Frequent Patterns

  2013cites this paper
• Nearly exact mining of frequent trees in large networks

  2012cites this paper