Principal Graphs and Manifolds

In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpose, Karl Pearson invented principal component analysis in 1901 and found `lines and planes of closest fit to system of points'. The famous k-means algorithm solves the approximation problem too, but by finite sets instead of lines

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Alexander N. Gorban, Andrei Yu. Zinovyev
• Keywords: CORR 2008, Education, K-means Algorithm Solves, Lower Dimension, Principal Component Analysis