CORC  > 兰州理工大学  > 兰州理工大学  > 计算机与通信学院
Mining positive and negative association rules
Zhu, Honglei; Xu, Zhigang
2008
关键词Correlation methods Data mining Correlation coefficient Effectiveness and efficiencies Frequent itemset Minimum support thresholds Mining methods Negative association rules Pruning Pruning strategy
卷号3
页码2748-2752
英文摘要Recently, mining negative association rules has received some attention and been proved to be useful in real world. This paper presents an efficient algorithm(PNAR) for mining both positive and negative association rules in databases. The algorithm extends traditional association rules to include negative association rules. When mining negative association rules, we adopt another minimum support threshold to mine frequent negative itemsets. With a correlation coefficient measure and pruning strategies, the algorithm can find all valid association rules quickly and overcome some limitations of the previous mining methods. The experimental results demonstrate its effectiveness and efficiency. Copyright©(2008) by Computers & Industrial Engineering.
会议录38th International Conference on Computers and Industrial Engineering 2008
会议录出版者Computers and Industrial Engineering
语种英语
内容类型会议论文
源URL[http://ir.lut.edu.cn/handle/2XXMBERH/116843]  
专题计算机与通信学院
作者单位School of Computer and Communication, Lanzhou University of Technology GS, China
推荐引用方式
GB/T 7714
Zhu, Honglei,Xu, Zhigang. Mining positive and negative association rules[C]. 见:.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace