演变图上的连接子图演变模式挖掘.pdf

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.21, No.5, May 2010, pp.1007− 1019 doi: 10.3724/SP.J.1001.2010.03531 Tel/Fax: +86-10 © by Institute of Software , the Chinese Academy of Sciences . All rights reserved. ∗ 演变图上的连接子图演变模式挖掘 + 邹兆年 , 高 宏, 李建中, 张 硕 (哈尔滨工业大学 计算机科学与技术学院,黑龙江 哈尔滨 150001) Mining Evolving Patterns of Connection Subgraphs over Evolving Graphs + ZOU Zhao-Nian , GAO Hong, LI Jian-Zhong, ZHANG Shuo (School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China) + Corresponding author: E-mail: znzou@ Zou ZN, Gao H, Li JZ, Zhang S. Mining evolving patterns of connection subgraphs over evolving graphs. Journal of Software, 2010,21(5):1007−1019. /1000-9825/3531.htm Abstract : This paper investigates into the problem of mining evolving graphs, i.e. graphs changing over time. It focuses on mining evolving pattern set of connection subgraphs between given vertices in an evolving graph. A similarity function of connection subgraphs and the algorithm to compute it have been presented. Based on this similarity function, a dynamic programming algorithm with polynomial time complexity is proposed to find evolving pattern set. The experimental results on synthetic datasets show that the proposed algorithm has low error rate and high efficiency. The mining results on real datasets illustrate that the mining results have practical significance in real applications. Key words: evolving graph; connection subgraph; evolving pattern 摘 要: 探讨演变图(即随时间变化的图)的挖