###
DOI:
Journal of Software:2008.19(10):2597-2610

可信关联规则及其基于极大团的挖掘算法
肖波,徐前方,蔺志青,郭军,李春光
(北京邮电大学 电信工程学院,北京 100876; 北京邮电大学 信息工程学院,北京 100876)
Credible Association Rule and Its Mining Algorithm Based on Maximum Clique
XIAO Bo,XU Qian-Fang,LIN Zhi-Qing,GUO Jun,LI Chun-Guang
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3642   Download 3631
Received:August 08, 2007    Revised:January 10, 2008
> 中文摘要: 目前的关联规则挖掘算法主要依靠基于支持度的剪切策略来减小组合搜索空间.如果挖掘潜在的令人感兴趣的低支持度模式,这种策略并非有效.为此,提出一种新的关联模式——可信关联规则(credible association rule,简称CAR),规则中每个项目的支持度处于同一数量级,规则的置信度直接反映其可信程度,从而可以不必再考虑传统的支持度.同时,提出MaxCliqueMining算法,该算法采用邻接矩阵产生2-项可信集,进而利用极大团思想产生所有可信关联规则.提出并证明了几个相关命题以说明这种规则的特点及算法的可行性和有效性.在告警数据集及Pumsb数据集上的实验表明,该算法挖掘CAR具有较高的效率和准确性.
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 credible sets by adjacency matrix and then generates all rules based on maximum clique. Some propositions are verified and which show the properties of CAR and the feasibility and validity of the algorithm. Experimental results on the alarm dataset and Pumsb dataset demonstrate the effectiveness and accuracy of this method for finding CAR.
文章编号:     中图分类号:    文献标志码:
基金项目:Supported by the National High-Tech Research and Development Plan of China under Grant No.2007AA01Z417 (国家高技术研究发展计划(863)); the 111 Project of China under Grant No.B08004 (高等学校学科创新引智计划) Supported by the National High-Tech Research and Development Plan of China under Grant No.2007AA01Z417 (国家高技术研究发展计划(863)); the 111 Project of China under Grant No.B08004 (高等学校学科创新引智计划)
Foundation items:
Reference text:

肖 波,徐前方,蔺志青,郭 军,李春光.可信关联规则及其基于极大团的挖掘算法.软件学报,2008,19(10):2597-2610

XIAO Bo,XU Qian-Fang,LIN Zhi-Qing,GUO Jun,LI Chun-Guang.Credible Association Rule and Its Mining Algorithm Based on Maximum Clique.Journal of Software,2008,19(10):2597-2610