Local Item-Item Models For Top-N Recommendation
Authors:
Open Access
- 7 September 2016
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 67-74
Abstract
Item-based approaches based on SLIM (Sparse LInear Methods) have demonstrated very good performance for top-N recommendation; however they only estimate a single model for all the users. This work is based on the intuition that not all users behave in the same way -- instead there exist subsets of like-minded users. By using different item-item models for these user subsets, we can capture differences in their preferences and this can lead to improved performance for top-N recommendations. In this work, we extend SLIM by combining global and local SLIM models. We present a method that computes the prediction scores as a user-specific combination of the predictions derived by a global and local item-item models. We present an approach in which the global model, the local models, their user-specific combination, and the assignment of users to the local models are jointly optimized to improve the top-N recommendation performance. Our experiments show that the proposed method improves upon the standard SLIM model and outperforms competing top-N recommendation approaches.Keywords
Funding Information
- National Science Foundation (OCI-1048018, IIS-1247632, IIP-1414153, IIS-1447788)
- Intel Software and Services Group
- Army Research Office (W911NF-14-1-0316)
- Digital Technology Center at the University of Minnesota
This publication has 9 references indexed in Scilit:
- Local collaborative ranking2014
- FISM2013
- An exploration of improving collaborative recommender systems via user-item subgroups2012
- SLIM: Sparse Linear Methods for Top-N Recommender Systems2011
- Performance of recommender algorithms on top-n recommendation tasks2010
- Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensionsIEEE Transactions on Knowledge and Data Engineering, 2005
- Item-based top-Nrecommendation algorithmsACM Transactions on Information Systems, 2004
- Eigentaste: A Constant Time Collaborative Filtering AlgorithmInformation Retrieval Journal, 2001
- An algorithmic framework for performing collaborative filtering1999