Frequent subgraph discovery

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2001, Pages 313-320

  Kuramochi, Michihiro ^a   Karypis, George ^a  

^a University of Minnesota ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149312583     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 for mining association rules. In Proc. the 20th VLDB, pages 487-499. Morgan Kaufmann, 1994.
3. R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. the 11th ICDE, pages 3-14. IEEE Press, 1995.
4. R. N. Chittimoori, L. B. Holder, and D. J. Cook. Applying the SUBDUE substructure discovery system to the chemical toxicity domain. In Proc. the 12th Int. Florida AI Research Society Conf., pages 90-94, 1999.
5. L. Dehaspe, H. Toivonen, and R. D. King. Finding frequent substructures in chemical compounds. In Proc. the 4th ACM SIGKDD KDD-98, pages 30-36. AAAI Press, 1998.
6. D. Dupplaw and P. H. Lewis. Content-based image retrieval with scale-spaced object trees. In Proc. SPIE: Storage and Retrieval for Media Databases, volume 3972, pages 253-261, 2000.
7. S. Fortin. The graph isomorphism problem. Technical Report TR96-20, Department of Computing Science, University of Alberta, 1996.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
9. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD, 2000.
10. L. Holder, D. Cook, and S. Djoko. Substructure discovery in the SUBDUE system. In Proc. the Workshop on Knowledge Discovery in Databases, pages 169-180, 1994.
11. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. PKDD'00, pages 13-23, 2000.
12. H. Kälviäinen and E. Oja. Comparisons of attributed graph matching algorithms for computer vision. In Proc. STEP-90, Finnish Artificial Intelligence Symposium, pages 354-368, 1990.
13. M. Kuramochi and G. Karypis. Frequent subgraph discovery. Technical Report 01-028, Department of Computer Science, University of Minnesota, 2001.
14. D. A. L. Piriyakumar and P. Levi. An efficient A* based algorithm for optimal graph matching applied to computer vision. In GRWSIA-98, 1998.
15. http://oldwww.comlab.ox.ac.uk/oucl/groups/machlearn/PTE/.
16. R. C. Read and D. G. Corneil. The graph isomorph disease. Journal of Graph Theory, 1:339-363, 1977.
17. A. Srinivasan, R. D. King, S. Muggleton, and M. J. E. Sternberg. Carcinogenesis predictions using ILP. In Proc. the 7th Int. Workshop on Inductive Logic Programming, volume 1297, pages 273-287. Springer-Verlag, Berlin, 1997.
18. A. Srinivasan, R. D. King, S. H. Muggleton, and M. Sternberg. The predictive toxicology evaluation challenge. In Proc. the 15th IJCAI, pages 1-6. Morgan-Kaufmann, 1997.
19. J. R. Ullman. An algorithm for subgraph isomorphism. Journal of the ACM, 23(1):31-42, 1976.
20. K. Yoshida and H. Motoda. CLIP: Concept learning from inference patterns. Artificial Intelligence, 75(1):63-92, 1995.
21. M. J. Zaki. Scalable algorithms for association mining. Knowledge and Data Engineering, 12(2):372-390, 2000.
22. M. J. Zaki and K. Gouda. Fast vertical mining using diffsets. Technical Report 01-1, Department 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, Department of Computer Science, Rensselaer Polytechnic Institute, 1999.