Low-rank matrix factorization with attributes

Abstract

We develop a new collaborative filtering (CF) method that combines both previously known users' preferences, i.e. standard CF, as well as product/user attributes, i.e. classical function approximation, to predict a given user's interest in a particular product. Our method is a generalized low rank matrix completion problem, where we learn a function whose inputs are pairs of vectors -- the standard low rank matrix completion problem being a special case where the inputs to the function are the row and column indices of the matrix. We solve this generalized matrix completion problem using tensor product kernels for which we also formally generalize standard kernel properties. Benchmark experiments on movie ratings show the advantages of our generalized matrix completion method over the standard matrix completion one with no information about movies or people, as well as over standard multi-task or single task learning methods.

12 pages, 2 figures

Cited by in corpus (19)

• The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices
• Clustered Multi-Task Learning: A Convex Formulation
• A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization
• Consistency of trace norm minimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Exact Matrix Completion via Convex Optimization
• Estimation of (near) low-rank matrices with noise and high-dimensional scaling
• Multi-task Sparse Structure Learning
• Weighted algorithms for compressed sensing and matrix completion
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Matrix completion and extrapolation via kernel regression
• Generalization error bounds for kernel matrix completion and extrapolation
• Rank-one Solutions for Homogeneous Linear Matrix Equations over the Positive Semidefinite Cone
• Semiparametric Nonlinear Bipartite Graph Representation Learning with Provable Guarantees
• Efficient Low Rank Matrix Recovery With Flexible Group Sparse Regularization
• The CP-matrix completion problem
• Factorizing LambdaMART for cold start recommendations
• Online Matrix Completion with Side Information
• Tensor Completion through Total Variationwith Initialization from Weighted HOSVD