A Latent Group Model for Group Recommendation

Jinghan Shi, Bin Wu, Xiuqin Lin
{"title":"A Latent Group Model for Group Recommendation","authors":"Jinghan Shi, Bin Wu, Xiuqin Lin","doi":"10.1109/MobServ.2015.41","DOIUrl":null,"url":null,"abstract":"Increasingly, thousands of mobile services are provided by mobile Internet service portals. In order to push information that users may fond of, recommender system is needed. In some circumstances, recommendation to groups is necessary, e.g., Recommending movies to a group of friends. In reality, users are in some hidden social network, which can be viewed as groups. So group recommendation is proposed. Time efficiency is a key problem in mobile group recommendation. Research on group recommendation have concentrated on two approaches: aggregating members' ratings into a group profile and aggregating users' recommendations into a group recommendation list. This paper proposes a latent group model LGM, based on the assumption that users are influenced implicitly by some latent factors. LGM presents a novel route to detect groups by taking latent factors into account and makes users' profiles exist in latent factor format. Then users' latent factor profiles are aggregated into a group profile and multiplying method is used for group recommendation. This paper compares LGM with two approaches proposed before in efficiency and accuracy. It achieves better efficiency and accuracy for group recommendation on Movie Lens dataset.","PeriodicalId":166267,"journal":{"name":"2015 IEEE International Conference on Mobile Services","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Mobile Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MobServ.2015.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

Increasingly, thousands of mobile services are provided by mobile Internet service portals. In order to push information that users may fond of, recommender system is needed. In some circumstances, recommendation to groups is necessary, e.g., Recommending movies to a group of friends. In reality, users are in some hidden social network, which can be viewed as groups. So group recommendation is proposed. Time efficiency is a key problem in mobile group recommendation. Research on group recommendation have concentrated on two approaches: aggregating members' ratings into a group profile and aggregating users' recommendations into a group recommendation list. This paper proposes a latent group model LGM, based on the assumption that users are influenced implicitly by some latent factors. LGM presents a novel route to detect groups by taking latent factors into account and makes users' profiles exist in latent factor format. Then users' latent factor profiles are aggregated into a group profile and multiplying method is used for group recommendation. This paper compares LGM with two approaches proposed before in efficiency and accuracy. It achieves better efficiency and accuracy for group recommendation on Movie Lens dataset.
群体推荐的潜在群体模型
越来越多的移动互联网服务门户提供了成千上万种移动服务。为了推送用户可能喜欢的信息,需要有推荐系统。在某些情况下,向群体推荐是必要的,例如,向一群朋友推荐电影。在现实中,用户处于某种隐藏的社交网络中,可以将其视为群体。因此,提出了群体推荐。时间效率是移动群组推荐的关键问题。对群组推荐的研究主要集中在两种方法上:将成员的评价聚合到群组简介中,将用户的推荐聚合到群组推荐列表中。本文在假设用户受到某些潜在因素的隐性影响的基础上,提出了一种潜在群体模型LGM。LGM提出了一种考虑潜在因素的群体检测新途径,使用户档案以潜在因素的形式存在。然后将用户的潜在因素概况聚合成群组概况,并采用乘法进行群组推荐。本文将LGM与之前提出的两种方法在效率和精度上进行了比较。对Movie Lens数据集进行分组推荐,达到了较高的效率和准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信