Binary Matrix Completion on Graphs: Application to Collaborative Filtering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Digital Signal Processing Year : 2022

Binary Matrix Completion on Graphs: Application to Collaborative Filtering

Abstract

This work addresses the problem of completing a partially observed matrix where the entries are either ones or zeroes. This is typically called one-bit matrix completion or binary matrix completion. In this problem, the association among the rows and among the columns can be modeled through graph Laplacians. Since the Laplacians cannot be computed from the incomplete matrix, they must be simultaneously estimated while completing the matrix. We model the problem as graph regularized binary matrix completion where the graphs need to be learnt from the data. We proposed an algorithm based on an alternating minimization scheme, taking advantage of an efficient proximity-based inner solver. The algorithm is applied to the problem of collaborative filtering. Experiments on benchmark datasets with state-of-the-art techniques in collaborative filtering show that the proposed method improves over the rest by a considerable margin.
Fichier principal
Vignette du fichier
BMCG final.pdf (360.79 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03500279 , version 1 (22-12-2021)

Identifiers

Cite

Divyanshu Talwar, Aanchal Mongia, Emilie Chouzenoux, Angshul Majumdar. Binary Matrix Completion on Graphs: Application to Collaborative Filtering. Digital Signal Processing, 2022, 122, pp.103350. ⟨10.1016/j.dsp.2021.103350⟩. ⟨hal-03500279⟩
53 View
190 Download

Altmetric

Share

Gmail Facebook X LinkedIn More