An apriori-based algorithm for mining frequent substructures from graph data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1910, Issue , 2000, Pages 13-23

  Inokuchi, Akihiro ^a,b   Washio, Takashi ^a   Motoda, Hiroshi ^a  

^a OSAKA UNIVERSITY   (Japan)

^b IBM JAPAN LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS; MATRIX ALGEBRA;

ADJACENCY MATRICES; APRIORI-BASED ALGORITHMS; ARTIFICIAL SIMULATION; GRAPH DATA; HIGH-EFFICIENCY; OXFORD UNIVERSITY; REAL-WORLD PROBLEM; SUB-STRUCTURES;

DATA MINING;

EID: 84974733299     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45372-5_2     Document Type: Conference Paper

References (14)

1. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proc. of the 20th VLDB Conference, pp.487-499.
2. Cook, D.J. and Holder, L.B. 1994. Substructure Discovery Using Minimum De- scription Length and Background Knowledge, Journal of Artificial Intelligence Research, Vol.1, pp.231-255.
3. Dehaspe, L., Toivonen, H. and King, R.D. 1998. Finding frequent substructures in chemical compounds. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), pp.30-36.
4. Fortin, S. 1996. The graph isomorphism problem. Technical Report 96-20, Univer- sity of Alberta, Edomonton, Alberta, Canada.
5. Inokuchi, A., Washio, T. and Motoda, H. 1999. Derivation of the topology structure from massive graph data. Discovery Science: Proceedings of the Second International Conference, DS’99, pp.330-332.
6. Inokuchi, A. 2000. The study on a fast mining method from massive graph structure data. Master thesis (in Japanese), I.S.I.R., Osaka Univ.
7. King, R., Muggleton, S., Srinivasan, A. and Sternberg, M. 1996. Structure-activity relationships derived by machine learning; The use of atoms and their bond connectives to predict mutagenicity by inductive logic programming. In Proceedings of the National Academy of Sciences, Vol.93, pp.438-442.
8. Klopman, G. 1984. Artificial intelligence approach to structure activity studies. J. Amer. Chem. Soc., Vol.106, pp.7315-7321.
9. Klopman, G. 1992. MultiCASE 1. A hierarchical computer automated structure evaluation program, QSAR, Vol.11, pp.176-184.
10. Kramer, S., Pfahringer, B. and Helma, C. 1997. Mining for causes of cancer: Ma- chine learning experiments at various levels of detail. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), pp.223-226.
11. Mannila, H. and Toivonen, H. 1997. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, Vol.1, No.3, pp.241-258.
12. Matsuda, T., Horiuchi, T., Motoda, H. and Washio, T. 2000. Extension of Graph-Based Induction for General Graph Structured Data. In Proceedings of the Fourth Pacific-Asia Conference of Knowledge Discovery and Data Mining (PAKDD2000), pp.420-431.
13. Srinisavan, A., King, R.D., Muggleton, S.H. and Sternberg, M.J.E. 1997. The pre-dictive toxicology evaluation challenge. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), pp.4-9.
14. Wang, K. and Liu, H. 1997. Schema discovery for semistructured data. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), pp.271-274.