Sciweavers

Share
PKDD
2000
Springer

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

11 years 1 months ago
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph transaction is represented by an adjacency matrix, and the frequent patterns appearing in the matrices are mined through the extended algorithm of the basket analysis. Its performance has been evaluated for the arti cial simulation data and the carcinogenesis data of Oxford University and NTP. Its high eciency has been con rmed for the size of a real-world problem. .. .
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda
Added 25 Aug 2010
Updated 25 Aug 2010
Type Conference
Year 2000
Where PKDD
Authors Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda
Comments (0)
books