多样性度量的Top-K区分子图挖掘-计算机科学与探索.PDF

ISSN 1673-9418 CODEN JKYTA8 E-mail: fcst@vip. 163.com Journal of Frontiers of Computer Science and Technology 1673-9418/2017/ 11(09)- 1379-10 Tel: +86-10 doi: 10.3778/j.issn. 1673-9418.1607016 多样性度量的Top-K 区分子图挖掘* + 王章辉，赵宇海 ，王国仁，李 源 东北大学 计算机科学与工程学院，沈阳 110819 Top-K Discriminative Subgraph Mining Based on Diversity Measure + WANG Zhanghui, ZHAO Yuhai , WANG Guoren, LI Yuan School of Computer Science and Engineering, Northeastern University, Shenyang 110819, China + Corresponding author: E-mail: zhaoyuhai@ WANG Zhanghui, ZHAO Yuhai, WANG Guoren, et al. Top-K discriminative subgraph mining based on diver- sity measure. Journal of Frontiers of Computer Science and Technology, 2017, 11(9) ：1379-1388. Abstract: Discriminative subgraph can be used to characterize complex graph structures and construct efficient graph classification model. This paper proposes the Top-K discriminative subgraph mining problem based on diversity measure. The diversity measure can be used to mine low correlation subgraph patterns in the mining result, which can enhance the usefulness of the discriminative subgraph patterns. By exploiting the graph structure similarity and support set similarity restraints, this paper introduces the criterion of graph pattern diversity measure. Then this paper 索 proposes two efficient algorithms, Greedy-TopK and Leap-TopK, for the problem. Greedy-TopK algorithm employs 探 two step strategies to incrementally and greedily mine K discriminative subgraphs. By limiting the structure similarity