Loading...
Learning Top-N Recommender Systems with Implicit Feedbacks
Zhao, Feipeng
Zhao, Feipeng
Citations
Altmetric:
Genre
Thesis/Dissertation
Date
2017
Advisor
Committee member
Group
Department
Computer and Information Science
Permanent link to this record
Collections
Research Projects
Organizational Units
Journal Issue
DOI
http://dx.doi.org/10.34944/dspace/3919
Abstract
Top-N recommender systems automatically recommend N items for users from huge amounts of products. Personalized Top-N recommender systems have great impact on many real world applications such as E-commerce platforms and social networks. Sometimes there is no rating information in user-item feedback matrix but only implicit purchase or browsing history, that means the user-item feedback matrix is a binary matrix, we call such feedbacks as implicit feedbacks. In our work we try to learn Top-N recommender systems with implicit feedbacks. First, we design a heterogeneous loss function to learn the model. Second, we incorporate item side information into recommender systems. We formulate a low-rank constraint minimization problem and give a closed-form solution for it. Third, we also use item side information to learn recommender systems. We use gradient descent method to learn our model. Most existing methods produce personalized top-N recommendations by minimizing a specific uniform loss such as pairwise ranking loss or pointwise recovery loss. In our first model, we propose a novel personalized Top-N recommendation approach that minimizes a combined heterogeneous loss based on linear self-recovery models. The heterogeneous loss integrates the strengths of both pairwise ranking loss and pointwise recovery loss to provide more informative recommendation predictions. We formulate the learning problem with heterogeneous loss as a constrained convex minimization problem and develop a projected stochastic gradient descent optimization algorithm to solve it. Most previous systems are only based on the user-item feedback matrix. In many applications, in addition to the user-item rating/purchase matrix, item-based side information such as product reviews, book reviews, item comments, and movie plots can be easily collected from the Internet. This abundant item-based information can be used for recommendation systems. In the second model, we propose a novel predictive collaborative filtering approach that exploits both the partially observed user-item recommendation matrix and the item-based side information to produce top-N recommender systems. The proposed approach automatically identifies the most interesting items for each user from his or her non-recommended item pool by aggregating over his or her recommended items via a low-rank coefficient matrix. Moreover, it also simultaneously builds linear regression models from the item-based side information such as item reviews to predict the item recommendation scores for the users. The proposed approach is formulated as a rank constrained joint minimization problem with integrated least squares losses, for which an efficient analytical solution can be derived. In the third model, we also propose a joint discriminative prediction model that exploits both the partially observed user-item recommendation matrix and the item-based side information to build top-N recommender systems. This joint model aggregates observed user-item recommendation activities to predict the missing/new user-item recommendation scores while simultaneously training a linear regression model to predict the user-item recommendation scores from auxiliary item features. We evaluate the proposed approach on a variety of recommendation tasks. The experimental results show that the proposed joint model is very effective for producing top-N recommendation systems.
Description
Citation
Citation to related work
Has part
ADA compliance
For Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.edu