mlsanityData to 14 Oct 2026

Greedy SLIM: A SLIM-Based Approach For Preference Elicitation

arXiv 2406.06061 ↗First posted 10 Jun 2024cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Preference elicitation is an active learning approach to tackle the cold-start problem of recommender systems. Roughly speaking, new users are asked to rate some carefully selected items in order to compute appropriate recommendations for them. To the best of our knowledge, we are the first to propose a method for preference elicitation that is based on SLIM , a state-of-the-art technique for top-N recommendation. Our approach mainly consists of a new training technique for SLIM, which we call Greedy SLIM. This technique iteratively selects items for the training in order to minimize the SLIM loss greedily. We conduct offline experiments as well as a user study to assess the performance of this new method. The results are remarkable, especially with respect to the user study. We conclude that Greedy SLIM seems to be more suitable for preference elicitation than widely used methods based on latent factor models.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 31 references that are in the map. First posted on arXiv 10 Jun 2024.

Builds on

3 of 31 references.

References · 3

  1. 2019Embarrassingly Shallow Autoencoders for Sparse Datacited by 94
  2. 2019On the Difficulty of Evaluating Baselines: A Study on Recommender Systemscited by 46
  3. 2016Efficient Rectangular Maximal-Volume Algorithm for Rating Elicitation in Collaborative Filteringcited by 4

Built on by

Not cited yet.