A Personalized Recommendation Algorithm Based on Weighted Information Entropy and Particle Swarm Optimization

Shuhao Jiang, Jincheng Ding, Liyi Zhang
{"title":"A Personalized Recommendation Algorithm Based on Weighted Information Entropy and Particle Swarm Optimization","authors":"Shuhao Jiang, Jincheng Ding, Liyi Zhang","doi":"10.1155/2021/3209140","DOIUrl":null,"url":null,"abstract":"Similarity calculation is the most important basic algorithm in collaborative filtering recommendation. It plays an important role in calculating the similarity between users (items), finding nearest neighbors, and predicting scores. However, the existing similarity calculation is affected by over reliance on item scores and data sparsity, resulting in low accuracy of recommendation results. This paper proposes a personalized recommendation algorithm based on information entropy and particle swarm optimization, which takes into account the similarity of users’ score and preference characteristics. It uses random particle swarm optimization to optimize their weights to obtain the comprehensive similarity value. Experimental results on public data sets show that the proposed method can effectively improve the accuracy of recommendation results on the premise of ensuring recommendation coverage.","PeriodicalId":18790,"journal":{"name":"Mob. Inf. Syst.","volume":"49 1","pages":"3209140:1-3209140:9"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mob. Inf. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2021/3209140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Similarity calculation is the most important basic algorithm in collaborative filtering recommendation. It plays an important role in calculating the similarity between users (items), finding nearest neighbors, and predicting scores. However, the existing similarity calculation is affected by over reliance on item scores and data sparsity, resulting in low accuracy of recommendation results. This paper proposes a personalized recommendation algorithm based on information entropy and particle swarm optimization, which takes into account the similarity of users’ score and preference characteristics. It uses random particle swarm optimization to optimize their weights to obtain the comprehensive similarity value. Experimental results on public data sets show that the proposed method can effectively improve the accuracy of recommendation results on the premise of ensuring recommendation coverage.
基于加权信息熵和粒子群优化的个性化推荐算法
相似度计算是协同过滤推荐中最重要的基础算法。它在计算用户(项目)之间的相似性、寻找最近的邻居和预测分数方面起着重要作用。然而,现有的相似度计算受到过分依赖条目分数和数据稀疏性的影响,导致推荐结果的准确性较低。本文提出了一种基于信息熵和粒子群优化的个性化推荐算法,该算法考虑了用户评分和偏好特征的相似性。采用随机粒子群算法对它们的权重进行优化,得到综合相似值。在公共数据集上的实验结果表明,该方法可以在保证推荐覆盖率的前提下有效提高推荐结果的准确率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信