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

DOI10.1007/S10994-014-5454-ZzbMATH Open1408.68128arXiv1403.1600OpenAlexW2115076853MaRDI QIDQ2512903FDOQ2512903

Authors: Yanyan Li 

Publication date: 2 February 2015

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

Abstract: In this paper, we consider a popular model for collaborative filtering in recommender systems where some users of a website rate some items, such as movies, and the goal is to recover the ratings of some or all of the unrated items of each user. In particular, we consider both the clustering model, where only users (or items) are clustered, and the co-clustering model, where both users and items are clustered, and further, we assume that some users rate many items (information-rich users) and some users rate only a few items (information-sparse users). When users (or items) are clustered, our algorithm can recover the rating matrix with $omega(MKlogM)$ noisy entries while $MK$ entries are necessary, where $K$ is the number of clusters and $M$ is the number of items. In the case of co-clustering, we prove that $K^2$ entries are necessary for recovering the rating matrix, and our algorithm achieves this lower bound within a logarithmic factor when $K$ is sufficiently large. We compare our algorithms with a well-known algorithms called alternating minimization (AM), and a similarity score-based algorithm known as the popularity-among-friends (PAF) algorithm by applying all three to the MovieLens and Netflix data sets. Our co-clustering algorithm and AM have similar overall error rates when recovering the rating matrix, both of which are lower than the error rate under PAF. But more importantly, the error rate of our co-clustering algorithm is significantly lower than AM and PAF in the scenarios of interest in recommender systems: when recommending a few items to each user or when recommending items to users who only rated a few items (these users are the majority of the total user population). The performance difference increases even more when noise is added to the datasets.

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

Recommendations

• Collaborative filtering based on information-theoretic co-clustering
• Clustering for collaborative filtering applications
• Collaborative clustering: sample complexity and efficient algorithms
• Improved collaborative filtering
• A novel fuzzy-based similarity measure for collaborative filtering to alleviate the sparsity problem

zbMATH Keywords

matrix completioncollaborative filteringrecommender systemclustering model

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

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

Cited In (13)

• Title not available (Why is that?)
• A new approach to collaborative filtering: operator estimation with spectral regularization
• Component-wise robust linear fuzzy clustering for collaborative filtering
• Augmenting matrix factorization technique with the combination of tags and genres
• Collaborative filtering based on information-theoretic co-clustering
• Collaborative topic model for Poisson distributed ratings
• Making sense of sparse rating data in collaborative filtering via topographic organization of user preference patterns
• Coarse cluster enhancing collaborative recommendation for social network systems
• Improving top-\(N\) recommendation performance using missing data
• RP-LGMC: rating prediction based on local and global information with matrix clustering
• Transfer learning in heterogeneous collaborative filtering domains
• Clustering for collaborative filtering applications
• Collaborative clustering: sample complexity and efficient algorithms

Uses Software

• LMaFit

This page was built for publication: Collaborative filtering with information-rich and~information-sparse entities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2512903)