Construction Algorithm of Principal Curves in the Sense of Limit

  • Lianwei Zhao
  • Yanchang Zhao
  • Siwei Luo
  • Chao Shao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3809)


Principal curves have been defined as self-consistent, smooth, one-dimensional curves which pass through the middle of a multidimensional data set. They are nonlinear generalization of the first Principal Component. In this paper, we take a new approach by defining principal curves as continuous curves based on the local tangent space in the sense of limit. It is proved that this new principal curves not only satisfy the self-consistent property, but also are the unique existence for any given open covering. Based on the new definition, a new practical algorithm for constructing principal curves is given. And the convergence properties of this algorithm are analyzed. The new construction algorithm of principal curves is illustrated on some simulated data sets.


Random Vector Open Covering Principal Curve Reconstruction Error Construction Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hastie, T., Stuetzle, W.: Principal Curves. Journal of the American Statistical Association 84, 502–516 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Tarpey, T., Flury, B.: Self-consistency: A fundamental concept in statistics. Statistical Science 11(3), 229–243 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Tibshirani, R.: Principal Curves Revisited. Statistics and Computation 2, 183–190 (1992)CrossRefGoogle Scholar
  4. 4.
    Kégl, B., Krzyzak, A., Linder, T., Zeger, K.: Learning and design of principal curves. IEEE Trans. on Pattern Analysis and Machine Intelligence 22(3), 281–297 (2000)CrossRefGoogle Scholar
  5. 5.
    Delicado, P.: Another Look at Principal Curves and Surfaces. Journal of Multivariate Analysis 77, 84–116 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Kui-yu, C., Ghosh, J.: A Unified Model for Probabilistic Principal Surfaces. IEEE Trans. on Pattern Analysis and Machine Intelligence 23(1), 22–41 (2001)CrossRefGoogle Scholar
  7. 7.
    Duchamp, T., Stuezle, W.: Geometric Properties of Principal Curves in the Plane. Robust Statistics. Data Analysis, and Computer Intensive Methods, 135–152 (1995)Google Scholar
  8. 8.
    Duchamp, T., Stuetzle, W.: Extremal Properties of Principal Curves in the Plane. Annals of Statistics 24(4), 1511–1520 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Martínez-Morales, J.L.: Extremal Properties of Principal Embeddings. J. Math. Pures Appl. 78, 913–923 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Junping, Z., Jue, W.: An Overview of Principal Curves. Chinese Journal of Computers 26(2), 129–146 (2003)MathSciNetGoogle Scholar
  11. 11.
    Wanli, M., Ke, L., Xiaofei, H.: Locality Pursuit Embedding. Pattern Recognition 37, 781–788 (2004)zbMATHCrossRefGoogle Scholar
  12. 12.
    Koetsier, J., Han, Y., Fyfe, C.: Twinned principal curves. Neural Networks 17, 399–409 (2004)zbMATHCrossRefGoogle Scholar
  13. 13.
    Kambhatla, N., Leen, T.K.: Dimension reduction by local principal component analysis. Neural Computation 9, 1493–1516 (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Lianwei Zhao
    • 1
  • Yanchang Zhao
    • 2
  • Siwei Luo
    • 1
  • Chao Shao
    • 1
  1. 1.School of Computer and Information TechnologyBeijing Jiaotong UniversityBeijingChina
  2. 2.Faculty of Information TechnologyUniversity of TechnologySydneyAustralia

Personalised recommendations