Discovering frequent geometric subgraphs

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2002, Pages 258-265

  Kuramochi, Michihiro ^a   Karypis, George ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 45149090173     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. R. C. Agarwal, C. C. Aggarwal, V. V. V. Prasad, and V. Crestana. A tree projection algorithm for generation of large itemsets for association rules. IBM Research Report RC21341, 1998.
2. R. Agrawal and R. Srikant. Fast algorithms far mining association rules. In Proc. of the 20th VLDB, 1994.
3. R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. of the 11th ICDE, 1995.
4. L. P. Chew, D. Huttenlocher, K. Kedem, and J. Kleinberg. Fast detection of common geometric substructure in proteins. In Proc. of the 3rd ACM RECOMB, 1999.
5. DTP/2D and 3D structural information. ftp://dtpsearch.ncifcrf.gov/jan02- 2d.bin.
6. B. Dunkel and N. Soparkar. Data organizatinon and access for efficient data mining. In Proc. of the 15th IEEE ICDE, 1999.
7. S. Ghazizadeh and S. Chawathe. Discovering freuqent structures using summaries. Technical Report CS-TR-4364. Dept. of Computer Science, University of Maryland. 2002.
8. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. of ACM SIGMOD, 2000.
9. L. Holder, D. Cook, and S. Djoko. Substructure discovery in the SUBDUE system. In Proc. of the Workshop on Knowledge Discovery in Databases, 1994.
10. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. of the 4th PKDD, 2000.
11. A. Inokuchi, T. Washio, K. Nishimura, and H. Motoda. A fast algorithm for mining frequent connected subgraphs. IBM Technical Report RT0448, 2002.
12. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. of the 1st IEEE ICDM, 2001.
13. M. Kuramochi and G. Karypis. Discovering geometric frequent subgraphs. Technical Report 02-024, Dept. of Computer Science, University of Minnesota. 2002.
14. M. Seno and G. Karypis. LPMiner: An algorithm for finding frequent itemsets using length decreasing support constraint. In Proc. of the 1st IEEE ICDM, 2001.
15. M. Seno and G. Kaxypis. SLPMiner: An algorithm far finding frequent sequential patterns using length-decreasing support constraint. In Proc. of the 2nd IEEE ICDM, 2002.
16. P. Shenoy, J. R. Haritsa, S. Sundarshan, G. Bhalotia, M. Bawa, and D. Shah. Turbo-charging vertical mining of large databases. In Proc. of ACM SIGMOD, 2000.
17. J. T. L. Wang, Q. Ma, D. Shasha, and C. H. Wu. New techniques for extracting features from protein sequences. IBM Systems Journal, 40(2):426-441, 2001.
18. X. Wang and J. T. L. Wang. Fast similarity search in three-dimensional structure databases. Journal of Chemical Information and Computer Sciences, 40(2):442-451, 2000.
19. K. Yoshida and H. Motoda. CLIP: Concept learning from inference patterns. Artificial Intelligence, 75(1):63-92, 1995.
20. M. J. Zaki. Fast mining of sequential patterns in very large databases. Technical Report 668, Dept. of Computer Science, Univeristy of Rochester, 1997.
21. M. J. Zaki. Scalable algorithms for association mining. IEEE TKDE, 12(2):372-390, 2000.
22. M. J. Zaki and K. Gouda. Fast vertical mining using diffsets. Technical Report 01-1, Dept. of Computer Science, Rensselaer Polytechnic Institute, 2001.
23. M. J. Zaki and C.-J. Hsiao. CHARM: An efficient algorithm for closed association rule mining,. Technical Report 99-10, Dept. of Computer Science, Rensselaer Polytechnic Institute, October 1999.