A partition-based approach to graph mining

Proceedings - International Conference on Data Engineering

Volumn 2006, Issue , 2006, Pages 74-

  Wang, Bjunmei ^a   Hsu, Wynne ^a   Lee, Mong Li ^a   Sheng, Chang ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC ENVIRONMENTS; GRAPH MINING ALGORITHMS; SUBGRAPHS;

ALGORITHMS; DATABASE SYSTEMS; GRAPH THEORY; SET THEORY; STORAGE ALLOCATION (COMPUTER); VIRTUAL REALITY;

DATA MINING;

EID: 33749642785     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2006.7     Document Type: Conference Paper

References (19)

1. P. Bradley, U. Fayyad, and C. Reina. Scaling clustering algorithms to large databases. ACM SIGKDD, 1998.
2. Y. Chi, Y. Yang, and R. R. Muntz. Indexing and mining free trees. IEEE ICDM, 2003.
3. C. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. ACM SIGKDD, 2004.
4. L. Hall, N. Chawla, and K. Bowyer. Combining decision trees learned in parallel. ACM SIGKDD workshop on distributed data mining, 1998.
5. J. Huan, W. Wang, J. Prins, and J. Yang. SPIN: mining maximal frequent subgraphs from graph databases. ACM SIGKDD, 2004.
6. A. Inokuchi, T. Washio, K. Nishimura, and H. Motoda. A fast algorithm for mining frequent connected subgraphs. IEEE ICDM, 2001.
7. G. Karypis and V. Kumar. Multilevel algorithms for multi-contraint graph partitioning. In ACM/IEEE Conference on Supercomputing, 1998.
8. M. Kuramochi and G. Karypis. An efficient algorithm for discovering frequent subgraphs. ICDM, 2001.
9. R. T. Ng and J. Han. CLARANS: A method for clustering objects for spatial data mining. ICDE, 2002.
10. S. Nijssen and J. N. Kok. A quickstart in frequent structure mining can make a difference. ACM SIGKDD, 2004.
11. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. VLDB, 1995.
12. J. Shafer, R. Agrawal, and M. Mehta. Sprint: a scalable parallel classifier for data mining. VLDB, 1996.
13. D. Shasha, J. Wang, and S. Zhang. Unordered tree mining with applications to phylogeny. ICDE, 2004.
14. A. Termier, M.-C. Rousset, and M. Sebag. Dryade: a new approach for discovering closed frequent trees in heterogeneous tree databases. IEEE ICDM, 2004.
15. C. Wang, W. Wang, J. Pei, Y. Zhu, and B. Shi. Scalable mining of large disk-based graph databases. ACM SIGKDD, 2004.
16. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. IEEE ICDM, 2002.
17. X. Yan and J. Han. Closegraph: Mining closed frequent graph patterns. ACM SIGKDD, 2003.
18. X. Yan, P. S. Yu, and J. Han. Graph indexing: a frequent structure-based approach. ACM SIGMOD, 2004.
19. M. Zaki. Efficiently mining frequent trees in a forest. ACM SIGKDD, 2002.