A novel association rule mining using genetic algorithm

Maziyar Grami, Reza Gheibi, F. Rahimi
{"title":"A novel association rule mining using genetic algorithm","authors":"Maziyar Grami, Reza Gheibi, F. Rahimi","doi":"10.1109/IKT.2016.7777776","DOIUrl":null,"url":null,"abstract":"Today, development of internet causes a fast growth of internet shops and retailers and makes them as a main marketing channel. This kind of marketing generates a numerous transaction and data which are potentially valuable. Using data mining is an alternative to discover frequent patterns and association rules from datasets. In this paper, we use data mining techniques for discovering frequent customers' buying patterns from a Customer Relationship Management database. There are lots of algorithms for this purpose, such as Apriori and FP-Growth. However, they may not have efficient performance when the data is big, therefore various meta-heuristic methods can be an alternative. In this paper we first excerpt loyal customers by using RFM criterion to face more reliable answers and create relevant dataset. Then association rules are discovered using proposed genetic algorithm. The results showed that our proposed approach is more efficient and have some distinction in compare with other methods mentioned in this research.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IKT.2016.7777776","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Today, development of internet causes a fast growth of internet shops and retailers and makes them as a main marketing channel. This kind of marketing generates a numerous transaction and data which are potentially valuable. Using data mining is an alternative to discover frequent patterns and association rules from datasets. In this paper, we use data mining techniques for discovering frequent customers' buying patterns from a Customer Relationship Management database. There are lots of algorithms for this purpose, such as Apriori and FP-Growth. However, they may not have efficient performance when the data is big, therefore various meta-heuristic methods can be an alternative. In this paper we first excerpt loyal customers by using RFM criterion to face more reliable answers and create relevant dataset. Then association rules are discovered using proposed genetic algorithm. The results showed that our proposed approach is more efficient and have some distinction in compare with other methods mentioned in this research.
一种基于遗传算法的关联规则挖掘方法
在互联网发展的今天,网上商店和网上零售商迅速增长,成为主要的营销渠道。这种营销产生了大量的交易和有潜在价值的数据。使用数据挖掘是从数据集中发现频繁模式和关联规则的一种替代方法。在本文中,我们使用数据挖掘技术从客户关系管理数据库中发现频繁客户的购买模式。有很多算法用于此目的,如Apriori和FP-Growth。然而,当数据量很大时,它们可能没有有效的性能,因此各种元启发式方法可以作为替代方案。本文首先利用RFM准则抽取忠诚客户,面对更可靠的答案并创建相关数据集。然后利用提出的遗传算法发现关联规则。结果表明,本文提出的方法与本研究中提到的其他方法相比,具有更高的效率和一定的区别。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信