RING: An integrated method for frequent representative subgraph mining

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2009, Pages 1082-1087

  Zhang, Shijie ^a   Yang, Jiong ^a   Li, Shirong ^a  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL STUDIES; FREQUENT PATTERNS; INTEGRATED METHOD; INVARIANT VECTORS; MINING PROCESS; MULTI-DIMENSIONAL SPACE; PATTERN MINING; R-TREES; REPRESENTATIVE SELECTION; SUBGRAPH MINING; SYNTHETIC DATASETS;

DECISION TREES; MINING; VECTOR SPACES;

DATA MINING;

EID: 77951149815     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2009.96     Document Type: Conference Paper

References (25)

1. C. Borgelt, and M. Berthold. Mining Molecular Fragments: Finding Relevant Substructures of Molecules. Proc. of ICDM, 2002.
2. H. Bunke and K.Shearer. A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 1998.
3. L. Dehaspe, H. Toivonen, and R. King. Finding frequent substructures in chemical compounds. Proc. of KDD, 1998.
4. A. Guttman, R-Tree: A dynamic index structure for spatial searching. Proc. of SIGMOD, 1984.
5. M.Hasan, V. Chaoji, S. Salem, J. Besson, and M. Zaki. ORIGAMI: Mining Representative Orthogonal Graph Patterns. Proc. of ICDM, 2007.
6. M. Hasan and M. Zaki. MUSK: Uniform Sampling of k Maximal Patterns. Proc. of SDM, 2009.
7. M. Hasan and M. Zaki. Output Space Sampling for Graph Patterns. Proc. of VLDB, 2009.
8. H. He and A. Singh, GraphRank: Statistical Modeling and Mining of Significant Subgraphs in the Feature Space, Proc. of ICDM, 2006.
9. L. Holder, D.Cook, and S. Djoko. Substructure discovery in the subdue system. Proc. of AAAI, 1994.
10. J. Huan, W. Wang, J. Prins, and J. Yang. SPIN: mining maximal frequent subgraphs from graph databases. Proc. of KDD, 2004.
11. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. Proc. of PDKK, 2000.
12. M. Koyuturk, A. Grama, and W.Szpankowski. An efficient algorithm for detecting frequent subgraphs in bioloical networks. Bioinformatics, 2004.
13. M. Kuramochi, and G. Karypis. Frequent subgraph discovery. Proc. of ICDE, 2001.
14. M. Kuramochi, and G. Karypis, Finding Frequent Patterns in a Large Sparse Graph. DMKD, 2005.
15. S. Nijssen and J. Kok. A quickstart in frequent structure mining can make a difference, Proc of KDD, 2004.
16. C. Palmer, P. Gibbons, and C. Faloutsos. ANF: A fast and scalable tool for data mining in massive graphs, Proc. of KDD, 2002.
17. L. Thomas, S.Valluri, and K.Karlapalem. MARGIN: Maximal Frequent Subgraph Mining, Proc. of ICDM, 2006.
18. J. Wang, W. Hsu, M. Lee, and C. Sheng. A Partition-based Approach to Graph Mining, Proc. of ICDE, 2006.
19. C. Wang, W. Wang, J. Pei, Y. Zhu, and B. Shi. Scalable mining of large disk-based graph databases. Proc. of KDD, 2004.
20. X. Yan and J. Han. gSpan: graph-based substructure pattern mining, Proc. of ICDM, 2002.
21. M. Zaki. Efficiently mining frequent trees in a forest: algorithms and applications, IEEE TKDE, 2005.
22. S. Zhang, J. Yang, and V. Cheedella. Monkey: approximate graph mining based on spanning trees. Proc. of ICDE, 2007.
23. A.Zykov, Theory of Finite Graphs, 1969.
24. Gene Ontology. http://www.geneontology.org/.
25. R-tree Portal. http://rtreeportal.org/.