Collaborative Filtering Recommendation Based on All-Weighted Matrix Factorization and Fast Optimization

Hongmei Li

doi:10.1109/ACCESS.2018.2828401

2018-01-01

DOI：10.1109/ACCESS.2018.2828401

原文链接

查看原文

摘要

En 中文

Collaborative filtering recommendation with implicit feedbacks (e.g., clicks, views, and plays) is regarded as one of the most challenging issues in both academia and industry. From implicit feedbacks, we can only get a small fraction of observed data (positive examples), and the massive unobserved data are the mixture of negative examples and unlabeled positive examples. However, most of the existing efforts either treat unobserved data equally by assigning a uniform weight or uniformly weight observed data while ignoring the hidden information (i.e., visit frequency) in implicit feedbacks. This assumption may not hold in real-life scenarios since they cannot distinguish the contributions of the whole data and it easily leads to prediction bias. Besides, those approaches still suffer from low-efficiency issue. To this end, we propose an all-weighted matrix factorization and fast optimization strategy for effective and efficient recommendation. We first design a frequency-aware weighting scheme for observed data and a user oriented weighting scheme for unobserved data nonuniformly. Then, the weighting schemes of both observed and unobserved data are combined in a unified way to form an all-weighted matrix factorization model. Afterwards, we present a surrogate objective function and develop a fast optimization strategy to enhance the efficiency. Extensive experimental results on real-world datasets demonstrate that our method outperforms the competitive baselines on several evaluation metrics.

Keyword:

Personalized recommendation

implicit feedback

collaborative filtering

all-weighted matrix factorization

fast optimization

visit frequency