We propose a new method to find principal curves for data sets. The method repeats three steps until a stopping criterion is met. In the first step, k (unconnected) line segments are fitted on the data. The second step connects the segments to form a polygonal line, and evaluates the quality of the resulting polygonal line. The third step inserts a new line segment. We compare the performance of our new method with other existing methods to find principal curves.
CITATION STYLE
Verbeek, J. J., Vlassis, N., & Kröse, B. (2001). A soft k-segments algorithm for principal curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2130, pp. 450–456). Springer Verlag. https://doi.org/10.1007/3-540-44668-0_63
Mendeley helps you to discover research relevant for your work.