从图数据库中挖掘频繁跳跃模式-软件学报.PDFVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.21, No.10, October 2010, pp.2477−2493 doi: 10.3724/SP.J.1001.2010.03831 Tel/Fax: +86-10 © by Institute of Software , the Chinese Academy of Sciences . All rights reserved. ∗ 从图数据库中挖掘频繁跳跃模式 + 刘 勇 , 李建中, 高 宏 (哈尔滨工业大学 计算机科学与技术学院,黑龙江 哈尔滨 150001) Mining Frequent Jump Patterns from Graph Databases + LIU Yong , LI Jian-Zhong, GAO Hong (School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China) + Corresponding author: E-mail: liuyong123456@ Liu Y, Li JZ, Gao H. Mining frequent jump patterns from graph databases. Journal of Software, 2010,21(10): 2477−2493. /1000-9825/3831.htm Abstract : Many algorithms on subgraph mining have been proposed. However, the number of frequent subgraphs generated by these algorithms may be too large to be effectively explored by users, especially when the support threshold is low. In this paper, a new problem of mining frequent jump patterns from graph databases is proposed. Mining frequent jump patterns can dramatically reduce the number of output graph patterns and still capture interesting graph patterns. Futhermore, jump patterns are robust against noise and dynamic changes in data. However, this problem is challenging due to the underlying complexity associated with frequent subgraph mining as well as the absence of Apriori property for jump patterns. By exploring the properties of jump patterns, two novel effective pruning techniques are proposed: Internal-Extension-Based pruning and external-extension-based pruning. Based on the proposed prunin