作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (14): 38-40. doi: 10.3969/j.issn.1000-3428.2009.14.014

• 软件技术与数据库 • 上一篇    下一篇

基于属性互信息熵的量化关联规则挖掘

刘乐乐,田卫东   

  1. (合肥工业大学计算机与信息学院,合肥 230009)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-07-20 发布日期:2009-07-20

Quantitative Association Rules Mining Based on Mutual Information Entropy of Attributes

LIU Le-le, TIAN Wei-dong   

  1. (School of Computer and Information, Hefei University of Technology, Hefei 230009)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-07-20 Published:2009-07-20

摘要: 在量化关联规则挖掘中存在量化属性及其取值区间的组合爆炸问题,影响算法效率。提出算法BMIQAR,通过考察量化属性间互信息熵,找到具有强信息关系的属性集,从中得到频繁项集以产生规则。实验表明,由于在属性层进行了剪枝,因此缩减了搜索空间,提高了算法的性能,且能得到绝大多数置信度较高的规则。

关键词: 数据挖掘, 量化关联规则, 互信息熵

Abstract: On the research of quantitative association rules mining in database which contains quantitative attributes, the combination of the quantitative attributes and the intervals associated leads to an unmanageably highly sized itemsets and association rule sets which constitute a hamper toward the efficiency of the mining algorithm. The mutual information entropy of the attributes is studied here, and algorithm BMIQAR which can find the frequent itemsets and association rules from the attributes sets with strong information relationship is designed. The experiments show that due to the prune on the attributes, the research space decreases sharply, so the mining efficiency is improved greatly, and the acquired association rules are high confidence ones.

Key words: data mining, quantitative association rules, mutual information entropy

中图分类号: