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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on information theory Ročník 70; číslo 3; s. 2039 - 2075
Hlavní autori:	Ahn, Junhyung, Elmahdy, Adel, Mohajer, Soheil, Suh, Changho
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.03.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!