A soft k-segments algorithm for principal curves

Reference : A soft k-segments algorithm for principal curves


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/11079

Title :	A soft k-segments algorithm for principal curves
Language :	English
Author, co-author :	Verbeek, J. J. [> >]
	Vlassis, Nikos [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) > >]
	Krose, B. [> >]
Publication date :	2001
Main document title :	ARTIFICIAL NEURAL NETWORKS-ICANN 2001, PROCEEDINGS
Pages :	450-456
Peer reviewed :	Yes
Event name :	ARTIFICIAL NEURAL NETWORKS-ICANN 2001
Event date :	2001
Abstract :	[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.
Permalink :	http://hdl.handle.net/10993/11079

There is no file associated with this reference.

All documents in ORBi^lu are protected by a user license.