All normalized anti-monotonic overlap graph measures are bounded

Data Mining and Knowledge Discovery

Volumn 23, Issue 3, 2011, Pages 503-548

  Calders, Toon ^a   Ramon, Jan ^c   Van Dyck, Dries ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b HASSELT UNIVERSITY   (Belgium)

^c UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Anti monotonicity; Graph mining; Large network setting; Morphism reductions; Support measure

Indexed keywords

ANTI-MONOTONICITY; GRAPH MINING; LARGE NETWORKS; MORPHISMS; SUPPORT MEASURE;

POLYNOMIAL APPROXIMATION;

EID: 80855128728     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-011-0217-y     Document Type: Article

References (24)

1. Bandyopadhyay S, Sharan R, Ideker T (2006) Systematic identification of functional orthologs based on protein network comparison. Genome Res 16(3):428-435 (Pubitemid 43327512)
2. Bolobas B (2001) Random graphs. Cambridge University Press, Cambridge
3. Brimkov Valentin E (2004) Clique, chromatic, and lovasz numbers of certain circulant graphs. Electron Notes Discr Math 17:63-67
4. Bringmann B, Nijssen S (2007) What is frequent in a single graph? In: Proceedings of mining and learning with graphs (MLG), Florence, Italy
5. Crespi V (2004) Exact formulae for the lovasz theta function of sparse circulant graphs. SIAM J DiscrMath 17(4):670-674
6. De Raedt L, Kramer S (2001) The levelwise version space algorithm and its application to molecular fragment finding. In: Nebel B (ed) Proceedings of the 17th international joint conference on artificial intelligence. Morgan Kaufmann, CA, pp 853-862
7. Diestel Reinhard (2000) Graph theory. Springer, New York
8. Fiedler M, Borgelt C (2007) Support computation for mining frequent subgraphs in a single graph. In: Proceedings of the fifth workshop on mining and learning with graphs (MLG'07), Florence
9. Furer M, Kasiviswanathan S Prasad (2008) Approximately Counting Embeddings into Random Graphs. In: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on approximation, randomization and combinatorial optimization: algorithms and techniques, Boston, MA, USA, pp 416-429
10. Gross JL, Yellen J (2004) Handbook of graph theory. CRC Press, Boston
11. Grunewald et al (2007) Qnet: An agglomerative method for the construction of phylogenetic networks from weighted quartets. Mole Biol Evol 24(2):532-538 (Pubitemid 46204385)
12. He H, Singh AK (2007) Efficient algorithms for mining significant substructures in graphs with quality guarantees. In: IEEE international conference on data mining, Omaha, Nebraska, pp 163-172
13. Hell P, Nesetril J (2004) Graphs and homomorphisms. Oxford University Press, Oxford
14. Kashtan N, Itzkovitz S, Milo R, Alon U (2004) Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 22;20(11):1746-1758 (Pubitemid 39162051)
15. Knuth Donald E (1994) The sandwich theorem. Electron J Combin 1:48
16. KuramochiM, Karypis G (2005) Finding frequent patterns in a large sparse graph. Data Min Knowl Discov 11(3):243-271 (Pubitemid 41669194)
17. LaPaugh AS, Rivest RL (1978) The subgraph homeomorphism problem. In: STOC '78. ACM Press, New York, NY, USA, pp 40-50
18. Mcglohon M, Leskovec J, Faloutsos C, Hurst M, Glance N (2007) Finding patterns in blog shapes and blog evolution. In: Proceedings of the international conference on weblogs and social media, Boulder, CO, USA, pp 26-28
19. Muggleton S, De Raedt L (1994) Inductive logic programming : theory and methods. J Logic Prog 19, 20:629-679
20. Muzychuk M (2004) A solution of the isomorphism problem for circulant graphs. Proc Lond Math Soc 3:1-41 (Pubitemid 38293889)
21. Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Boston
22. Ramon J, Francis T, Blockeel H (2000) Learning a Tsume-Go heuristic with Tilde. In: Proceedings of CG2000, the second international conference on computers and games, Hamamatsu, Japan. Lecture Notes in Computer Science, vol 2063. Springer, NY, pp 151-169
23. Tong H, Faloutsos C, Gallagher B, Eliassi-Rad T (2007) Fast best-effort pattern matching in large attributed graphs. In: KDD '07: proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, New York, NY, USA, pp 737-746 (Pubitemid 350229259)
24. Vanetik N, Shimony SE, Gudes E (2006) Support measures for graph data. Data Min Knowl Discov 13(2):243-260 (Pubitemid 44352884)