Rethinking Recommender Systems: Cluster-based Algorithm Selection

2024/05/28 by Andreas Lizenberger, Lizenberger, Andreas, Ferdinand Pfeifer +3
Computer Science · Decision Sciences · #Advanced Bandit Algorithms Research #Data Management and Algorithms #FOS: Computer and information sciences #Information Retrieval (cs.IR) #Recommender Systems and Techniques

paper · pdf · doi:10.48550/arxiv.2405.18011

openalex publication_date 2024/05/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Cluster-based algorithm selection deals with selecting recommendation algorithms on clusters of users to obtain performance gains. No studies have been attempted for many combinations of clustering approaches and recommendation algorithms. We want to show that clustering users prior to algorithm selection increases the performance of recommendation algorithms. Our study covers eight datasets, four clustering approaches, and eight recommendation algorithms. We select the best performing recommendation algorithm for each cluster. Our work shows that cluster-based algorithm selection is an effective technique for optimizing recommendation algorithm performance. For five out of eight datasets, we report an increase in nDCG@10 between 19.28% (0.032) and 360.38% (0.191) compared to algorithm selection without prior clustering.

Related

• Review of Clustering-Based Recommender Systems
• Per-Instance Algorithm Selection for Recommender Systems via Instance Clustering
• Algorithm Selection for Recommender Systems via Meta-Learning on Algorithm Characteristics
• On the Generalizability and Predictability of Recommender Systems
• Intelligent Algorithm Selection for Recommender Systems: Meta-Learning via in-depth algorithm feature engineering