On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs

We study a matrix completion problem which leverages a hierarchical structure of social similarity graphs as side information in the context of recommender systems. We assume that users are categorized into clusters, each of which comprises sub-clusters (or what we call "groups"). We consi...

Full description

Bibliographic Details

Published in:	IEEE transactions on information theory Vol. 70; no. 3; pp. 2039 - 2075
Main Authors:	Ahn, Junhyung, Elmahdy, Adel, Mohajer, Soheil, Suh, Changho
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.03.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Clustering algorithms Clusters Collaborative filtering Complexity Complexity theory Filtering graph side information Graphs Information theory Lower bounds matrix completion problem Recommender systems Similarity Sparse matrices
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!