Multi-Round Recommendations for Stable Groups

Ilmo Heiska, K. Stefanidis
{"title":"Multi-Round Recommendations for Stable Groups","authors":"Ilmo Heiska, K. Stefanidis","doi":"10.1109/PIC53636.2021.9687062","DOIUrl":null,"url":null,"abstract":"Recommender systems have been used for suggesting the most suitable products and services for users in diverse scenarios. More recently, the need for making recommendations for groups of users has become increasingly relevant. In addition, there are applications in which recommendations are required in a consecutive sequence. Group recommendations present a challenge for recommender systems: how to balance the preferences of the individual members of a group. On the other hand, when making recommendations for a group for multiple rounds, a recommender has a possibility to dynamically try to balance the preference differences between the group members. This paper introduces two novel methods for multi-round group recommendation scenarios: the adjusted average aggregation method and the average-min-disagreement aggregation method. Both methods aim to provide a group with highly relevant results for the group, while remaining fair for all group members. We experimentally evaluate our approach for groups with different characteristics and show that our methods outperform baseline solutions in all scenarios.","PeriodicalId":297239,"journal":{"name":"2021 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Progress in Informatics and Computing (PIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIC53636.2021.9687062","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Recommender systems have been used for suggesting the most suitable products and services for users in diverse scenarios. More recently, the need for making recommendations for groups of users has become increasingly relevant. In addition, there are applications in which recommendations are required in a consecutive sequence. Group recommendations present a challenge for recommender systems: how to balance the preferences of the individual members of a group. On the other hand, when making recommendations for a group for multiple rounds, a recommender has a possibility to dynamically try to balance the preference differences between the group members. This paper introduces two novel methods for multi-round group recommendation scenarios: the adjusted average aggregation method and the average-min-disagreement aggregation method. Both methods aim to provide a group with highly relevant results for the group, while remaining fair for all group members. We experimentally evaluate our approach for groups with different characteristics and show that our methods outperform baseline solutions in all scenarios.
稳定群体的多轮建议
推荐系统已经被用于在不同的场景中为用户推荐最合适的产品和服务。最近,为用户群体提出建议的必要性变得越来越重要。此外,还有一些应用程序需要按连续顺序提供推荐。群体推荐对推荐系统提出了一个挑战:如何平衡群体中个体成员的偏好。另一方面,当对一个小组进行多轮推荐时,推荐者有可能动态地尝试平衡小组成员之间的偏好差异。本文介绍了针对多轮群体推荐场景的两种新方法:调整平均聚集法和平均最小分歧聚集法。这两种方法都旨在为小组提供高度相关的结果,同时对所有小组成员保持公平。我们通过实验对具有不同特征的群体评估我们的方法,并表明我们的方法在所有情况下都优于基线解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信