Algorithm Selection for Recommender Systems via Meta-Learning on Algorithm Characteristics
The Algorithm Selection Problem for recommender systems-choosing the best algorithm for a given user or context-remains a significant challenge. Traditional meta-learning approaches often treat algorithms as categorical choices, ignoring their intrinsic properties. Recent work has shown that explicitly characterizing algorithms with features can improve model performance in other domains. Building on this, we propose a per-user meta-learning approach for recommender system selection that leverages both user meta-features and automatically extracted algorithm features from source code. Our preliminary results, averaged over six diverse datasets, show that augmenting a meta-learner with algorithm features improves its average NDCG@10 performance by 8.83% from 0.135 (user features only) to 0.147. This enhanced model outperforms the Single Best Algorithm baseline (0.131) and successfully closes 10.5% of the performance gap to a theoretical oracle selector. These findings show that even static source code metrics provide a valuable predictive signal, presenting a promising direction for building more robust and intelligent recommender systems.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Recommender Systems Algorithm Selection for Ranking Prediction on Implicit Feedback Datasets
The recommender systems algorithm selection problem for ranking prediction on implicit feedback datasets is under-explored. Traditional approaches in recommender systems algorithm selection focus predominantly on rating …
Recommendation SystemsIntelligent Algorithm Selection for Recommender Systems: Meta-Learning via in-depth algorithm feature engineering
The "No Free Lunch" theorem dictates that no single recommender algorithm is optimal for all users, creating a significant Algorithm Selection Problem. Standard meta-learning approaches aim to solve this by selecting an …
Feature EngineeringPer-Instance Algorithm Selection for Recommender Systems via Instance Clustering
Recommendation algorithms perform differently if the users, recommendation contexts, applications, and user interfaces vary even slightly. It is similarly observed in other fields, such as combinatorial problem solving, …
ClusteringMeta-LearningRecommendation SystemsMeta-Learned Per-Instance Algorithm Selection in Scholarly Recommender Systems
The effectiveness of recommender system algorithms varies in different real-world scenarios. It is difficult to choose a best algorithm for a scenario due to the quantity of algorithms available, and because of their var…
Meta-LearningRecommendation Systemsu-cf2vec: Representation Learning for Personalized Algorithm Selection in Recommender Systems
Collaborative Filtering (CF) has become the standard approach to solve recommendation systems (RS) problems. Collaborative Filtering algorithms try to make predictions about interests of a user by collecting the personal…
Collaborative FilteringMeta-LearningRecommendation SystemsRepresentation Learning