.png){kind=icon}
.png){kind=icon}
Return
Addressing popularity discrepancy in collaborative filtering
.png){kind=icon}
PRE
AI
DOI：10.1007/s10115-025-02426-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Collaborative filtering (CF) has emerged as the most successful type of recommendation algorithm during the past few decades. However, we observe that CF algorithms often exhibit a popularity discrepancy between user-interacted items and recommended items, e.g., CF algorithms may recommend items that are more popular than the ones the user preferred, especially to those who prefer non-popular items. To address this previously overlooked bias, we make three key contributions: (1) We introduce two novel metrics, PopDis_ED and PopDis_JS, to quantitatively measure popularity discrepancy, providing new perspectives beyond traditional bias indicators; (2) we propose an innovative model-agnostic mutual debiasing (MUDE) framework that uniquely combines a holistic model with a specialized long-tail model through a popularity-aware gating mechanism; (3) comprehensive experiments on four real-world datasets demonstrate that MUDE improves both recommendation accuracy and popularity discrepancy reduction, outperforming state-of-the-art debiasing methods. Moreover, MUDE shows strong generalizability across different types of CF algorithms, making it a practical solution for real-world recommender systems.
Keywords:
Collaborative filtering
Popularity bias
Mutual learning
Ensemble learning
Journal
IF:
3.1
Papers:
533
Citations:
5.2K