English

应用科学学报 ›› 2006, Vol. 24 ›› Issue (4): 382-386.

• 论文 • 上一篇    下一篇

负关联规则挖掘算法研究

朱玉全, 杨鹤标   

  1. 江苏大学计算机科学与通信工程学院, 江苏镇江 212013
  • 收稿日期:2005-04-04 修回日期:2005-07-05 出版日期:2006-07-31 发布日期:2006-07-31
  • 作者简介:朱玉全,副教授,博士,研究方向:复杂信息系统集成、知识发现及入侵控制,E-mail:yqzhu@ujs.edu.cn
  • 基金资助:
    国家自然科学基金(60572112);江苏大学科研基金(04KJD001)资助项目

Data Mining Algorithm Based on Negative Association Rules

ZHU Yu-quan, YANG He-biao   

  1. School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang 212013, China
  • Received:2005-04-04 Revised:2005-07-05 Online:2006-07-31 Published:2006-07-31

PDF

114

摘要： 典型的正关联规则仅考虑事务中所列举的项目.负关联规则不但要考虑事务中所包含的项目,还必须考虑事务中所不包含的项目,它包含了非常有价值的信息.然而,对于负关联规则挖掘的研究却很少,仅有的几种算法也存在一定的局限性.为此,文中提出了一种快速有效的负关联规则挖掘算法MNAR,并给出了一种基于二进制形式的支持数计算方法.理论和实验结果表明算法MNAR是有效和可行的.

关键词: 数据挖掘, 负关联规则, 频繁项目集

Abstract: Typical association rules consider only items enumerated in transactions, referred to as positive association rules.Negative association rules also consider the same items, but in addition, also consider negated items, i.e., those absent in transactions.Negative association rules are useful in market-basket analysis to identify products that conflict with each other or products that complement each other.They are also convenient for associative classifiers, classifiers that build their classification model based on association rules.Indeed, data mining using such rules necessitates examination of an exponentially large search space.Despite their usefulness, very few algorithms for mine this information have been proposed to date.In this paper, a fast and efficient algorithm MNAR is presented to discover negative association rules.Meanwhile, a method for calculating the support of itemsets is proposed.Experiments show that the MNAR algorithm is effective and feasible.

Key words: negative association rules, frequent itemsets, data mining

中图分类号: