TL;DR
This paper benchmarks session-aware recommendation algorithms and finds that simple nearest neighbor methods often outperform complex neural models, highlighting the need for better evaluation practices and more sophisticated methods.
Contribution
It provides a comprehensive benchmarking of session-aware algorithms against session-based and trivial methods, revealing surprising performance insights.
Findings
Nearest neighbor methods outperform neural techniques
Session-aware models are not significantly better than session-based approaches
Many existing comparisons use weak baselines, indicating methodological issues
Abstract
Recommender systems are designed to help users in situations of information overload. In recent years, we observed increased interest in session-based recommendation scenarios, where the problem is to make item suggestions to users based only on interactions observed in an ongoing session. However, in cases where interactions from previous user sessions are available, the recommendations can be personalized according to the users' long-term preferences, a process called session-aware recommendation. Today, research in this area is scattered and many existing works only compare session-aware with session-based models. This makes it challenging to understand what represents the state-of-the-art. To close this research gap, we benchmarked recent session-aware algorithms against each other and against a number of session-based recommendation algorithms and trivial extensions thereof. Our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
