A Novel Group Recommendation Algorithm with Collaborative Filtering

Yang Song, Zheng Hu, Haifeng Liu, Yu Shi, Hui Tian
{"title":"A Novel Group Recommendation Algorithm with Collaborative Filtering","authors":"Yang Song, Zheng Hu, Haifeng Liu, Yu Shi, Hui Tian","doi":"10.1109/SocialCom.2013.138","DOIUrl":null,"url":null,"abstract":"Traditional recommender systems are designed to provide suggestions for individuals. However, there are scenarios in which groups of people are in need of decision support. For example, a group of friends want to choose a restaurant to have a dinner or to watch a movie together. In this paper, we propose a novel group recommendation algorithm for providing suggestions to groups. The proposed algorithm can be divided into two steps: the first step is to predict the preference of the unwatched items for each group members, which is a personalized prediction progress, then, it provides the recommendations for the group by aggregating group members' preferences, which mainly concerns the preferences of members who haven't seen the items. Without complex computation, the proposed algorithm can make accurate predictions of each item for group members. We demonstrate our algorithm on a famous dataset called Movie Lens and use the recall, the precision metrics and a combination of them to evaluate its performance. The experimental results show that the proposed algorithm can provide high quality group recommendations.","PeriodicalId":129308,"journal":{"name":"2013 International Conference on Social Computing","volume":" 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Social Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SocialCom.2013.138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Traditional recommender systems are designed to provide suggestions for individuals. However, there are scenarios in which groups of people are in need of decision support. For example, a group of friends want to choose a restaurant to have a dinner or to watch a movie together. In this paper, we propose a novel group recommendation algorithm for providing suggestions to groups. The proposed algorithm can be divided into two steps: the first step is to predict the preference of the unwatched items for each group members, which is a personalized prediction progress, then, it provides the recommendations for the group by aggregating group members' preferences, which mainly concerns the preferences of members who haven't seen the items. Without complex computation, the proposed algorithm can make accurate predictions of each item for group members. We demonstrate our algorithm on a famous dataset called Movie Lens and use the recall, the precision metrics and a combination of them to evaluate its performance. The experimental results show that the proposed algorithm can provide high quality group recommendations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的协同过滤群推荐算法
传统的推荐系统旨在为个人提供建议。然而,在某些情况下,一群人需要决策支持。例如,一群朋友想要选择一家餐厅吃饭或一起看电影。本文提出了一种新的群体推荐算法,用于向群体提供建议。本文提出的算法分为两步:第一步是预测每个群体成员对未观看项目的偏好,这是一个个性化的预测过程,然后,通过汇总群体成员的偏好来为群体提供推荐,这些偏好主要涉及未看到项目的成员的偏好。该算法不需要复杂的计算,可以对群体成员的每个项目进行准确的预测。我们在一个名为Movie Lens的著名数据集上演示了我们的算法,并使用召回率、精度指标及其组合来评估其性能。实验结果表明,该算法能够提供高质量的群组推荐。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Novel Group Recommendation Algorithm with Collaborative Filtering Access Control Policy Extraction from Unconstrained Natural Language Text Stock Market Manipulation Using Cyberattacks Together with Misinformation Disseminated through Social Media Friendship Prediction on Social Network Users An Empirical Comparison of Graph Databases
×
引用
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