paper-with-me

Papers

Cluster Developing 1-Bit Matrix Completion

2019-04-07 · Chengkun Zhang. Junbin Gao, Stephen Lu

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.

📄 PDF Abstract BibTeX arXiv:1904.03779

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringMatrix CompletionRecommendation Systems

Similar Papers 제목 키워드 기반

Clustering of Nonnegative Data and an Application to Matrix Completion

2020-09-02 · C. Strohmeier, D. Needell

In this paper, we propose a simple algorithm to cluster nonnegative data lying in disjoint subspaces. We analyze its performance in relation to a certain measure of correlation between said subspaces. We use our clusteri…

ClusteringMatrix CompletionRelation

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

2020-06-08 · Qiaosheng Zhang, Geewon Suh, Changho Suh, Vincent Y. F. Tan

In this paper, we design and analyze MC2G (Matrix Completion with 2 Graphs), an algorithm that performs matrix completion in the presence of social and item similarity graphs. MC2G runs in quasilinear time and is paramet…

ClusteringMatrix CompletionRecommendation Systems

High-Rank Matrix Completion and Clustering under Self-Expressive Models

2016-12-01 · NeurIPS 2016 12 · Ehsan Elhamifar

We propose efficient algorithms for simultaneous clustering and completion of incomplete high-dimensional data that lie in a union of low-dimensional subspaces. We cast the problem as finding a completion of the data mat…

ClusteringLow-Rank Matrix CompletionMatrix CompletionMotion Segmentation+1

Information-theoretic Bounds on Matrix Completion under Union of Subspaces Model

2015-08-14 · Vaneet Aggarwal, Shuchin Aeron

In this short note we extend some of the recent results on matrix completion under the assumption that the columns of the matrix can be grouped (clustered) into subspaces (not necessarily disjoint or independent). This m…

ClusteringMatrix Completion

Image Tag Completion and Refinement by Subspace Clustering and Matrix Completion

2015-06-10 · Yuqing Hou, Zhouchen Lin

Tag-based image retrieval (TBIR) has drawn much attention in recent years due to the explosive amount of digital images and crowdsourcing tags. However, the TBIR applications still suffer from the deficient and inaccurat…

ClusteringImage RetrievalMatrix CompletionRetrieval+1