Pairwise and Attribute-Aware Decision Tree-Based Preference Elicitation for Cold-Start Recommendation

• URL: http://arxiv.org/abs/2510.27342v1
• Date: Fri, 31 Oct 2025 10:24:15 GMT
• Title: Pairwise and Attribute-Aware Decision Tree-Based Preference Elicitation for Cold-Start Recommendation
• Authors: Alireza Gharahighehi, Felipe Kenji Nakano, Xuehua Yang, Wenhan Cu, Celine Vens,
• Abstract summary: We propose an extension to the decision tree approach for rating elicitation in the context of music recommendation.<n>Our method elicits not only item ratings but also preferences on attributes such as genres to better cluster users.
• Score: 1.1744028458220428
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recommender systems (RSs) are intelligent filtering methods that suggest items to users based on their inferred preferences, derived from their interaction history on the platform. Collaborative filtering-based RSs rely on users past interactions to generate recommendations. However, when a user is new to the platform, referred to as a cold-start user, there is no historical data available, making it difficult to provide personalized recommendations. To address this, rating elicitation techniques can be used to gather initial ratings or preferences on selected items, helping to build an early understanding of the user's tastes. Rating elicitation approaches are generally categorized into two types: non-personalized and personalized. Decision tree-based rating elicitation is a personalized method that queries users about their preferences at each node of the tree until sufficient information is gathered. In this paper, we propose an extension to the decision tree approach for rating elicitation in the context of music recommendation. Our method: (i) elicits not only item ratings but also preferences on attributes such as genres to better cluster users, and (ii) uses item pairs instead of single items at each node to more effectively learn user preferences. Experimental results demonstrate that both proposed enhancements lead to improved performance, particularly with a reduced number of queries.

Related papers

• Tree of Preferences for Diversified Recommendation [54.183647833064136]
  We study diversified recommendation from a data-bias perspective.<n>Inspired by the outstanding performance of large language models (LLMs) in zero-shot inference leveraging world knowledge, we propose a novel approach.
  arXiv  Detail & Related papers  (2025-12-24T04:13:17Z)
• Personalized Recommendations via Active Utility-based Pairwise Sampling [1.704905100460915]
  We propose a utility-based framework that learns preferences from simple and intuitive pairwise comparisons.<n>A central contribution of our work is a novel utility-based active sampling strategy for preference elicitation.
  arXiv  Detail & Related papers  (2025-08-12T19:09:33Z)
• ConsRec: Denoising Sequential Recommendation through User-Consistent Preference Modeling [33.281526528724335]
  We propose the User-Consistent Preference-based Sequential Recommendation System (ConsRec)<n>ConsRec captures stable user preferences and filters noisy items from interaction histories.<n>Results show ConsRec achieves a 13% improvement over baseline recommendation models.
  arXiv  Detail & Related papers  (2025-05-28T08:55:13Z)
• Search-Based Interaction For Conversation Recommendation via Generative Reward Model Based Simulated User [117.82681846559909]
  Conversational recommendation systems (CRSs) use multi-turn interaction to capture user preferences and provide personalized recommendations.<n>We propose a generative reward model based simulated user, named GRSU, for automatic interaction with CRSs.
  arXiv  Detail & Related papers  (2025-04-29T06:37:30Z)
• Counterfactual Learning-Driven Representation Disentanglement for Search-Enhanced Recommendation [19.76299850698492]
  We propose a Counterfactual learning-driven representation disentanglement framework for search-enhanced recommendation.<n>We leverage search queries to construct counterfactual signals to disentangle item representations, isolating only query-independent general features.<n>Experiments on real datasets demonstrate ClardRec is effective in both collaborative filtering and sequential recommendation scenarios.
  arXiv  Detail & Related papers  (2024-11-14T09:51:50Z)
• Dissertation: On the Theoretical Foundation of Model Comparison and Evaluation for Recommender System [4.76281731053599]
  Recommender systems utilize users' historical data to infer customer interests and provide personalized recommendations. Collaborative filtering is one family of recommendation algorithms that uses ratings from multiple users to predict missing ratings. Recommender systems can be more complex and incorporate auxiliary data such as content-based attributes, user interactions, and contextual information.
  arXiv  Detail & Related papers  (2024-11-04T06:31:52Z)
• Cold-start Recommendation by Personalized Embedding Region Elicitation [14.78070264373809]
  Existing elicitation methods employ a fixed set of items to learn the user's preference. This paper addresses this challenge using a 2-phase, personalized elicitation scheme. We show that each subproblem in the elicitation scheme can be efficiently implemented.
  arXiv  Detail & Related papers  (2024-06-03T04:03:24Z)
• Eliciting User Preferences for Personalized Multi-Objective Decision Making through Comparative Feedback [76.7007545844273]
  We propose a multi-objective decision making framework that accommodates different user preferences over objectives. Our model consists of a Markov decision process with a vector-valued reward function, with each user having an unknown preference vector. We suggest an algorithm that finds a nearly optimal policy for the user using a small number of comparison queries.
  arXiv  Detail & Related papers  (2023-02-07T23:58:19Z)
• Modeling Dynamic User Preference via Dictionary Learning for Sequential Recommendation [133.8758914874593]
  Capturing the dynamics in user preference is crucial to better predict user future behaviors because user preferences often drift over time. Many existing recommendation algorithms -- including both shallow and deep ones -- often model such dynamics independently. This paper considers the problem of embedding a user's sequential behavior into the latent space of user preferences.
  arXiv  Detail & Related papers  (2022-04-02T03:23:46Z)
• Set2setRank: Collaborative Set to Set Ranking for Implicit Feedback based Recommendation [59.183016033308014]
  In this paper, we explore the unique characteristics of the implicit feedback and propose Set2setRank framework for recommendation. Our proposed framework is model-agnostic and can be easily applied to most recommendation prediction approaches.
  arXiv  Detail & Related papers  (2021-05-16T08:06:22Z)
• Seamlessly Unifying Attributes and Items: Conversational Recommendation for Cold-Start Users [111.28351584726092]
  We consider the conversational recommendation for cold-start users, where a system can both ask the attributes from and recommend items to a user interactively. Our Conversational Thompson Sampling (ConTS) model holistically solves all questions in conversational recommendation by choosing the arm with the maximal reward to play.
  arXiv  Detail & Related papers  (2020-05-23T08:56:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.