Cluster Developing 1-Bit Matrix Completion

Matrix completion has a long-time history of usage as the core technique of recommender systems. In particular, 1-bit matrix completion, which considers the prediction as a "Recommended" or "Not Recommended" question, has proved its significance and validity in the field. However, while customers and products aggregate into interacted clusters, state-of-the-art model-based 1-bit recommender systems do not take the consideration of grouping bias. To tackle the gap, this paper introduced Group-Specific 1-bit Matrix Completion (GS1MC) by first-time consolidating group-specific effects into 1-bit recommender systems under the low-rank latent variable framework. Additionally, to empower GS1MC even when grouping information is unobtainable, Cluster Developing Matrix Completion (CDMC) was proposed by integrating the sparse subspace clustering technique into GS1MC. Namely, CDMC allows clustering users/items and to leverage their group effects into matrix completion at the same time. Experiments on synthetic and real-world data show that GS1MC outperforms the current 1-bit matrix completion methods. Meanwhile, it is compelling that CDMC can successfully capture items' genre features only based on sparse binary user-item interactive data. Notably, GS1MC provides a new insight to incorporate and evaluate the efficacy of clustering methods while CDMC can be served as a new tool to explore unrevealed social behavior or market phenomenon.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/08/2020

MC2G: An Efficient Algorithm for Matrix Completion with Social and Item Similarity Graphs

We consider a discrete-valued matrix completion problem for recommender ...
research
09/10/2017

SweetRS: Dataset for a recommender systems of sweets

Benchmarking recommender system and matrix completion algorithms could b...
research
05/27/2019

Collaborative Self-Attention for Recommender Systems

Recommender systems (RS), which have been an essential part in a wide ra...
research
02/08/2023

Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution

Inductive one-bit matrix completion is motivated by modern applications ...
research
08/02/2018

Mixture Matrix Completion

Completing a data matrix X has become an ubiquitous problem in modern da...
research
08/27/2021

GLocal-K: Global and Local Kernels for Recommender Systems

Recommender systems typically operate on high-dimensional sparse user-it...
research
04/24/2015

Social Trust Prediction via Max-norm Constrained 1-bit Matrix Completion

Social trust prediction addresses the significant problem of exploring i...

Please sign up or login with your details

Forgot password? Click here to reset