作者: Akihiro Inokuchi , Takashi Washio , Hiroshi Motoda
关键词: Graph 、 Adjacency list 、 Inductive logic programming 、 Algorithm 、 Association rule learning 、 Graph (abstract data type) 、 Computer science 、 Frequent subtree mining 、 Molecule mining 、 Adjacency matrix 、 A 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 …