Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization (Q2934034): Difference between revisions
From MaRDI portal
Created a new Item |
Changed label, description and/or aliases in en, and other parts |
||
| (3 intermediate revisions by 3 users not shown) | |||
| label / en | label / en | ||
Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1302.4385 / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
stat.ML | |||
| Property / arXiv classification: stat.ML / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
math.OC | |||
| Property / arXiv classification: math.OC / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:51, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization |
scientific article |
Statements
8 December 2014
0 references
matrix factorization
0 references
separability
0 references
linear programming
0 references
convex optimization
0 references
robustness to noise
0 references
pure-pixel assumption
0 references
hyperspectral unmixing
0 references
stat.ML
0 references
math.OC
0 references
