A k-segments algorithm for finding principal curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Technical Report) Year : 2000

A k-segments algorithm for finding principal curves

Jakob Verbeek
Instituut voor Informatica
Nikos Vlassis
  • Function : Author
  • PersonId : 853678
Instituut voor Informatica
Ben Krose
  • Function : Author
  • PersonId : 853721
Instituut voor Informatica

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.

Domains

Machine Learning [cs.LG]
Fichier principal
Vignette du fichier
verbeek00tr.pdf (282.55 Ko) Télécharger le fichier
Vignette du fichier
VVK00.png (29.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Jakob Verbeek  : Connect in order to contact the contributor

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

Submitted on : Wednesday, February 16, 2011-5:02:29 PM

Last modification on : Wednesday, October 26, 2022-8:13:59 AM

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

Download

Dates and versions

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

Identifiers

  • HAL Id : inria-00321517 , version 1

Cite

Jakob Verbeek, Nikos Vlassis, Ben Krose. A k-segments algorithm for finding principal curves. [Technical Report] IAS-UVA-00-11, 2000, pp.12. ⟨inria-00321517⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

LARA
187 View
319 Download

Share

Gmail Facebook X LinkedIn More