可信关联规则及其基于极大团的挖掘算法 - CiteSeerX.PDF

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.19, No.10, October 2008, pp.2597−2610 DOI: 10.3724/SP.J.1001.2008.02597 Tel/Fax: +86-10 © 2008 by Journal of Software . All rights reserved. ∗ 可信关联规则及其基于极大团的挖掘算法 1,2+ 2 1 2 2 肖 波 , 徐前方 , 蔺志青 , 郭 军 , 李春光 1(北京邮电大学 电信工程学院,北京 100876) 2(北京邮电大学 信息工程学院,北京 100876) Credible Association Rule and Its Mining Algorithm Based on Maximum Clique 1,2+ 2 1 2 2 XIAO Bo , XU Qian-Fang , LIN Zhi-Qing , GUO Jun , LI Chun-Guang 1(School of Telecommunication Engineering, Beijing University of Posts Telecommunications, Beijing 100876, China) 2(School of Information Engineering, Beijing University of Posts Telecommunications, Beijing 100876, China) + Corresponding author: E-mail: xiaobo@ Xiao B, Xu QF, Lin ZQ, Guo J, Li CG. Credible association rule and its mining algorithm based on maximum clique. Journal of Software, 2008,19(10):2597−2610. /1000-9825/19/2597.htm Abstract : Existing association-rule mining algorithms mainly rely on the support-based pruning strategy to prune its combinatorial search space. This strategy is not quite effective in the process of mining potentially interesting low-support patterns. To solve this problem, the paper presents a novel concept of association pattern called credible association rule (CAR), in which each item has the same support level. The confidence directly reflects the credible degree of the rule instead of the traditional support. This paper also proposes a MaxCliqueMining algorithm which creates 2-item c