The equivalence between principal component analysis and nearest flat in the least square sense (Q493252)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The equivalence between principal component analysis and nearest flat in the least square sense |
scientific article; zbMATH DE number 6478103
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equivalence between principal component analysis and nearest flat in the least square sense |
scientific article; zbMATH DE number 6478103 |
Statements
The equivalence between principal component analysis and nearest flat in the least square sense (English)
0 references
3 September 2015
0 references
linear manifold
0 references
unsupervised learning
0 references
nearest \(q\)-flat
0 references
principal component analysis
0 references
eigenvalue decomposition
0 references
machine learning
0 references
0.84084773
0 references
0.83341116
0 references
0.8332199
0 references
0.83165956
0 references
0.8246766
0 references
