负关联规则的研究  

Study on Negative Association Rules

作　　者：董祥军[1] 王淑静[2] 宋瀚涛[1] 陆玉昌[3] 

机构地区：[1]北京理工大学信息科学技术学院计算机科学工程系 [2]中国航空结算中心,北京100028 [3]清华大学智能系统与技术国家重点实验室,北京100084

出　　处：《北京理工大学学报》2004年第11期978-981,共4页Transactions of Beijing Institute of Technology

基　　金：国家"九七三"计划项目(G1998030414)

摘　　要：传统的关联规则是A B的形式,将这种形式加以扩展,讨论了A B,A B,A B三种形式,给出了一种负关联规则中支持度与置信度简单有效的计算方法。讨论了同时研究正、负关联规则后出现的矛盾规则问题,提出了用相关性解决这些问题的方法和一种挖掘频繁项集中正、负关联规则的算法,进行了算法的验证实验。实验结果表明,该算法能检测并删除相互矛盾的规则。Association rules are traditionally defined as of the form AB. This form is extended to other three forms AB, AB and AB. A simple but efficient method is proposed to calculate the support and confidence of the three forms. Some problems such as self-contradictory rules may occur when studying both the positive and negative association rules simultaneously. These problems are discussed and the corresponding solution by correlation is proposed. An algorithm is also proposed to mine both positive and negative association rules from frequent itemsets. An experiment is performed and the experimental results demonstrate that the algorithm can detect and then delete those self-contradictory rules.

关 键 词：负关联规则 频繁项集 支持度 置信度 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]