Collaborative filtering with information-rich and~information-sparse entities

DOI10.1007/s10994-014-5454-zzbMath1408.68128arXiv1403.1600OpenAlexW2115076853MaRDI QIDQ2512903

Yanyan Li

Publication date: 2 February 2015

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.1600

zbMATH Keywords

matrix completioncollaborative filteringrecommender systemclustering model

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• LMaFit

Cites Work

• Unnamed Item
• Exact matrix completion via convex optimization
• Distributed user profiling via spectral methods
• Analysis of a Collaborative Filter Based on Popularity Amongst Neighbors
• A Singular Value Thresholding Algorithm for Matrix Completion
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Simpler Approach to Matrix Completion
• Probability and Computing
• Low-rank matrix completion using alternating minimization