A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Journal of Computers
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 thedoi:10.4304/jcp.9.5.1125-1130 fatcat:ysv2ch3b4bgynj65h4b4ropeja