Efficient Mining Of Minimal Distinguishing Subgraph Patterns From Graph Databases
PAKDD'08: Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining(2008)
摘要
Distinguishing patterns represent strong distinguishing knowledge and are very useful for constructing powerful, accurate and robust classifiers. The distinguishing graph patterns(DGPs) are able to capture structure differences between any two categories of graph datasets. Whereas, few previous studies worked on the discovery of DGPs. In this paper, as the first, we study the problem of mining the complete set of minimal DGPs with any number of positive graphs, arbitrary positive support and negative support. We proposed a novel algorithm, MDGP-Mine, to discover the complete set of minimal DGPs. The empirical results show that MDGP-Mine is efficient and scalable.
更多查看译文
关键词
graph mining,distinguishing pattern,distinguishing subgraph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络