Polynomial-delay enumeration of monotonic graph classes

Journal of Machine Learning Research

Volumn 10, Issue , 2009, Pages 907-929

  Ramon, Jan ^a   Nijssen, Siegfried ^a  

^a Dept of Computer Science ^*  (Belgium)

Author keywords

Enumeration; Graph mining; Monotonic graph classes

Indexed keywords

BUILDING BLOCK; ENUMERATION; ENUMERATION ALGORITHMS; FREQUENT SUBGRAPH MINING; GRAPH CLASS; GRAPH MINING; MONOTONIC GRAPH CLASSES;

EDUCATION; LEARNING ALGORITHMS; MINING;

GRAPH THEORY;

EID: 66549127949     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. Rakesh Agrawal, Heikki Mannila, Ramakrishnan Srikant, Hannu Toivonen, and A. Inkeri Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press, 1996.
2. Christian Borgelt and Michael R. Berthold. Mining molecular fragments: Finding relevant substructures of molecules. In ICDM, pages 51-58, 2002.
3. Gregory Butler. Fundamental algorithms for permutation groups, volume 559 of Lecture Notes in Computer Science. Springer-Verlag, 1991.
4. Yun Chi, Richard R. Muntz, Siegfried Nijssen, and Joost N. Kok. Frequent subtree mining - an overview. Fundam. Inform., 66(1-2):161-198, 2005.
5. Leslie A. Goldberg. Efficient algorithms for listing unlabeled graphs. Journal of Algorithms, 13(1): 128-143, 1992.
6. Leslie A. Goldberg. Polynomial space polynomial delay algorithms for listing families of graphs. In Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing (STOC '93), pages 218-225, New York, NY, USA, 1993. ACM Press.
7. Tamas Horvath, Jan Ramon, and Stefan Wrobel. Frequent subgraph mining in outerplanar graphs. In Proceedings ofthe Twelfth ACMSIGKDD International Conference on Knowledge Discovery and Data Mining, pages 197-206, Philadelphia, PA, August 2006.
8. Jun Huan, Wei Wang, and Jan Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In ICDM, pages 549-552. IEEE Computer Society, 2003.
9. Akihiro Inokuchi. Mining generalized substructures from a set of labeled graphs. In ICDM, pages 415-418. IEEE Computer Society, 2004.
10. Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda. Complete mining of frequent patterns from graphs: Mining graph data. Machine Learning, 50(3):321-354, 2003.
11. Johannes Kobler, Uwe Schöning, and Jacobo Torán. The Graph Isomorphism Problem: Its Structural Complexity. Birkhäuser, 1993.
12. Michihiro Kuramochi and George Karypis. An efficient algorithm for discovering frequent subgraphs. IEEE Trans. Knowl. Data Eng., 16(9):1038-1051, 2004.
13. Jure Leskovec, Ajit Singh, and Jon M. Kleinberg. Patterns of influence in a recommendation network. In Advances in Knowledge Discovery and Data Mining, 10th Pacific-Asia Conference (PAKDD), pages 380-389, 2006.
14. Brendan D. McKay. Isomorph-free exhaustive generation. Journal of Algorithms, 26:306-324, 1998.
15. Shin-ichi Nakano and Takeaki Uno. Constant time generation of trees with specified diameter. In Juraj Hromkovic, Manfred Nagl, and Bernhard Westfechtel, editors, Proceedings of the 30th International Workshop on Graph Theoretical Concepts in Computer Science, volume 3353 of Lecture Notes in Computer Science, pages 33-45. Springer-Verlag, 2004.
16. Siegfried Nijssen and Joost N. Kok. A quickstart in frequent structure mining can make a difference. In Proceedings of the Tenth ACMSIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 647-652, 2004.
17. Christophe Paul, Andrzej Proskurowski, and Jan A. Telle. Generating graphs of bounded branch-width. In Proceedings of the 32nd International Workshop on Graph Theoretical Concepts in Computer Science, volume 4271 of Lecture Notes in Computer Science, pages 206-216, 2006.
18. Jan Ramon and Siegfried Nijssen. General graph refinement with polynomial delay. In Proceedings of the Workshop on Mining and Learning with Graphs (MLG '07), 2007.
19. Robert A. Wright, Bruce Richmond, Andrew Odlyzko, and Brendan D. McKay. Constant time generation of free trees. SIAM Journal on Computing, 15(2):540-548, 1986.
20. Xifeng Yan and Jiawei Han. gSpan: Graph-based substructure pattern mining. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), pages 721-724, Japan, 2002. IEEE Computer Society.