关联规则优化的萤火虫算法

S. Mehta, Mandhatya Singh, Navrattan Kaur
{"title":"关联规则优化的萤火虫算法","authors":"S. Mehta, Mandhatya Singh, Navrattan Kaur","doi":"10.1109/ICSC48311.2020.9182770","DOIUrl":null,"url":null,"abstract":"With the remarkable increase in online transactions, market basket analysis has become more relevant. Identifying the buying patterns and generating more relevant recommendations to users is the prime goal of online shopping portals. However, extracting associations between products from millions of transactions is a big challenge. Association rule mining techniques are commonly used to discover the associations among transactional databases. To further enhance the elicitation of important strong rules between items, this work applies metaheuristic algorithms such as Genetic Algorithm, Particle Swarm Optimization and Firefly algorithm on Apriori algorithm. The performance of proposed approach is evaluated in terms of number of rules generated and the time complexity of the algorithm. Experiments performed over two different transactional datasets of varying size reveals that Apriori with firefly results into least number of rules as compared to GA and PSO.","PeriodicalId":334609,"journal":{"name":"2020 6th International Conference on Signal Processing and Communication (ICSC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Firefly Algorithm For Optimization of Association Rules\",\"authors\":\"S. Mehta, Mandhatya Singh, Navrattan Kaur\",\"doi\":\"10.1109/ICSC48311.2020.9182770\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the remarkable increase in online transactions, market basket analysis has become more relevant. Identifying the buying patterns and generating more relevant recommendations to users is the prime goal of online shopping portals. However, extracting associations between products from millions of transactions is a big challenge. Association rule mining techniques are commonly used to discover the associations among transactional databases. To further enhance the elicitation of important strong rules between items, this work applies metaheuristic algorithms such as Genetic Algorithm, Particle Swarm Optimization and Firefly algorithm on Apriori algorithm. The performance of proposed approach is evaluated in terms of number of rules generated and the time complexity of the algorithm. Experiments performed over two different transactional datasets of varying size reveals that Apriori with firefly results into least number of rules as compared to GA and PSO.\",\"PeriodicalId\":334609,\"journal\":{\"name\":\"2020 6th International Conference on Signal Processing and Communication (ICSC)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 6th International Conference on Signal Processing and Communication (ICSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSC48311.2020.9182770\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 6th International Conference on Signal Processing and Communication (ICSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSC48311.2020.9182770","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

随着网上交易的显著增加,市场购物篮分析变得更加相关。识别购买模式并为用户生成更相关的推荐是在线购物门户网站的主要目标。然而,从数以百万计的交易中提取产品之间的关联是一个巨大的挑战。关联规则挖掘技术通常用于发现事务数据库之间的关联。为了进一步增强对项目间重要强规则的启发,本工作在Apriori算法上应用了遗传算法、粒子群算法和Firefly算法等元启发式算法。根据生成的规则数量和算法的时间复杂度来评价该方法的性能。在两个不同大小的事务数据集上进行的实验表明,与遗传算法和粒子群算法相比,带有萤火虫的Apriori算法产生的规则数量最少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Firefly Algorithm For Optimization of Association Rules
With the remarkable increase in online transactions, market basket analysis has become more relevant. Identifying the buying patterns and generating more relevant recommendations to users is the prime goal of online shopping portals. However, extracting associations between products from millions of transactions is a big challenge. Association rule mining techniques are commonly used to discover the associations among transactional databases. To further enhance the elicitation of important strong rules between items, this work applies metaheuristic algorithms such as Genetic Algorithm, Particle Swarm Optimization and Firefly algorithm on Apriori algorithm. The performance of proposed approach is evaluated in terms of number of rules generated and the time complexity of the algorithm. Experiments performed over two different transactional datasets of varying size reveals that Apriori with firefly results into least number of rules as compared to GA and PSO.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信