A soft k-segments algorithm for principal curves

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas


https://hal.inria.fr/inria-00321506
Contributor : Jakob Verbeek <>
Submitted on : Wednesday, February 16, 2011 - 5:08:40 PM
Last modification on : Monday, September 25, 2017 - 10:08:04 AM
Long-term archiving on : Tuesday, May 17, 2011 - 2:35:49 AM

Files

verbeek01icann2.pdf
Files produced by the author(s)

Identifiers

Citation

Jakob Verbeek, Nikos Vlassis, Ben Krose. A soft k-segments algorithm for principal curves. International Conference on Artificial Neural Networks, Aug 2001, Vienna, Austria. pp.450-456, ⟨10.1007/3-540-44668-0_63⟩. ⟨inria-00321506⟩

Share

Metrics

Record views

178

Files downloads

702