链接预测协同过滤方法

Zan Huang, Xin Li, Hsinchun Chen
{"title":"链接预测协同过滤方法","authors":"Zan Huang, Xin Li, Hsinchun Chen","doi":"10.1145/1065385.1065415","DOIUrl":null,"url":null,"abstract":"Recommender systems can provide valuable services in a digital library environment, as demonstrated by its commercial success in book, movie, and music industries. One of the most commonly-used and successful recommendation algorithms is collaborative filtering, which explores the correlations within user-item interactions to infer user interests and preferences. However, the recommendation quality of collaborative filtering approaches is greatly limited by the data sparsity problem. To alleviate this problem we have previously proposed graph-based algorithms to explore transitive user-item associations. In this paper, we extend the idea of analyzing user-item interactions as graphs and employ link prediction approaches proposed in the recent network modeling literature for making collaborative filtering recommendations. We have adapted a wide range of linkage measures for making recommendations. Our preliminary experimental results based on a book recommendation dataset show that some of these measures achieved significantly better performance than standard collaborative filtering algorithms","PeriodicalId":248721,"journal":{"name":"Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '05)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"441","resultStr":"{\"title\":\"Link prediction approach to collaborative filtering\",\"authors\":\"Zan Huang, Xin Li, Hsinchun Chen\",\"doi\":\"10.1145/1065385.1065415\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recommender systems can provide valuable services in a digital library environment, as demonstrated by its commercial success in book, movie, and music industries. One of the most commonly-used and successful recommendation algorithms is collaborative filtering, which explores the correlations within user-item interactions to infer user interests and preferences. However, the recommendation quality of collaborative filtering approaches is greatly limited by the data sparsity problem. To alleviate this problem we have previously proposed graph-based algorithms to explore transitive user-item associations. In this paper, we extend the idea of analyzing user-item interactions as graphs and employ link prediction approaches proposed in the recent network modeling literature for making collaborative filtering recommendations. We have adapted a wide range of linkage measures for making recommendations. Our preliminary experimental results based on a book recommendation dataset show that some of these measures achieved significantly better performance than standard collaborative filtering algorithms\",\"PeriodicalId\":248721,\"journal\":{\"name\":\"Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '05)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"441\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1065385.1065415\",\"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 5th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1065385.1065415","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 441

摘要

推荐系统可以在数字图书馆环境中提供有价值的服务,正如它在图书、电影和音乐行业的商业成功所证明的那样。最常用和最成功的推荐算法之一是协同过滤,它探索用户-项目交互中的相关性,以推断用户的兴趣和偏好。然而,协同过滤方法的推荐质量受到数据稀疏性问题的极大限制。为了缓解这个问题,我们之前提出了基于图的算法来探索可传递的用户-项目关联。在本文中,我们扩展了将用户-项目交互分析为图形的思想,并采用了最近网络建模文献中提出的链接预测方法来进行协同过滤推荐。我们采用了广泛的联系措施来提出建议。我们基于图书推荐数据集的初步实验结果表明,其中一些措施取得了比标准协同过滤算法更好的性能
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Link prediction approach to collaborative filtering
Recommender systems can provide valuable services in a digital library environment, as demonstrated by its commercial success in book, movie, and music industries. One of the most commonly-used and successful recommendation algorithms is collaborative filtering, which explores the correlations within user-item interactions to infer user interests and preferences. However, the recommendation quality of collaborative filtering approaches is greatly limited by the data sparsity problem. To alleviate this problem we have previously proposed graph-based algorithms to explore transitive user-item associations. In this paper, we extend the idea of analyzing user-item interactions as graphs and employ link prediction approaches proposed in the recent network modeling literature for making collaborative filtering recommendations. We have adapted a wide range of linkage measures for making recommendations. Our preliminary experimental results based on a book recommendation dataset show that some of these measures achieved significantly better performance than standard collaborative filtering algorithms
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信