基于对偶置信度的有效加权关联规则挖掘研究

Yihua Zhong, Yuxin Liao
{"title":"基于对偶置信度的有效加权关联规则挖掘研究","authors":"Yihua Zhong, Yuxin Liao","doi":"10.1109/ICCIS.2012.232","DOIUrl":null,"url":null,"abstract":"Association rule is an important model in data mining. However, traditional association rules are mostly based on the support and confidence metrics, and most algorithms and researches assumed that each attribute in the database is equal. In fact, because the user preference to the item is different, the mining rules using the existing algorithms are not always appropriate to users. By introducing the concept of weighted dual confidence, a new algorithm which can mine effective weighted rules is proposed in this paper, which is on the basis of the dual confidence association rules used in algorithm. The case studies show that the algorithm can reduce the large number of meaningless association rules and mine interesting negative association rules in real life.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Research of Mining Effective and Weighted Association Rules Based on Dual Confidence\",\"authors\":\"Yihua Zhong, Yuxin Liao\",\"doi\":\"10.1109/ICCIS.2012.232\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Association rule is an important model in data mining. However, traditional association rules are mostly based on the support and confidence metrics, and most algorithms and researches assumed that each attribute in the database is equal. In fact, because the user preference to the item is different, the mining rules using the existing algorithms are not always appropriate to users. By introducing the concept of weighted dual confidence, a new algorithm which can mine effective weighted rules is proposed in this paper, which is on the basis of the dual confidence association rules used in algorithm. The case studies show that the algorithm can reduce the large number of meaningless association rules and mine interesting negative association rules in real life.\",\"PeriodicalId\":269967,\"journal\":{\"name\":\"2012 Fourth International Conference on Computational and Information Sciences\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fourth International Conference on Computational and Information Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIS.2012.232\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Computational and Information Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIS.2012.232","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

摘要

关联规则是数据挖掘中的一种重要模型。然而,传统的关联规则大多基于支持度和置信度度量,大多数算法和研究都假设数据库中的各个属性是相等的。实际上,由于用户对项目的偏好不同,使用现有算法的挖掘规则并不总是适合用户。本文通过引入加权对偶置信度的概念,在算法中使用对偶置信度关联规则的基础上,提出了一种挖掘有效加权规则的新算法。实例研究表明,该算法可以减少大量无意义的关联规则,挖掘出现实生活中有趣的负面关联规则。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research of Mining Effective and Weighted Association Rules Based on Dual Confidence
Association rule is an important model in data mining. However, traditional association rules are mostly based on the support and confidence metrics, and most algorithms and researches assumed that each attribute in the database is equal. In fact, because the user preference to the item is different, the mining rules using the existing algorithms are not always appropriate to users. By introducing the concept of weighted dual confidence, a new algorithm which can mine effective weighted rules is proposed in this paper, which is on the basis of the dual confidence association rules used in algorithm. The case studies show that the algorithm can reduce the large number of meaningless association rules and mine interesting negative association rules in real life.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信