Subdue: Compression-based frequent pattern discovery in graph data

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

Volumn , Issue , 2005, Pages 71-76

  Ketkar, Nikhil S ^a   Holder, Lawrence B ^a   Cook, Diane J ^a  

^a UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL TOXICITY; CITATION GRAPHS; DATA MINING SYSTEM; DATA SETS; EXPERIMENTAL COMPARISON; FREQUENT PATTERN DISCOVERY; FREQUENT PATTERNS; GRAPH DATA; GRAPH MINING; GRAPH-BASED; SUBGRAPHS;

CHEMICAL COMPOUNDS; HEURISTIC ALGORITHMS; MINING MACHINERY;

DATA MINING;

EID: 77953566274     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1133905.1133915     Document Type: Conference Paper

References (21)

1. R. N. Chittimoori, L. B. Holder, and D. J. Cook. Applying the subdue substructure discovery system to the chemical toxicity domain. In FLAIRS Conference, pages 90-94, 1999.
2. D. J. Cook and L. B. Holder. Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. (JAIR), 1:231-255, 1994.
3. L. Dehaspe and H. Toivonen. Discovery of frequent datalog patterns. Data Min. Knowl. Discov., 3(1):7-36, 1999.
4. G. Galal, D. J. Cook, and L. B. Holder. Exploiting parallelism in a structural scientific discovery system to improve scalability. JASIS, 50(1):65-73, 1999.
5. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In ICDM, pages 549-552, 2003.
6. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD, pages 13-23, 2000.
7. R. D. King, A. Srinivasan, and L. Dehaspe. Warmr: a data mining tool for chemical data. Journal of Computer-Aided Molecular Design, 15(2):173-181, 2001.
8. R. I. Kondor and J. D. Lafferty. Diffusion kernels on graphs and other discrete input spaces. In ICML, pages 315-322, 2002.
9. M. Kuramochi and G. Karypis. Discovering frequent geometric subgraphs. In ICDM, pages 258-265, 2002.
10. M. Kuramochi and G. Karypis. An efficient algorithm for discovering frequent subgraphs. IEEE Trans. Knowl. Data Eng., 16(9):1038-1051, 2004.
11. M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. In SDM, 2004.
12. T. Matsuda, T. Horiuchi, H. Motoda, and T. Washio. Extension of graph-based induction for general graph structured data. In PAKDD, pages 420-431, 2000.
13. M. Mukherjee and L. B. Holder. Graph-based data mining for social network analysis. In Proceedings of the ACM KDD Workshop on Link Analysis and Group Detection, 2004.
14. S. Nijssen and J. N. Kok. A quickstart in frequent structure mining can make a difference. In KDD, pages 647-652, 2004.
15. L. D. Raedt and S. Kramer. The levelwise version space algorithm and its application to molecular fragment finding. In IJCAI, pages 853-862, 2001.
16. A. Rakhshan, L. B. Holder, and D. J. Cook. Structural web search engine. In FLAIRS Conference, pages 319-324, 2003.
17. J. Rissanen. Sochastic Complexity in Statistical Inquiry. Singapore: World Scientific Publishing, 1989.
18. A. Srinivasan, S. Muggleton, M. J. E. Sternberg, and R. D. King. Theories for mutagenicity: A study in first-order and feature-based induction. Artif. Intell., 85(1-2):277-299, 1996.
19. S. Su, D. J. Cook, and L. B. Holder. Application of knowledge discovery to molecular biology: Identifying structural regularities in proteins. In Pacific Symposium on Biocomputing, pages 190-201, 1999.
20. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In ICDM, pages 721-724, 2002.
21. X. Yan and J. Han. Closegraph: mining closed frequent graph patterns. In KDD, pages 286-295, 2003.