Complete Mining of Frequent Patterns from Graphs: Mining Graph Data |
| |
Authors: | Inokuchi Akihiro Washio Takashi Motoda Hiroshi |
| |
Affiliation: | (1) Institute for Scientific and Industrial Research, Osaka University, Osaka, 567-0047, Japan |
| |
Abstract: | Basket Analysis, which is a standard method for data mining, derives frequent itemsets from database. However, its mining ability is limited to transaction data consisting of items. In reality, there are many applications where data are described in a more structural way, e.g. chemical compounds and Web browsing history. There are a few approaches that can discover characteristic patterns from graph-structured data in the field of machine learning. However, almost all of them are not suitable for such applications that require a complete search for all frequent subgraph patterns in the data. In this paper, we propose a novel principle and its algorithm that derive the characteristic patterns which frequently appear in graph-structured data. Our algorithm can derive all frequent induced subgraphs from both directed and undirected graph structured data having loops (including self-loops) with labeled or unlabeled nodes and links. Its performance is evaluated through the applications to Web browsing pattern analysis and chemical carcinogenesis analysis. |
| |
Keywords: | data mining graph data Apriori algorithm adjacency matrix Web browsing analysis chemical carcinogenesis analysis |
本文献已被 SpringerLink 等数据库收录! |
|