基于粒子群的推荐系统优化

Pub Date : 2023-02-28 DOI:10.14483/23448393.19925
Nancy Yaneth Gelvez García, Jesús Gil-Ruíz, Jhon Fredy Bayona-Navarro
{"title":"基于粒子群的推荐系统优化","authors":"Nancy Yaneth Gelvez García, Jesús Gil-Ruíz, Jhon Fredy Bayona-Navarro","doi":"10.14483/23448393.19925","DOIUrl":null,"url":null,"abstract":"Background: Recommender systems are one of the most widely used technologies by electronic businesses and internet applications as part of their strategies to improve customer experiences and boost sales. Recommender systems aim to suggest content based on its characteristics and on user preferences. The best recommender systems are able to deliver recommendations in the shortest possible time and with the least possible number of errors, which is challenging when working with large volumes of data.\nMethod: This article presents a novel technique to optimize recommender systems using particle swarm algorithms. The objective of the selected genetic algorithm is to find the best hyperparameters that minimize the difference between the expected values and those obtained by the recommender system.\nResults: The algorithm demonstrates viability given the results obtained, highlighting its simple implementation and the minimal and easily attainable computational resources necessary for its execution.\nConclusions: It was possible to develop an algorithm using the most convenient properties of particle swarms in order to optimize recommender systems, thus achieving the ideal behavior for its implementation in the proposed scenario.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimization of Recommender Systems Using Particle Swarms\",\"authors\":\"Nancy Yaneth Gelvez García, Jesús Gil-Ruíz, Jhon Fredy Bayona-Navarro\",\"doi\":\"10.14483/23448393.19925\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Background: Recommender systems are one of the most widely used technologies by electronic businesses and internet applications as part of their strategies to improve customer experiences and boost sales. Recommender systems aim to suggest content based on its characteristics and on user preferences. The best recommender systems are able to deliver recommendations in the shortest possible time and with the least possible number of errors, which is challenging when working with large volumes of data.\\nMethod: This article presents a novel technique to optimize recommender systems using particle swarm algorithms. The objective of the selected genetic algorithm is to find the best hyperparameters that minimize the difference between the expected values and those obtained by the recommender system.\\nResults: The algorithm demonstrates viability given the results obtained, highlighting its simple implementation and the minimal and easily attainable computational resources necessary for its execution.\\nConclusions: It was possible to develop an algorithm using the most convenient properties of particle swarms in order to optimize recommender systems, thus achieving the ideal behavior for its implementation in the proposed scenario.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2023-02-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14483/23448393.19925\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14483/23448393.19925","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

背景:推荐系统是电子商务和互联网应用中使用最广泛的技术之一,是他们改善客户体验和促进销售战略的一部分。推荐系统的目标是根据内容的特征和用户偏好来推荐内容。最好的推荐系统能够在尽可能短的时间内以尽可能少的错误提供建议,这在处理大量数据时是具有挑战性的。方法:提出了一种利用粒子群算法优化推荐系统的新方法。所选择的遗传算法的目标是找到最佳的超参数,使期望值与推荐系统获得的值之间的差异最小。结果:该算法证明了所获得结果的可行性,突出了其简单的实现以及执行所需的最小且易于获得的计算资源。结论:有可能开发一种算法,利用粒子群最方便的特性来优化推荐系统,从而在提议的场景中实现理想的行为。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
Optimization of Recommender Systems Using Particle Swarms
Background: Recommender systems are one of the most widely used technologies by electronic businesses and internet applications as part of their strategies to improve customer experiences and boost sales. Recommender systems aim to suggest content based on its characteristics and on user preferences. The best recommender systems are able to deliver recommendations in the shortest possible time and with the least possible number of errors, which is challenging when working with large volumes of data. Method: This article presents a novel technique to optimize recommender systems using particle swarm algorithms. The objective of the selected genetic algorithm is to find the best hyperparameters that minimize the difference between the expected values and those obtained by the recommender system. Results: The algorithm demonstrates viability given the results obtained, highlighting its simple implementation and the minimal and easily attainable computational resources necessary for its execution. Conclusions: It was possible to develop an algorithm using the most convenient properties of particle swarms in order to optimize recommender systems, thus achieving the ideal behavior for its implementation in the proposed scenario.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1