Volume 9 Number 5 (May 2014)
Home > Archive > 2014 > Volume 9 Number 5 (May 2014) >
JCP 2014 Vol.9(5): 1125-1130 ISSN: 1796-203X
doi: 10.4304/jcp.9.5.1125-1130

A Greedy Algorithm for Constraint Principal Curves

Shiying Yang1, Dewang Chen1, Xiangyu Zeng1, Peter Pudney2
1State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044,China
2Center for Industrial and Applied Mathematics, University of South Australia, Mawson Lakes, Australia


Abstract—Principal curves can learn high-accuracy data from multiple low-accuracy data. However, the current proposed algorithms based on global optimization are too complex and have high computational complexity. To address these problems and in the inspiration of the idea of divide and conquer, this paper proposes a Greedy algorithm based on dichotomy and simple averaging, named as KPCg algorithm. After that, three simulation data sets of sinusoidal, zigzag and spiral trajectories are used to test the performance of the KPCg algorithm and we compare it with the k-segment algorithm proposed by Verbeek. The results show that the KPCg algorithm can efficiently learn highaccuracy data from multiple low-accuracy data with constraint endpoints and have advantages in accuracy, computational speed and scope of application.

Index Terms—Principal curves algorithm; principal of nearest neighbor; adaptive radius; dichotomy; simple averaging

[PDF]

Cite: Shiying Yang, Dewang Chen, Xiangyu Zeng, Peter Pudney, "A Greedy Algorithm for Constraint Principal Curves," Journal of Computers vol. 9, no. 5, pp. 1125-1130, 2014.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Monthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jcp@iap.org
  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Jul 19, 2019 News!

    Vol 14, No 7 has been published with online version   [Click]

  • Jun 21, 2019 News!

    Vol 14, No 6 has been published with online version   [Click]

  • Apr 28, 2019 News!

    Vol 14, No 5 has been published with online version 7 papers are published in this issue after peer review   [Click]

  • Mar 20, 2019 News!

    Vol 14, No 3 has been published with online version   [Click]

  • Read more>>