CORC  > 兰州理工大学  > 兰州理工大学  > 计算机与通信学院
MINING POSITIVE AND NEGATIVE ASSOCIATION RULES
Zhu, Honglei; Xu, Zhigang
2008
关键词Data Mining Association Rule Frequent Itemset Correlation Pruning
页码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.
会议录PROCEEDINGS OF THE 38TH INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3
会议录出版者PUBLISHING HOUSE ELECTRONICS INDUSTRY
会议录出版地PO BOX 173 WANSHOU ROAD, BEIJING 100036, PEOPLES R CHINA
语种英语
WOS研究方向Computer Science ; Engineering
WOS记录号WOS:000262289601106
内容类型会议论文
源URL[http://119.78.100.223/handle/2XXMBERH/37991]  
专题计算机与通信学院
通讯作者Zhu, Honglei
作者单位Lanzhou Univ Technol, Sch Comp & Commun, Gs, Peoples R China
推荐引用方式
GB/T 7714
Zhu, Honglei,Xu, Zhigang. MINING POSITIVE AND NEGATIVE ASSOCIATION RULES[C]. 见:.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


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