0.25
0.5
0.75
1.25
1.5
1.75
2
Minimax Localization of Structural Information in Large Noisy Matrices
Published on Sep 06, 20122695 Views
We consider the problem of identifying a sparse set of relevant columns and rows in a large data matrix with highly corrupted entries. This problem of identifying groups from a collection of bipartite
Related categories
Chapter list
Minimax Localization of Structural Information in Large Noisy Matrices00:00
Identifying biclusters (1)00:24
Identifying biclusters (2)00:42
Computationally efficient procedures01:23