Map-Reduce Based Parallel Firefly Algorithm For Fast Recommendations

Bharti Sharma, Saksham Kumar Sharma, Poonam Bansal, N. Sushma, Sangam Sangam
{"title":"Map-Reduce Based Parallel Firefly Algorithm For Fast Recommendations","authors":"Bharti Sharma, Saksham Kumar Sharma, Poonam Bansal, N. Sushma, Sangam Sangam","doi":"10.1109/AIST55798.2022.10064743","DOIUrl":null,"url":null,"abstract":"The Recommendation System is a strong tool that aids the decision-making process across a variety of situations. Using the aid of aspects such as prior experiences of the user, their ratings, comparable interests, etc., we can acquire the most relevant results upon the application of various optimization techniques. A movie recommendation system is a useful tool/software that aids users in rapidly obtaining optimum results with comparable interests. Using the Firefly clustering technique, this study focuses on a movie recommendation system whose major goal is to propose movies of comparable interest to the active user. Although much study has been done in the topic of recommendation systems, there are still several issues with producing suitable results. To address these issues, we suggested a strategy that uses a meta-heuristic approach to get optimal outcomes. Instead of utilising K-means, fuzzy C-means, and other algorithms, we present the Firefly clustering method in this research to provide the best optimum outcomes in recommendation systems. For performance analysis, many measurements such as t-value, RMSE, SD, and MAE are utilised.","PeriodicalId":360351,"journal":{"name":"2022 4th International Conference on Artificial Intelligence and Speech Technology (AIST)","volume":"194 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 4th International Conference on Artificial Intelligence and Speech Technology (AIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIST55798.2022.10064743","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Recommendation System is a strong tool that aids the decision-making process across a variety of situations. Using the aid of aspects such as prior experiences of the user, their ratings, comparable interests, etc., we can acquire the most relevant results upon the application of various optimization techniques. A movie recommendation system is a useful tool/software that aids users in rapidly obtaining optimum results with comparable interests. Using the Firefly clustering technique, this study focuses on a movie recommendation system whose major goal is to propose movies of comparable interest to the active user. Although much study has been done in the topic of recommendation systems, there are still several issues with producing suitable results. To address these issues, we suggested a strategy that uses a meta-heuristic approach to get optimal outcomes. Instead of utilising K-means, fuzzy C-means, and other algorithms, we present the Firefly clustering method in this research to provide the best optimum outcomes in recommendation systems. For performance analysis, many measurements such as t-value, RMSE, SD, and MAE are utilised.
基于Map-Reduce的快速推荐并行萤火虫算法
推荐系统是一个强大的工具,有助于在各种情况下做出决策。借助用户的先前经验、评分、可比兴趣等方面,我们可以通过应用各种优化技术获得最相关的结果。电影推荐系统是一种有用的工具/软件,可以帮助用户快速获得具有相似兴趣的最佳结果。本研究使用Firefly聚类技术,重点研究了一个电影推荐系统,其主要目标是向活跃用户推荐感兴趣的电影。尽管在推荐系统方面已经做了大量的研究,但在产生合适的结果方面仍然存在一些问题。为了解决这些问题,我们提出了一种使用元启发式方法来获得最佳结果的策略。在这项研究中,我们提出了萤火虫聚类方法,以提供推荐系统的最佳结果,而不是使用K-means,模糊C-means和其他算法。对于性能分析,使用了许多测量方法,如t值、RMSE、SD和MAE。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信