A k-segments algorithm for finding principal curves

Jakob Verbeek; Nikos Vlassis; Ben Krose

doi:10.1016/S0167-8655(02)00032-6

Journal Articles Pattern Recognition Letters Year : 2002

A k-segments algorithm for finding principal curves

(1) , (1) , (1)

Jakob Verbeek

Function : Author
PersonId : 10676
IdHAL : verbeek
ORCID : 0000-0003-1419-1816
IdRef : 180998463

Instituut voor Informatica

Nikos Vlassis

Function : Author
PersonId : 853678

Instituut voor Informatica

Ben Krose

Function : Author

Instituut voor Informatica

Abstract

We propose an incremental method to find principal curves. Line segments are fitted and connected to form polygonal lines (PLs). New segments are inserted until a performance criterion is met. Experimental results illustrate the performance of the method compared to other existing approaches.

Keywords

Dimension reduction Feature extraction Polygonal line Principal curve Unsupervised learning

Domains

Machine Learning [cs.LG]

Fichier principal

10.1.1.20.291.pdf (183.66 Ko)

VVK02.png (20.13 Ko)

Origin : Files produced by the author(s)

Format : Figure, Image

Jakob Verbeek : Connect in order to contact the contributor

https://inria.hal.science/inria-00321497

Submitted on : Wednesday, February 16, 2011-4:47:38 PM

Last modification on : Monday, September 25, 2017-10:08:04 AM

Long-term archiving on: Tuesday, May 17, 2011-2:30:20 AM

Dates and versions

inria-00321497 , version 1 (16-02-2011)

Identifiers

HAL Id : inria-00321497 , version 1
DOI : 10.1016/S0167-8655(02)00032-6

Cite

Jakob Verbeek, Nikos Vlassis, Ben Krose. A k-segments algorithm for finding principal curves. Pattern Recognition Letters, 2002, 23 (8), pp.1009--1017. ⟨10.1016/S0167-8655(02)00032-6⟩. ⟨inria-00321497⟩

A k-segments algorithm for finding principal curves

Abstract

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Altmetric

Share