基于联合意义度量的Top-K图模式挖掘.doc

《计算机学报》2010年第2期， 2010，33（2） 基于联合意义度量的Top-K图模式挖掘 刘勇 高宏 李建中 (哈尔滨工业大学计算机科学与技术学院 哈尔滨 150001) 摘要 提出了一个新的研究问题:挖掘Top-K图模式,联合起来使某个意义度量最大化.利用信息论的概念,给出了两个具体的问题定义MES和MIGS,并证明它们是NP-hard.提出了两个高效算法Greedy-Topk和Cluster-TopK. Greedy-TopK先产生频繁子图,然后增量贪心选择K个图模式. Cluster-TopK先挖掘频繁子图的一个代表模式集合,然后从代表模式中增量贪心选择K个图模式.当意义度量满足submodular性质时, Greedy-TopK能提供近似比保证. Cluster-TopK没有近似比保证,但比Greedy-TopK更高效. 实验结果显示,在结果可用性方面,本文提出的Top-K挖掘优于传统的Top-K挖掘. Cluster-TopK比Greedy-TopK快至少一个数量级. 而且, 在质量和可用性方面, Cluster-TopK的挖掘结果非常类似于Greedy-TopK的挖掘结果. 关键词 图挖掘; 图数据库; 频繁子图; 代表模式; 联合熵; 信息增益 中图法分类号: TP311 Top-K Graph Patterns Mining Based on Some Joint Significance Measure Liu Yong Gao Hong Li Jianzhong (School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001) Abstract This paper proposes a novel problem of mining top-k graph patterns that jointly maximize some significance measure from graph databases. By exploiting the concepts of information theory, we give two problem formulations, MES and MIGS, and prove that they are NP-hard. Two efficient algorithms, Greedy-TopK and Cluster-TopK, are proposed for this new problem. Greedy-TopK first generates frequent subgraphs, and then incrementally and greedily selects K graph patterns from frequent subgraphs. Cluster-TopK first mines a set of representative patterns for frequent subgraphs, and then incrementally and greedily selects K graph patterns from representative patterns. When a given significance measure satisfies the submodular property, Greedy-TopK can provide tight approximation bound. Cluster-TopK has no approximation bound guarantee but is more efficient than Greedy-TopK. Extensive experimental results demonstrate that the Top-K mining proposed in this paper is superior to the traditional Top-K mining in terms of results usefulness. Cluster-TopK can achieve at least an order of magnitude speedup than Greedy-TopK, while achieving comparable mining results in terms of quality and usefulness. Keywords graph mining; gra