Discrete Content-aware Matrix Factorization
Open Access
- 4 August 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 325-334
Abstract
Precisely recommending relevant items from massive candidates to a large number of users is an indispensable yet computationally expensive task in many online platforms (e.g., Amazon.com and Netflix.com). A promising way is to project users and items into a Hamming space and then recommend items via Hamming distance. However, previous studies didn't address the cold-start challenges and couldn't make the best use of preference data like implicit feedback. To fill this gap, we propose a Discrete Content-aware Matrix Factorization (DCMF) model, 1) to derive compact yet informative binary codes at the presence of user/item content information; 2) to support the classification task based on a local upper bound of logit loss; 3) to introduce an interaction regularization for dealing with the sparsity issue. We further develop an efficient discrete optimization algorithm for parameter learning. Based on extensive experiments on three real-world datasets, we show that DCFM outperforms the state-of-the-arts on both regression and classification tasks.Keywords
Funding Information
- National Natural Science Foundation of China (61502077, 61631005)
This publication has 18 references indexed in Scilit:
- DiFacto2016
- Learning to Hash for Indexing Big Data—A SurveyProceedings of the IEEE, 2015
- Inferring Networks of Substitutable and Complementary Products2015
- GeoMF2014
- Preference preserving hashing for efficient recommendation2014
- Improving pairwise learning for item recommendation from implicit feedback2014
- Factorization Machines with libFMACM Transactions on Intelligent Systems and Technology, 2012
- Semi-Supervised Hashing for Large-Scale SearchIEEE Transactions on Pattern Analysis and Machine Intelligence, 2012
- Large-scale matrix factorization with distributed stochastic gradient descent2011
- Some optimal inapproximability resultsJournal of the ACM, 2001