inria-00321517, version 1
A k-segments algorithm for finding principal curves
Jakob Verbeek
a, 1Nikos Vlassis b, 1Ben Krose a, 1
N° IAS-UVA-00-11 (2000)
Abstract: We propose an incremental method to find principal curves. Line segments are fitted and connected to form polygonal lines. New segments are inserted until a performance criterion is met. Experimental results illustrate the performance of the method compared to other existing approaches.
- a – Universiteit van Amsterdam
- b – Technical University of Crete
- 1: Instituut voor Informatica (IvI)
- Universiteit van Amsterdam
- Domain : Computer Science/Learning
- Keywords : dimension reduction – feature extraction – polygonal line – principal curve – self-organization – unsupervised learning
- Internal note : IAS-UVA-00-11
- Comment : University of Amsterdam
- inria-00321517, version 1
- http://hal.inria.fr/inria-00321517
- oai:hal.inria.fr:inria-00321517
- From: Jakob Verbeek
- Submitted on: Wednesday, 16 February 2011 17:02:29
- Updated on: Friday, 18 February 2011 14:08:09
Associated documents
Export