Matrix Completion
Matrix Completion is a problem in numerical linear algebra that involves reconstructing a low-rank matrix from a subset of its observed entries by exploiting the inherent structural redundancy of the matrix.
1.7K
Publications
127.4K
Citations
3.6K
Authors
1.1K
Institutions
Publications per year
2017–2026
684
Parents
1.7K
1–5 of 1.7K
3.6K
16
h-index
15
h-index
15
h-index
15
h-index
University of Electronic Science and Technology of China, China
14 publications · 956 citations
14
h-index
1–5 of 3.6K
1.1K
Stanford University
Stanford, United States
29 h-index
75 publications
16.4K citations

University of Electronic Science and Technology of China
Chengdu, China
29 h-index
119 publications
9.4K citations
The University of Texas at Austin
Austin, United States
25 h-index
84 publications
10.7K citations

Hunan University
Changsha, China
23 h-index
70 publications
3.2K citations

Chinese Academy of Sciences
Beijing, China
23 h-index
58 publications
3.1K citations

City University of Hong Kong
Hong Kong, Hong Kong
23 h-index
57 publications
2.3K citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
22 h-index
56 publications
2.5K citations

Central South University
Changsha, China
21 h-index
71 publications
6.6K citations
1–8 of 1.1K
Repository · 176 publications · 10.1K citations
46
h-index
113 publications · 4.9K citations
36
h-index
58 publications · 5.3K citations
36
h-index
30 publications · 6.5K citations
22
h-index
20 publications · 1.9K citations
20
h-index
1–5