All normalized anti-monotonic overlap graph measures are bounded

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Data mining and knowledge discovery

• Publication date

  2011-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10618-011-0217-y
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Support Computation for Mining Frequent Subgraphs in a Single Graph

  2007cited by this paper
• Finding patterns in blog shapes and blog evolution

  2007cited by this paper
• Efficient Algorithms for Mining Significant Substructures in Graphs with Quality Guarantees

  2007cited by this paper
• Fast best-effort pattern matching in large attributed graphs

  2007cited by this paper
• Handbook of graph theory

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

  2007cited by this paper
• Systematic identification of functional orthologs based on protein network comparison.

  2006influential reference
• Support measures for graph data*

  2006cited by this paper
• QNet: an agglomerative method for the construction of phylogenetic networks from weighted quartets.

  2006cited by this paper
• Random graphs

  2006influential reference
• Exact Formulae for the Lova'sz Theta Function of Sparse Circulant Graphs

  2004cited by this paper
• Finding Frequent Patterns in a Large Sparse Graph*

  2004cited by this paper
• Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs

  2004cited by this paper
• A Solution of the Isomorphism Problem for Circulant Graphs

  2004cited by this paper
• Clique, chromatic, and Lovász numbers of certain circulant graphs

  2004cited by this paper
• Graphs and homomorphisms

  2004cited by this paper
• Exact formulae for the Lovász Theta Function of sparse Circulant Graphs

  2002cited by this paper
• The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding

  2001influential reference
• Learning a Go Heuristic with TILDE

  2000cited by this paper
• Graph Theory

  1997cited by this paper
• Inductive Logic Programming: Theory and Methods

  1994cited by this paper
• The Sandwich Theorem

  1993cited by this paper
• Random Graphs

  1985cited by this paper
• The subgraph homeomorphism problem

  1978cited by this paper

• Linear Programs with Conjunctive Database Queries

  2022cites this paper
• Linear Programs with Conjunctive Queries

  2022cites this paper
• Dynamical algorithms for data mining and machine learning over dynamic graphs

  2020cites this paper
• Sampling informative patterns from large single networks

  2020cites this paper
• Dependency Weighted Aggregation on Factorized Databases

  2019cites this paper
• Solving linear programs on factorized databases

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

  2016cites this paper
• Mining approximate frequent patterns from graph databases

  2015cites this paper
• From graph patterns to networked statistics

  2015cites this paper
• Towards a Framework for Learning from Networked Data

  2014cites this paper
• Single-Graph Support Measures

  2014influential citation
• Quantitative graph theory : mathematical foundations and applications

  2014influential citation
• Introduction to Pattern Mining

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

  2013influential citation
• Towards mining and learning with networked examples

  2013cites this paper
• Graph mining for discovering infrastructure patterns in configuration management databases

  2012cites this paper
• An Efficiently Computable Support Measure for Frequent Subgraph Pattern Mining

  2012influential citation
• Nearly exact mining of frequent trees in large networks

  2012cites this paper
• Infrastructure Pattern Discovery in Configuration Management Databases via Large Sparse Graph Mining

  2011cites this paper