Discovering frequent topological structures from graph datasets

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2005, Pages 606-611

  Jin, R ^a   Wang, C ^a   Polshakov, D ^a   Parthasarathy, S ^a   Agrawal, G ^a  

^a Ohio State University   (United States)

Author keywords

Frequent graph pattern; Graph mining; Topological minor

Indexed keywords

FREQUENT GRAPH PATTERNS; GRAPH MINING; TOPOLOGICAL MINOR;

ALGORITHMS; COMPUTER NETWORKS; GRAPH THEORY; PROBLEM SOLVING;

DATABASE SYSTEMS;

EID: 32344444658     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1081870.1081944     Document Type: Conference Paper

References (13)

1. Reinhard Diestel. Graph Theory. Springer-Verlag, 2000.
2. H. Hofer, C. Borgelt, and M. R. Berthold. Large scale mining of molecular fragments with wildcards. In Advances in Intelligent Data Analysis V, pages 380-389, 2003.
3. Jun Huan, Wei Wang, Jan Prins, and Jiong Yang. Spin: mining maximal frequent subgraphs from graph databases, In KDD, pages 581-586, 2004.
4. Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda. Complete mining of frequent patterns from graphs: Mining graph data. Mach. Learn., 50(3):321-354, 2003.
5. Ruoming Jin, Chao Wang, Dimitrii Polshakov, Srinivasan Parthasarathy, and Gagan Agrawal, Discovering frequent topological structures from graph datasets. Technical report, CSE, Ohio State University.
6. Michihiro Kuramochi and George Karypis. Frequent subgraph discovery. In ICDM, pages 313-320, 2001.
7. Thorsen Meinl, Christian Borgelt, Michael R. Berthold, and Michael Philippsen. Mining fragments with fuzzy chains in molecular databases. In Second International Workshop on Mining Graphs, Trees and Sequences (MGTS2004), 2004.
8. Siegfried Nijssen and Joost N. Kok. A quickstart in frequent structure mining can make a difference. In KDD, pages 647-652, 2004.
9. H Palsdottir and C Hunte. Lipids in membrane protein structures. BBA, 1666:2-18, 2004.
10. S. Parthasarathy and M. Coatney. Efficient discovery of common substructures in macromolecules. ICDM, pages 362-369, 2002.
11. D. Polshakov, K. Marsolo, and S. Parthasarathy. Mining 3d-motifs using phisical-chemical constraints: application to cardiolipin binding sites. In ISMB, 2005.
12. A. Srinivasan, R.D. King, S.H. Muggleton, and M. Sternberg. The predictive toxicology evaluation challenge. In IJCAI, pages 1-6, 1997.
13. Xifeng Yan and Jiawei Han. gspan: Graph-based substructure pattern mining. In ICDM, page 721, 2002.