一种面向社会互动的协同过滤推荐算法

Jinglong Zhang, Mengxing Huang, Yu Zhang
{"title":"一种面向社会互动的协同过滤推荐算法","authors":"Jinglong Zhang, Mengxing Huang, Yu Zhang","doi":"10.1109/WISA.2017.26","DOIUrl":null,"url":null,"abstract":"When the traditional collaborative filtering algorithm faces high sparse data, its precision and quality of recommendation become unsatisfied. With the development of social networks, it is possible to selectively fill the missing value in the user-item matrix by using the friendship or trust relationship information of social networks. According to the memory-based collaborative filtering algorithm, in the paper, the two steps which are similarity calculation and user rating prediction are taken into account. Besides, this paper has filled appropriately the missing value and improved memory-based collaborative filtering recommendation algorithms to integrate the social relations. The experiment on the Epinions dataset shows that the improved algorithm can effectively alleviate the sparsity problem of user rating data and perform better than other classic algorithms in RMSE and MAP evaluation metrics.","PeriodicalId":204706,"journal":{"name":"2017 14th Web Information Systems and Applications Conference (WISA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Collaborative Filtering Recommendation Algorithm for Social Interaction\",\"authors\":\"Jinglong Zhang, Mengxing Huang, Yu Zhang\",\"doi\":\"10.1109/WISA.2017.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When the traditional collaborative filtering algorithm faces high sparse data, its precision and quality of recommendation become unsatisfied. With the development of social networks, it is possible to selectively fill the missing value in the user-item matrix by using the friendship or trust relationship information of social networks. According to the memory-based collaborative filtering algorithm, in the paper, the two steps which are similarity calculation and user rating prediction are taken into account. Besides, this paper has filled appropriately the missing value and improved memory-based collaborative filtering recommendation algorithms to integrate the social relations. The experiment on the Epinions dataset shows that the improved algorithm can effectively alleviate the sparsity problem of user rating data and perform better than other classic algorithms in RMSE and MAP evaluation metrics.\",\"PeriodicalId\":204706,\"journal\":{\"name\":\"2017 14th Web Information Systems and Applications Conference (WISA)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 14th Web Information Systems and Applications Conference (WISA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WISA.2017.26\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 14th Web Information Systems and Applications Conference (WISA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WISA.2017.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

传统的协同过滤算法在面对高度稀疏的数据时,其推荐精度和质量都不尽如人意。随着社交网络的发展,利用社交网络的友谊或信任关系信息,可以选择性地填补用户-物品矩阵中的缺失值。根据基于记忆的协同过滤算法,本文考虑了相似度计算和用户评分预测两个步骤。此外,本文还对缺失值进行了适当的填充,并改进了基于记忆的协同过滤推荐算法,以整合社会关系。在Epinions数据集上的实验表明,改进算法能有效缓解用户评分数据的稀疏性问题,在RMSE和MAP评价指标上优于其他经典算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Collaborative Filtering Recommendation Algorithm for Social Interaction
When the traditional collaborative filtering algorithm faces high sparse data, its precision and quality of recommendation become unsatisfied. With the development of social networks, it is possible to selectively fill the missing value in the user-item matrix by using the friendship or trust relationship information of social networks. According to the memory-based collaborative filtering algorithm, in the paper, the two steps which are similarity calculation and user rating prediction are taken into account. Besides, this paper has filled appropriately the missing value and improved memory-based collaborative filtering recommendation algorithms to integrate the social relations. The experiment on the Epinions dataset shows that the improved algorithm can effectively alleviate the sparsity problem of user rating data and perform better than other classic algorithms in RMSE and MAP evaluation metrics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Efficient Time Series Classification via Sparse Linear Combination Checking the Statutes in Chinese Judgment Document Based on Editing Distance Algorithm Information Extraction from Chinese Judgment Documents Topic Classification Based on Improved Word Embedding Keyword Extraction for Social Media Short Text
×
引用
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