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.
Type de document :
Communication dans un congrès
Georg Dorffner and Horst Bischof and Kurt Hornik. International Conference on Artificial Neural Networks, Aug 2001, Vienna, Austria. Springer, 2130, pp.450-456, 2001, Lecture Notes in Computer Science (LNCS). 〈http://www.springerlink.com/content/jtapdufpfhrh92xh/〉. 〈10.1007/3-540-44668-0_63〉
Liste complète des métadonnées


https://hal.inria.fr/inria-00321506
Contributeur : Jakob Verbeek <>
Soumis le : mercredi 16 février 2011 - 17:08:40
Dernière modification le : lundi 25 septembre 2017 - 10:08:04
Document(s) archivé(s) le : mardi 17 mai 2011 - 02:35:49

Fichiers

verbeek01icann2.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Jakob Verbeek, Nikos Vlassis, Ben Krose. A soft k-segments algorithm for principal curves. Georg Dorffner and Horst Bischof and Kurt Hornik. International Conference on Artificial Neural Networks, Aug 2001, Vienna, Austria. Springer, 2130, pp.450-456, 2001, Lecture Notes in Computer Science (LNCS). 〈http://www.springerlink.com/content/jtapdufpfhrh92xh/〉. 〈10.1007/3-540-44668-0_63〉. 〈inria-00321506〉

Partager

Métriques

Consultations de la notice

136

Téléchargements de fichiers

272