Show simple item record

dc.contributorRomero Moral, Óscar
dc.contributor.authorPrat Sicart, Joan
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria de Serveis i Sistemes d'Informació
dc.description.abstractThe objective of group recommendations is to provide a ranked set of items, a Top-NG, that contains relevant items for every member of the group. A common approach to achieve this consists on select- ing items the group can agree to, by means of so called "group modeling strategies". However, most of these group modeling strategies select items independently of the previous already selected items. Therefore, they can not guarantee properties such as fairness. Understanding fair recommendations means providing an equitable number of relevant items and in similar ranks for each member. Apart from that, there exist also group modeling strategies that try to provide fair recommendations by penalizing or simply dismissing the opinion of those members that obtained a significant item in the previous recommendation, and consequently considering just the happiness of a subset of users instead of the overall group happiness. In this thesis, we introduce a novel definition of fairness that balances the preferences of the members without penalizing or dismissing their opinion, just simply making it more tolerant or more radical according to "how favorable were the previous recommendations for him in comparison with the oth- ers". In this thesis we also mathematically formalize this notion and we provide an algorithm, ARM (Adaptive Relevance-based Modeling), for finding the Top-NG set of group recommendations that satisfy our definition. We benchmark the performance of ARM against 5 of the most widely known group modeling strategies in the literature. Also, we evaluated the performance of all of them for 12 configurations (one dataset, three different group types, and four different metrics to evaluate the group modeling performance). At the end, we found out that ARM performed better in 10 out of 12 scenarios, and in only two of them it generated a recommendations slightly worse than another strategy, providing in this way a significant improvement to the literature. We attribute ARM's success to its novel criteria and its new approach on balancing the user prefer- ences. Most of the current methods do not select items according also with the precedent selected items in Top-NG when generating a new recommendation, and the ones that do, provide to recom- mendations that do not consider always all the user preferences
dc.publisherUniversitat Politècnica de Catalunya
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.lcshRecommender systems (Information filtering)
dc.subject.otherGroup Recommender Systems
dc.subject.otherEvaluation metrics
dc.subject.otherAdaptative Relevance-based Modeling
dc.subject.otherBalanced Normalized Discounted Cumulative Gain
dc.titleMitigate Bias Due To The Popularity Effect In Recommendation Algorithms
dc.typeMaster thesis
dc.subject.lemacSistemes recomanadors (Filtratge d'informació)
dc.rights.accessOpen Access
dc.audience.mediatorFacultat d'Informàtica de Barcelona

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder