Active learning algorithm for alleviating the user cold start problem of recommender systems

Abstract A key challenge in recommender systems is how to profile new users. A popular solution for this problem is to use active learning strategies. These strategies request ratings for a small set of carefully selected items to reveal the preferences of new users. In this paper, we propose a new...

Full description

Saved in:
Bibliographic Details
Main Authors: Toon De Pessemier, Bruno Willems, Luc Martens
Format: Article
Language:English
Published: Nature Portfolio 2025-07-01
Series:Scientific Reports
Subjects:
Online Access:https://doi.org/10.1038/s41598-025-09708-2
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849234995583909888
author Toon De Pessemier
Bruno Willems
Luc Martens
author_facet Toon De Pessemier
Bruno Willems
Luc Martens
author_sort Toon De Pessemier
collection DOAJ
description Abstract A key challenge in recommender systems is how to profile new users. A popular solution for this problem is to use active learning strategies. These strategies request ratings for a small set of carefully selected items to reveal the preferences of new users. In this paper, we propose a new decision tree-based algorithm for selecting these items. Treating the recommender system as a black box, the ratings collected from interviewing new users are passed on to the recommender system with the intention of improving its performance. Extensive offline evaluation with two data sets and various recommender algorithms shows that our algorithm does indeed improve the performance of the underlying recommender algorithm if users are able to rate most of the items that are presented to them during the interview. However, online evaluation with 50 real users could not prove that our algorithm does indeed have a positive impact on the performance of the underlying recommender algorithm. This reveals the discrepancy between offline and online evaluations of active learning techniques applied in the context of recommender systems. This is due to the fact that real users are not always able to rate the item selected by the active learning algorithm and therefore cannot provide the requested information, in contrast to many machine learning scenarios where the labeling of all samples is possible. Hence, further research is required to provide more certainty regarding the impact of active learning strategies on recommender algorithms.
format Article
id doaj-art-4392dfc3833b424bbdbab3bc98241f12
institution Kabale University
issn 2045-2322
language English
publishDate 2025-07-01
publisher Nature Portfolio
record_format Article
series Scientific Reports
spelling doaj-art-4392dfc3833b424bbdbab3bc98241f122025-08-20T04:02:56ZengNature PortfolioScientific Reports2045-23222025-07-0115111210.1038/s41598-025-09708-2Active learning algorithm for alleviating the user cold start problem of recommender systemsToon De Pessemier0Bruno Willems1Luc Martens2Ghent University, Belgium, Imec, Belgium, WavesGhent University, Belgium, Imec, Belgium, WavesGhent University, Belgium, Imec, Belgium, WavesAbstract A key challenge in recommender systems is how to profile new users. A popular solution for this problem is to use active learning strategies. These strategies request ratings for a small set of carefully selected items to reveal the preferences of new users. In this paper, we propose a new decision tree-based algorithm for selecting these items. Treating the recommender system as a black box, the ratings collected from interviewing new users are passed on to the recommender system with the intention of improving its performance. Extensive offline evaluation with two data sets and various recommender algorithms shows that our algorithm does indeed improve the performance of the underlying recommender algorithm if users are able to rate most of the items that are presented to them during the interview. However, online evaluation with 50 real users could not prove that our algorithm does indeed have a positive impact on the performance of the underlying recommender algorithm. This reveals the discrepancy between offline and online evaluations of active learning techniques applied in the context of recommender systems. This is due to the fact that real users are not always able to rate the item selected by the active learning algorithm and therefore cannot provide the requested information, in contrast to many machine learning scenarios where the labeling of all samples is possible. Hence, further research is required to provide more certainty regarding the impact of active learning strategies on recommender algorithms.https://doi.org/10.1038/s41598-025-09708-2Active learningDecision TreesUser Cold StartRecommender Systems
spellingShingle Toon De Pessemier
Bruno Willems
Luc Martens
Active learning algorithm for alleviating the user cold start problem of recommender systems
Scientific Reports
Active learning
Decision Trees
User Cold Start
Recommender Systems
title Active learning algorithm for alleviating the user cold start problem of recommender systems
title_full Active learning algorithm for alleviating the user cold start problem of recommender systems
title_fullStr Active learning algorithm for alleviating the user cold start problem of recommender systems
title_full_unstemmed Active learning algorithm for alleviating the user cold start problem of recommender systems
title_short Active learning algorithm for alleviating the user cold start problem of recommender systems
title_sort active learning algorithm for alleviating the user cold start problem of recommender systems
topic Active learning
Decision Trees
User Cold Start
Recommender Systems
url https://doi.org/10.1038/s41598-025-09708-2
work_keys_str_mv AT toondepessemier activelearningalgorithmforalleviatingtheusercoldstartproblemofrecommendersystems
AT brunowillems activelearningalgorithmforalleviatingtheusercoldstartproblemofrecommendersystems
AT lucmartens activelearningalgorithmforalleviatingtheusercoldstartproblemofrecommendersystems