一种基于用户兴趣扩散和时间相关的改进协同过滤算法

Kangle Hui, Hong Hou, Siyu Xue
{"title":"一种基于用户兴趣扩散和时间相关的改进协同过滤算法","authors":"Kangle Hui, Hong Hou, Siyu Xue","doi":"10.1145/3395260.3395267","DOIUrl":null,"url":null,"abstract":"This paper proposes an improved collaborative filtering recommendation algorithm based on user interest diffusion and the time correlation. Firstly, the algorithm improves user synthesis similarity calculation method based on user interest diffusion, calculates the direct similarity of user interest and the similarity of user interest diffusion, and obtains the synthesis similarity of user interest through parameter adjustment. Then, for the user interest change with time, the time correlation function is applied to the similarity calculation between users. Finally, the recommendation weight is divided into the time correlation data weight and the synthesis similarity data weight, so that a more accurate prediction score is obtained.. The comparison experiments showed that the algorithm can reduce the sparseness of the data set effectively when the data is sparse, and improves the precision of the recommendation algorithm.","PeriodicalId":103490,"journal":{"name":"Proceedings of the 2020 5th International Conference on Mathematics and Artificial Intelligence","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Collaborative Filtering Algorithm Based on User Interest Diffusion and Time Correlation\",\"authors\":\"Kangle Hui, Hong Hou, Siyu Xue\",\"doi\":\"10.1145/3395260.3395267\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an improved collaborative filtering recommendation algorithm based on user interest diffusion and the time correlation. Firstly, the algorithm improves user synthesis similarity calculation method based on user interest diffusion, calculates the direct similarity of user interest and the similarity of user interest diffusion, and obtains the synthesis similarity of user interest through parameter adjustment. Then, for the user interest change with time, the time correlation function is applied to the similarity calculation between users. Finally, the recommendation weight is divided into the time correlation data weight and the synthesis similarity data weight, so that a more accurate prediction score is obtained.. The comparison experiments showed that the algorithm can reduce the sparseness of the data set effectively when the data is sparse, and improves the precision of the recommendation algorithm.\",\"PeriodicalId\":103490,\"journal\":{\"name\":\"Proceedings of the 2020 5th International Conference on Mathematics and Artificial Intelligence\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2020 5th International Conference on Mathematics and Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3395260.3395267\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 5th International Conference on Mathematics and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3395260.3395267","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种改进的基于用户兴趣扩散和时间相关性的协同过滤推荐算法。该算法首先改进基于用户兴趣扩散的用户综合相似度计算方法,计算用户兴趣的直接相似度和用户兴趣扩散相似度,通过参数调整得到用户兴趣的综合相似度;然后,针对用户兴趣随时间的变化,将时间相关函数应用于用户之间的相似度计算。最后,将推荐权重分为时间相关数据权重和综合相似数据权重,从而得到更准确的预测分数。对比实验表明,在数据稀疏的情况下,该算法能有效降低数据集的稀疏性,提高推荐算法的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improved Collaborative Filtering Algorithm Based on User Interest Diffusion and Time Correlation
This paper proposes an improved collaborative filtering recommendation algorithm based on user interest diffusion and the time correlation. Firstly, the algorithm improves user synthesis similarity calculation method based on user interest diffusion, calculates the direct similarity of user interest and the similarity of user interest diffusion, and obtains the synthesis similarity of user interest through parameter adjustment. Then, for the user interest change with time, the time correlation function is applied to the similarity calculation between users. Finally, the recommendation weight is divided into the time correlation data weight and the synthesis similarity data weight, so that a more accurate prediction score is obtained.. The comparison experiments showed that the algorithm can reduce the sparseness of the data set effectively when the data is sparse, and improves the precision of the recommendation algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信