An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data

作者: Akihiro Inokuchi , Takashi Washio , Hiroshi Motoda

DOI: 10.1007/3-540-45372-5_2

关键词: GraphAdjacency listInductive logic programmingAlgorithmAssociation rule learningGraph (abstract data type)Computer scienceFrequent subtree miningMolecule miningAdjacency matrixA priori and a posteriori

摘要: This paper proposes a novel approach named AGM to efficiently mine the association rules among the frequently appearing sub-structures in a given graph data set. A graph …

参考文章(15)
Bernhard Pfahringer, Christoph Helma, Stefan Kramer, Mining for causes of cancer: machine learning experiments at various levels of detail knowledge discovery and data mining. pp. 223- 226 ,(1997)
S. H. Muggleton, M. J. E. Sternberg, A. Srinivasan, R. D. King, The predictive toxicology evaluation challenge international joint conference on artificial intelligence. pp. 4- 9 ,(1997)
Luc Dehaspe, Hannu Toivonen, Ross Donald King, Finding frequent substructures in chemical compounds knowledge discovery and data mining. pp. 30- 36 ,(1998)
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Ramakrishnan Srikant, Rakesh Agrawal, Fast Algorithms for Mining Association Rules in Large Databases very large data bases. pp. 487- 499 ,(1994)
Takashi Matsuda, Tadashi Horiuchi, Hiroshi Motoda, Takashi Washio, Extension of Graph-Based Induction for General Graph Structured Data pacific asia conference on knowledge discovery and data mining. pp. 420- 431 ,(2000) , 10.1007/3-540-45571-X_49
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda, Derivation of the Topology Structure from Massive Graph Data discovery science. pp. 330- 332 ,(1999) , 10.1007/3-540-46846-3_35
Gilles Klopman, MULTICASE 1. A Hierarchical Computer Automated Structure Evaluation Program Quantitative Structure-Activity Relationships. ,vol. 11, pp. 176- 184 ,(1992) , 10.1002/QSAR.19920110208