Abstract
Principal components are a well established tool in dimension reduction. The extension to principal curves allows for general smooth curves which pass through the middle of a multidimensional data cloud. In this paper local principal curves are introduced, which are based on the localization of principal component analysis. The proposed algorithm is able to identify closed curves as well as multiple curves which may or may not be connected. For the evaluation of the performance of principal curves as tool for data reduction a measure of coverage is suggested. By use of simulated and real data sets the approach is compared to various alternative concepts of principal curves.
Similar content being viewed by others
References
Aluja-Banet T. and Nonell-Torrent R. 1991. Local principal component analysis. Qüestioó 3: 267–278.
Banfield J.D. and Raftery A.E. 1992. Ice flow identification in satellite images using mathematical morphology and clustering about principal curves. J. Amer. Statist. Assoc. 87: 7–16.
Brand M. 2003. Charting a manifold. Proceedings Neural Information Processing Systems vol. 15.
Buta R. 1987. The structure and dynamics of ringed galaxies, III: Surface photometry and kinematics of the ringed nonbarred spiral NGC 7531. The Astrophysical Journal Supplement Series 64: 1–137.
Chang K. and Ghosh J. 1998. Principal curves for nonlinear feature extraction and classification. SPIE Applications of Artificial Neural Networks in Image Processing III 3307: 120–129.
Comaniciu D. and Meer P. 2002. Mean shift: A robust approach toward feature space analysis. IEEE Trans. Pattern Anal. Machine Intell. 24: 603–619.
Delicado P. 2001. Another look at principal curves and surfaces. Journal of Multivariate Analysis 77: 84–116.
Delicado P. and Huerta M. 2003. Principal curves of oriented points: Theoretical and computational improvements. Computational Statistics 18: 293–315.
Duchamp T. and Stuetzle W. 1996. Extremal properties of principal curves in the plane. Ann. Statist. 24: 1511–1520.
Hastie T. and Stuetzle W. 1989. Principal curves. J. Amer. Statist. Assoc. 84: 502–516.
Jolliffe I.T. 2002. Principal Component Analysis, Second edition, Springer, New York.
Kambhatla N. and Leen T.K. 1997. Dimension reduction by local PCA. Neural Computation 9: 1493–1516.
Kégl B. and Krzyzak A. 2002. Piecewise linear skeletonization using principal curves. IEEE Transactions on Pattern Analysis and Machine Intelligence 24: 59–74.
Kégl B., Krzyzak A., Linder T., and Zeger K. 2000. Learning and design of principal curves. IEEE Transactions on Pattern Analysis and Machine Intelligence 22: 281–297.
Pearson K. 1901. On lines and planes of closest fit to systems of points in space. Philosophical Magazine 2: 559–572.
Schölkopf B. and Smola A. 1998. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation 10: 1299–1319.
Skarbek W. 1996. Local principal components analysis for transform coding. In Int. Symposium on Nonlinear Theory and its Applications—NOLTA'96, Proceedings, Katsurahara-so, Japan, pp. 413–416.
Tharpey T. and Flury B. 1996. Self-consistency: A fundamental concept in statistics. Statistical Science 11: 229–243.
Tibshirani R. 1992. Principal curves revisited. Statistics and Computing 2: 183–190.
Verbeek, Vlassis, N. and Kröse B. 2001. A soft k-segments algorithm for principal curves. In Proceedings International Conference on Artificial Neural Networks, Vienna, Austria, pp. 450–456.
Wand M.P. and Jones M.C. 1993. Comparison of smoothing parametrizations in bivariate kernel density estimation. J. Amer. Statist. Assoc. 88: 520–528.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Einbeck, J., Tutz, G. & Evers, L. Local principal curves. Stat Comput 15, 301–313 (2005). https://doi.org/10.1007/s11222-005-4073-8
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11222-005-4073-8