Iterative Neighbourhood Similarity Computation for Collaborative Filtering

Yun Zhang, Peter M. Andreae
{"title":"Iterative Neighbourhood Similarity Computation for Collaborative Filtering","authors":"Yun Zhang, Peter M. Andreae","doi":"10.1109/WIIAT.2008.222","DOIUrl":null,"url":null,"abstract":"Collaborative filtering recommender systems make predictions based on the preferences of users considered like-minded to the target user (user-based), or the popularities of items similar to the target item (item-based). There have been several approaches of combining user-based and item-based collaborative filtering. However, they are predominantly along the lines of averaging user-based and item-based predictions in a close-to-linear fashion, thus behave like smoothing mechanisms and only work well on sparse datasets. This article proposes a new way of combining user and item based collaborative filtering in a nonlinear fashion. The goal of the approach is to improve recommendation accuracy on regular datasets, by means of a more sensible neighbourhood similarity computation method that guides the user similarity computation using the itemspsila similarities to the item that is being predicted.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIIAT.2008.222","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Collaborative filtering recommender systems make predictions based on the preferences of users considered like-minded to the target user (user-based), or the popularities of items similar to the target item (item-based). There have been several approaches of combining user-based and item-based collaborative filtering. However, they are predominantly along the lines of averaging user-based and item-based predictions in a close-to-linear fashion, thus behave like smoothing mechanisms and only work well on sparse datasets. This article proposes a new way of combining user and item based collaborative filtering in a nonlinear fashion. The goal of the approach is to improve recommendation accuracy on regular datasets, by means of a more sensible neighbourhood similarity computation method that guides the user similarity computation using the itemspsila similarities to the item that is being predicted.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
协同过滤的迭代邻域相似度计算
协同过滤推荐系统根据被认为与目标用户志同道合的用户的偏好(基于用户的)或与目标物品相似的物品的受欢迎程度(基于物品的)进行预测。有几种结合基于用户和基于项目的协同过滤的方法。然而,它们主要是以接近线性的方式平均基于用户和基于项目的预测,因此表现得像平滑机制,只在稀疏数据集上工作得很好。本文提出了一种基于用户和项目的非线性协同过滤的新方法。该方法的目标是通过一种更合理的邻域相似度计算方法来提高常规数据集上的推荐精度,该方法使用项目与被预测项目的相似度来指导用户相似度计算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Effective Usage of Computational Trust Models in Rational Environments Link-Based Anomaly Detection in Communication Networks Quality Information Retrieval for the World Wide Web A k-Nearest-Neighbour Method for Classifying Web Search Results with Data in Folksonomies Concept Extraction and Clustering for Topic Digital Library Construction
×
引用
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