A novel approach to prune mined association rules in large databases

D. Narmadha, G. NaveenSundar, S. Geetha
{"title":"A novel approach to prune mined association rules in large databases","authors":"D. Narmadha, G. NaveenSundar, S. Geetha","doi":"10.1109/ICECTECH.2011.5942031","DOIUrl":null,"url":null,"abstract":"Association rule mining finds interesting associations and/or correlation relationships among large set of data items. Association rules shows attribute value conditions that occur frequently together in a given dataset. However, the usefulness of association rules is strongly limited by the huge amount of delivered rules. It is crucial to help the decision-maker with an efficient postprocessing step in order to select interesting association rules throughout huge volumes of discovered rules. This motivates the need for association analysis. This paper presents a survey of different association rule mining techniques for market basket analysis, highlighting strengths of different association rule mining techniques. Further, we want to point out potential pitfalls as well as challenging issues need to be addressed by an association rule mining technique. We believe that the results of this evaluation will help decision maker for making important decisions.","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"1991 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 3rd International Conference on Electronics Computer Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECTECH.2011.5942031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Association rule mining finds interesting associations and/or correlation relationships among large set of data items. Association rules shows attribute value conditions that occur frequently together in a given dataset. However, the usefulness of association rules is strongly limited by the huge amount of delivered rules. It is crucial to help the decision-maker with an efficient postprocessing step in order to select interesting association rules throughout huge volumes of discovered rules. This motivates the need for association analysis. This paper presents a survey of different association rule mining techniques for market basket analysis, highlighting strengths of different association rule mining techniques. Further, we want to point out potential pitfalls as well as challenging issues need to be addressed by an association rule mining technique. We believe that the results of this evaluation will help decision maker for making important decisions.
一种新的大型数据库关联规则剪枝方法
关联规则挖掘在大量数据项之间发现有趣的关联和/或相关关系。关联规则显示在给定数据集中经常一起出现的属性值条件。然而,关联规则的有用性受到交付的大量规则的严重限制。为了从大量已发现的规则中选择有趣的关联规则,为决策者提供有效的后处理步骤是至关重要的。这激发了对关联分析的需求。本文综述了用于购物篮分析的不同关联规则挖掘技术,突出了不同关联规则挖掘技术的优势。此外,我们希望指出关联规则挖掘技术需要解决的潜在缺陷和具有挑战性的问题。我们相信,这一评估结果将有助于决策者做出重要决策。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信