首页 | 本学科首页   官方微博 | 高级检索  
     

基于属性互信息熵的量化关联规则挖掘
引用本文:刘乐乐,田卫东. 基于属性互信息熵的量化关联规则挖掘[J]. 计算机工程, 2009, 35(14): 38-40
作者姓名:刘乐乐  田卫东
作者单位:合肥工业大学计算机与信息学院,合肥,230009;合肥工业大学计算机与信息学院,合肥,230009
摘    要:在量化关联规则挖掘中存在量化属性及其取值区间的组合爆炸问题,影响算法效率。提出算法BMIQAR,通过考察量化属性间互信息熵,找到具有强信息关系的属性集,从中得到频繁项集以产生规则。实验表明,由于在属性层进行了剪枝,因此缩减了搜索空间,提高了算法的性能,且能得到绝大多数置信度较高的规则。

关 键 词:数据挖掘  量化关联规则  互信息熵
修稿时间: 

Quantitative Association Rules Mining Based on Mutual Information Entropy of Attributes
LIU Le-le,TIAN Wei-dong. Quantitative Association Rules Mining Based on Mutual Information Entropy of Attributes[J]. Computer Engineering, 2009, 35(14): 38-40
Authors:LIU Le-le  TIAN Wei-dong
Affiliation:School of Computer and Information;Hefei University of Technology;Hefei 230009
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 i...
Keywords:data mining  quantitative association rules  mutual information entropy  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号