Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2008
Springer

favoriteEmaildiscussreport

77views Education» more CORR 2008»

Principal Graphs and Manifolds

13 years 4 months ago

Principal Graphs and Manifolds

Download pca.narod.ru

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

Alexander N. Gorban, Andrei Yu. Zinovyev

Real-time Traffic

CORR 2008 | Education | K-means Algorithm Solves | Lower Dimension | Principal Component Analysis |

claim paper

Related Content

» Sampling on locally defined principal manifolds

» Principal manifolds and graphs in practice from molecular biology to dynamical systems

» Branching Principal Components Elastic Graphs Topological Grammars and Metro Maps

» Manifold Valued Statistics Exact Principal Geodesic Analysis and the Effect of Linear Appr...

» Transitional Activity Recognition with Manifold Embedding

» Detection of Salient Image Points Using Principal Subspace Manifold Structure

» Curvature analysis of pattern transformation manifolds

» Topological grammars for data approximation

» Isometric Projection

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Alexander N. Gorban, Andrei Yu. Zinovyev

Comments (0)