Improving consumption diversity via graph-based topic nudging

被引:0
|
作者
Vercoutere, Stefaan [1 ]
Joris, Glen [2 ,3 ]
De Pessemier, Toon [1 ]
Martens, Luc [1 ]
机构
[1] Department of Information Technology, imec-WAVES-UGent, Ghent University, Ghent, Belgium
[2] Department of Communication Sciences, imec-mict-UGent, Ghent University, Ghent, Belgium
[3] The Antwerp Social Lab, Faculty of Social Sciences, UAntwerpen, Antwerp, Belgium
关键词
News; Recommender systems; Knowledge graphs; Exposure diversity; Consumption diversity; IPTC media topics; Nudging;
D O I
10.1007/s11257-025-09429-1
中图分类号
学科分类号
摘要
With the ever-growing amount of news, there is an increasing need for tools capable of filtering out and tailoring the content to the wants and needs of the reader. Over the last decade, researchers have noted that the inclusion of objectives such as diversity, novelty, and serendipity plays a vital role in further improving recommender systems’ perceived value and effectiveness. However, most of these studies limit themselves to a narrow definition of diversity; they only consider individual lists of recommendations, and the impact of diversity on the actual reading behavior of users is typically not examined. In this paper, we present our news recommender system that addresses this problem and aims to increase the diversity of content selected by the user. We propose a pre-filtering graph-based approach of extending the user profile to nudge him/her along a path toward unseen news topics. Results from an online experiment (N = 288) show that (1) intra-list and consumption diversity are significantly improved with negligible impact on accuracy and (2) that the use of diversity-optimized recommender systems can lead to an increase in user satisfaction. © The Author(s), under exclusive licence to Springer Nature B.V. 2025.
引用
收藏
相关论文
共 50 条
  • [1] FairMatch: A Graph-based Approach for Improving Aggregate Diversity in Recommender Systems
    Mansoury, Masoud
    Abdollahpouri, Himan
    Pechenizkiy, Mykola
    Mobasher, Bamshad
    Burke, Robin
    UMAP'20: PROCEEDINGS OF THE 28TH ACM CONFERENCE ON USER MODELING, ADAPTATION AND PERSONALIZATION, 2020, : 154 - 162
  • [2] Improving selection diversity using hybrid graph-based news recommenders
    Vercoutere, Stefaan
    Joris, Glen
    De Pessemier, Toon
    Martens, Luc
    USER MODELING AND USER-ADAPTED INTERACTION, 2024, 34 (04) : 955 - 993
  • [3] GDTM: Graph-based Dynamic Topic Models
    Kambiz Ghoorchian
    Magnus Sahlgren
    Progress in Artificial Intelligence, 2020, 9 : 195 - 207
  • [4] GDTM: Graph-based Dynamic Topic Models
    Ghoorchian, Kambiz
    Sahlgren, Magnus
    PROGRESS IN ARTIFICIAL INTELLIGENCE, 2020, 9 (03) : 195 - 207
  • [5] Graph-based semi-supervised learning via improving the quality of the graph dynamically
    Jiye Liang
    Junbiao Cui
    Jie Wang
    Wei Wei
    Machine Learning, 2021, 110 : 1345 - 1388
  • [6] Graph-based semi-supervised learning via improving the quality of the graph dynamically
    Liang, Jiye
    Cui, Junbiao
    Wang, Jie
    Wei, Wei
    MACHINE LEARNING, 2021, 110 (06) : 1345 - 1388
  • [7] A graph-based method for improving GSAT
    Kask, K
    Dechter, R
    PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, 1996, : 350 - 355
  • [8] Graph-based Techniques for Topic Classification of Tweets in Spanish
    Cordobes, Hector
    Fernandez Anta, Antonio
    Chiroque, Luis F.
    Perez, Fernando
    Redondo, Teofilo
    Santos, Agustin
    INTERNATIONAL JOURNAL OF INTERACTIVE MULTIMEDIA AND ARTIFICIAL INTELLIGENCE, 2014, 2 (05): : 31 - 37
  • [9] Graph-based term weighting scheme for topic modeling
    Bekoulis, Giannis
    Rousseau, Francois
    2016 IEEE 16TH INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS (ICDMW), 2016, : 1039 - 1044
  • [10] Improving graph-based recommendation with unraveled graph learning
    Chang, Chih-Chieh
    Tzeng, Diing-Ruey
    Lu, Chia-Hsun
    Chang, Ming-Yi
    Shen, Chih-Ya
    DATA MINING AND KNOWLEDGE DISCOVERY, 2024, 38 (04) : 2440 - 2465