Speeding Up Memory-based Collaborative Filtering With Landmarks

Abstract

Recommender systems play an important role in many scenarios where users are overwhelmed with too many choices to make. In this context, Collaborative Filtering (CF) arises by providing a simple and widely used approach for personalized recommendation. Memory-based CF algorithms mostly rely on similarities between pairs of users or items, which are posteriorly employed in classifiers like k-Nearest Neighbor (kNN) to generalize for unknown ratings. A major issue regarding this approach is to build the similarity matrix. Depending on the dimensionality of the rating matrix, the similarity computations may become computationally intractable. To overcome this issue, we propose to represent users by their distances to preselected users, namely landmarks. This procedure allows to drastically reduce the computational cost associated with the similarity matrix. We evaluated our proposal on two distinct distinguishing databases, and the results showed our method has consistently and considerabl

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keylima2017speeding

Related papers

• Collaborative Filtering, K-nearest Neighbor And Cosine Similarity In Home Decor Recommender Systems (2024)0.00
• Collaborative Group-aware Hashing For Fast Recommender Systems (2025)0.00
• Collaborative Similarity Embedding For Recommender Systems (2019)13.93
• Neural Collaborative Filtering Vs. Matrix Factorization Revisited (2020)19.18
• Lightfr: Lightweight Federated Recommendation With Privacy-preserving Matrix Factorization (2022)12.87
• Effective Multi-query Expansions: Collaborative Deep Networks For Robust Landmark Retrieval (2017)15.73
• Multi-feature Discrete Collaborative Filtering For Fast Cold-start Recommendation (2020)9.59
• Landmarkboost: Efficient Visual Context Classifiers For Robust Localization (2018)5.24