Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity (Q2198101)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity |
scientific article |
Statements
Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity (English)
0 references
9 September 2020
0 references
subspace clustering
0 references
graph connectivity
0 references
greedy OMP
0 references
noisy analysis
0 references
exact clustering guarantee
0 references
0 references
0 references
0 references
