{"title":"Modeling Uncertainty in Group Recommendations","authors":"Dimitris Sacharidis","doi":"10.1145/3314183.3324987","DOIUrl":null,"url":null,"abstract":"In many settings, it is required that items are recommended to a group of users instead of a single user. Most often, when the decision criteria and preferences of the group as a whole are not known, the gold standard is to aggregate individual member preferences or recommendations. Such techniques typically presuppose some process under which group members reach consensus, e.g., least misery, maximum satisfaction, disregarding any uncertainty on whether this presumption is accurate. We propose a different approach that explicitly models the system's uncertainty in the way members might agree on a group ranking. The basic idea is to quantify the likelihood of hypothetical group rankings based on the observed member's individual rankings. Then, the systems recommends a ranking that has the highest expected reward with respect to the hypothetical rankings. Experiments with real and synthetic groups demonstrate the superiority of this approach compared to previous work based on aggregation strategies and to recent fairness-aware techniques.","PeriodicalId":240482,"journal":{"name":"Adjunct Publication of the 27th Conference on User Modeling, Adaptation and Personalization","volume":"534 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Adjunct Publication of the 27th Conference on User Modeling, Adaptation and Personalization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3314183.3324987","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In many settings, it is required that items are recommended to a group of users instead of a single user. Most often, when the decision criteria and preferences of the group as a whole are not known, the gold standard is to aggregate individual member preferences or recommendations. Such techniques typically presuppose some process under which group members reach consensus, e.g., least misery, maximum satisfaction, disregarding any uncertainty on whether this presumption is accurate. We propose a different approach that explicitly models the system's uncertainty in the way members might agree on a group ranking. The basic idea is to quantify the likelihood of hypothetical group rankings based on the observed member's individual rankings. Then, the systems recommends a ranking that has the highest expected reward with respect to the hypothetical rankings. Experiments with real and synthetic groups demonstrate the superiority of this approach compared to previous work based on aggregation strategies and to recent fairness-aware techniques.