An integrated approach to derive effective rules from association rule mining using genetic algorithm

M. Kannika Nirai Vaani, E. Ramaraj
{"title":"An integrated approach to derive effective rules from association rule mining using genetic algorithm","authors":"M. Kannika Nirai Vaani, E. Ramaraj","doi":"10.1109/ICPRIME.2013.6496453","DOIUrl":null,"url":null,"abstract":"Association rule mining is one of the most important and well-researched techniques of data mining, that aims to induce associations among sets of items in transaction databases or other data repositories. Currently Apriori algorithms play a major role in identifying frequent item set and deriving rule sets out of it. But it uses the conjunctive nature of association rules, and the single minimum support factor to generate the effective rules. However the above two factors are alone not adequate to derive useful rules effectively. Hence in the proposed algorithm we have taken Apriori Algorithm as a reference and included disjunctive rules and multiple minimum supports also to capture all possible useful rules. Although few algorithms [4] [5] are dealing the disjunctive rules and multiple minimum supports separately to some extent, the proposed concept is to integrate all into one that lead to a robust algorithm. And the salient feature of our work is introducing Genetic Algorithm (GA) in deriving possible Association Rules from the frequent item set in an optimized manner. Besides we have taken one more add-on factor `Lift Ratio' which is to validate the generated Association rules are strong enough to infer useful information. Hence this new approach aims to put together the above points to generate an efficient algorithm with appropriate modification in Apriori Algorithm so that to offer interesting/useful rules in an effective and optimized manner with the help of Genetic Algorithm.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPRIME.2013.6496453","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Association rule mining is one of the most important and well-researched techniques of data mining, that aims to induce associations among sets of items in transaction databases or other data repositories. Currently Apriori algorithms play a major role in identifying frequent item set and deriving rule sets out of it. But it uses the conjunctive nature of association rules, and the single minimum support factor to generate the effective rules. However the above two factors are alone not adequate to derive useful rules effectively. Hence in the proposed algorithm we have taken Apriori Algorithm as a reference and included disjunctive rules and multiple minimum supports also to capture all possible useful rules. Although few algorithms [4] [5] are dealing the disjunctive rules and multiple minimum supports separately to some extent, the proposed concept is to integrate all into one that lead to a robust algorithm. And the salient feature of our work is introducing Genetic Algorithm (GA) in deriving possible Association Rules from the frequent item set in an optimized manner. Besides we have taken one more add-on factor `Lift Ratio' which is to validate the generated Association rules are strong enough to infer useful information. Hence this new approach aims to put together the above points to generate an efficient algorithm with appropriate modification in Apriori Algorithm so that to offer interesting/useful rules in an effective and optimized manner with the help of Genetic Algorithm.
基于遗传算法的关联规则挖掘有效规则的集成方法
关联规则挖掘是数据挖掘中最重要和研究最充分的技术之一,旨在诱导事务数据库或其他数据存储库中的项目集之间的关联。目前,Apriori算法在识别频繁项集并从中导出规则集方面发挥着重要作用。它利用关联规则的合取性,利用单个最小支持因子生成有效规则。然而,仅凭上述两个因素不足以有效地推导出有用的规则。因此,在本文提出的算法中,我们以Apriori算法为参考,并加入析取规则和多个最小支持来捕获所有可能的有用规则。虽然很少有算法[4][5]在一定程度上分别处理析取规则和多个最小支持,但所提出的概念是将它们整合为一个,从而产生一个鲁棒算法。本文工作的显著特点是引入遗传算法,以优化的方式从频繁项集中推导出可能的关联规则。此外,我们还采用了一个附加因素“升力比”,这是为了验证生成的关联规则是否足够强大,可以推断出有用的信息。因此,这种新方法旨在将上述几点结合起来,在Apriori算法的基础上进行适当的修改,生成一种高效的算法,从而在遗传算法的帮助下以有效和优化的方式提供有趣/有用的规则。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信