An Improved Association Rule Mining Algorithm Based on Apriori and Ant Colony approaches

Dr.Hussam M. Al Shorman, Dr.Yosef Hasan Jbara
{"title":"An Improved Association Rule Mining Algorithm Based on Apriori and Ant Colony approaches","authors":"Dr.Hussam M. Al Shorman, Dr.Yosef Hasan Jbara","doi":"10.9790/3021-0707011823","DOIUrl":null,"url":null,"abstract":"The Knowledge Discovery in Databases (KDD) field of data mining is useful in finding trends, patterns and anomalies in the databases which is helpful to make accurate decisions for the future. Association rule mining is an important topic in data mining field. Association rule mining finds collections of data attributes that are statistically related to the data available. Apriori algorithm generates all significant association rules between items in the database. Besides, ACO algorithms are probabilistic techniques for solving computational problems that are based in finding as good as possible paths through graphs by imitating the ants’ search for food. The use of such techniques has been very successful for several problems. The collaborative use of ACO and DM (the use of ACO algorithms for DM tasks) is a very promising direction. In this paper, based on association rule mining and Apriori algorithm, an improved Ant Colony algorithm is proposed to solve the Frequent Pattern Mining problem. Ant colony algorithm is employed as evolutionary algorithm to optimize the obtained set of association rules produced using Apriori algorithm. The results and comparison of the method is shown at the end of the paper. --------------------------------------------------------------------------------------------------------------------------------------Date of Submission: 11-07-2017 Date of acceptance: 22-07-2017 --------------------------------------------------------------------------------------------------------------------------------------","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IOSR journal of computer engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9790/3021-0707011823","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The Knowledge Discovery in Databases (KDD) field of data mining is useful in finding trends, patterns and anomalies in the databases which is helpful to make accurate decisions for the future. Association rule mining is an important topic in data mining field. Association rule mining finds collections of data attributes that are statistically related to the data available. Apriori algorithm generates all significant association rules between items in the database. Besides, ACO algorithms are probabilistic techniques for solving computational problems that are based in finding as good as possible paths through graphs by imitating the ants’ search for food. The use of such techniques has been very successful for several problems. The collaborative use of ACO and DM (the use of ACO algorithms for DM tasks) is a very promising direction. In this paper, based on association rule mining and Apriori algorithm, an improved Ant Colony algorithm is proposed to solve the Frequent Pattern Mining problem. Ant colony algorithm is employed as evolutionary algorithm to optimize the obtained set of association rules produced using Apriori algorithm. The results and comparison of the method is shown at the end of the paper. --------------------------------------------------------------------------------------------------------------------------------------Date of Submission: 11-07-2017 Date of acceptance: 22-07-2017 --------------------------------------------------------------------------------------------------------------------------------------
基于Apriori和蚁群方法的改进关联规则挖掘算法
数据库中的知识发现(Knowledge Discovery in Databases, KDD)是数据挖掘的一个领域,它有助于发现数据库中的趋势、模式和异常,从而为未来做出准确的决策。关联规则挖掘是数据挖掘领域的一个重要课题。关联规则挖掘查找与可用数据在统计上相关的数据属性集合。Apriori算法生成数据库中项目之间所有重要的关联规则。此外,蚁群算法是解决计算问题的概率技术,其基础是通过模仿蚂蚁寻找食物的过程,在图中找到尽可能好的路径。这种技术在解决几个问题方面非常成功。蚁群算法和DM的协同使用(在DM任务中使用蚁群算法)是一个非常有前途的方向。本文在关联规则挖掘和Apriori算法的基础上,提出了一种改进的蚁群算法来解决频繁模式挖掘问题。采用蚁群算法作为进化算法,对Apriori算法生成的关联规则集进行优化。最后给出了方法的结果和比较。-------------------------------------------------------------------------------------------------------------------------------------- 提交日期:11-07-2017验收日期:22-07-2017 --------------------------------------------------------------------------------------------------------------------------------------
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信