Reference : A soft k-segments algorithm for principal curves
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/11079
A soft k-segments algorithm for principal curves
English
Verbeek, J. J. [> >]
Vlassis, Nikos mailto [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) > >]
Krose, B. [> >]
2001
ARTIFICIAL NEURAL NETWORKS-ICANN 2001, PROCEEDINGS
450-456
Yes
ARTIFICIAL NEURAL NETWORKS-ICANN 2001
2001
[en] 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.
http://hdl.handle.net/10993/11079

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.