Regularizing Matrix Factorization with User and Item Embeddings for Recommendation
Authors:
Open Access
- 17 October 2018
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 687-696
Abstract
Following recent successes in exploiting both latent factor and word embedding models in recommendation, we propose a novel Regularized Multi-Embedding (RME) based recommendation model that simultaneously encapsulates the following ideas via decomposition: (1) which items a user likes, (2) which two users co-like the same items, (3) which two items users often co-liked, and (4) which two items users often co-disliked. In experimental validation, the RME outperforms competing state-of-the-art models in both explicit and implicit feedback datasets, significantly improving [email protected] by 5.9~7.0%, [email protected] by 4.3~5.6%, and [email protected] by 7.9~8.9%. In addition, under the cold-start scenario for users with the lowest number of interactions, against the competing models, the RME outperforms [email protected] by 20.2% and 29.4% in MovieLens-10M and MovieLens-20M datasets, respectively. Our datasets and source code are available at: https://github.com/thanhdtran/RME.git.Keywords
All Related Versions
Funding Information
- Microsoft Azure Research Award
- Google Faculty Research Award
- National Science Foundation (CNS1755536,CNS1422215,CNS1742702)
This publication has 32 references indexed in Scilit:
- Latent Trajectory Modeling2015
- Dynamic Matrix Factorization with Priors on Unknown Values2015
- Effective Latent Models for Binary Feedback in Recommender Systems2015
- Parallel matrix factorization for recommender systemsKnowledge and Information Systems, 2013
- Optimizing top-n collaborative filtering via dynamic negative item sampling2013
- Collaborative topic modeling for recommending scientific articles2011
- A Survey of Collaborative Filtering TechniquesAdvances in Artificial Intelligence, 2009
- Factorization meets the neighborhood2008
- Large-Scale Parallel Collaborative Filtering for the Netflix Prize2008
- Item-based top-Nrecommendation algorithmsACM Transactions on Information Systems, 2004