Trust your neighbors: A comprehensive survey of neighborhood-based methods for recommender systems
Not on the map. Why?
Abstract (arXiv)
Collaborative recommendation approaches based on nearest-neighbors are still highly popular today due to their simplicity, their efficiency, and their ability to produce accurate and personalized recommendations. This chapter offers a comprehensive survey of neighborhood-based methods for the item recommendation problem. It presents the main characteristics and benefits of such methods, describes key design choices for implementing a neighborhood-based recommender system, and gives practical information on how to make these choices. A broad range of methods is covered in the chapter, including traditional algorithms like k-nearest neighbors as well as advanced approaches based on matrix factorization, sparse coding and random walks.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 5 of its 90 references that are in the map. First posted on arXiv 9 Sep 2021.
Builds on
5 of 90 references.
References · 5
- 2019Embarrassingly Shallow Autoencoders for Sparse Datacited by 93
- 2013Empirical Analysis of Predictive Algorithms for Collaborative Filteringcited by 47
- 2015EigenRec: Generalizing PureSVD for Effective and Efficient Top-N Recommendationscited by 5
- 2019Boosting Item-based Collaborative Filtering via Nearly Uncoupled Random Walkscited by 2
- 2015Top-N recommendations in the presence of sparsity: An NCD-based approachcited by 1
Built on by
Citing papers per year: 2023: 3; 2024: 0; 2025: 2; 2026: 3.
8 papers.
- 2023Consumer-side Fairness in Recommender Systems: A Systematic Survey of Methods and Evaluationcited by 2
- 2023Bridging Offline-Online Evaluation with a Time-dependent and Popularity Bias-free Offline Metric for Recommenderscited by 1
- 2025Adaptively-weighted Nearest Neighbors for Matrix Completioncited by 1
- 2025Aligning Language Models with Investor and Market Behavior for Financial Recommendationscited by 1
- 2023Recommender Systems: A Primercited by 0
- 2026Generalizing Linear Autoencoder Recommenders with Decoupled Expected Quadratic Losscited by 0
- 2026Value-Aware Product Recommendation by Customer Segmentation using a suitable High-Dimensional Similarity Measurecited by 0
- 2026GRAPHLCP: Structure-Aware Localized Conformal Prediction on Graphscited by 0
- 2026GRAPHLCP: Structure-Aware Localized Conformal Prediction on Graphs8 May 2026
- 2026Value-Aware Product Recommendation by Customer Segmentation using a suitable High-Dimensional Similarity Measure28 Apr 2026
- 2026Generalizing Linear Autoencoder Recommenders with Decoupled Expected Quadratic Loss8 Mar 2026
- 2025Aligning Language Models with Investor and Market Behavior for Financial Recommendations14 Oct 2025
- 2025Adaptively-weighted Nearest Neighbors for Matrix Completion14 May 2025
- 2023Bridging Offline-Online Evaluation with a Time-dependent and Popularity Bias-free Offline Metric for Recommenders14 Aug 2023
- 2023Consumer-side Fairness in Recommender Systems: A Systematic Survey of Methods and Evaluation16 May 2023
- 2023Recommender Systems: A Primer6 Feb 2023