Use this url to cite publication: https://hdl.handle.net/20.500.12259/95081
Selection of the number of neighbours of each data point for the locally linear embedding algorithm
Type of publication
Straipsnis kitoje duomenų bazėje / Article in other database (S4)
Author(s)
Author | Affiliation | |||
---|---|---|---|---|
Vilniaus pedagoginis universitetas | LT | LT | ||
LT | Matematikos ir informatikos institutas | LT | ||
Title [en]
Selection of the number of neighbours of each data point for the locally linear embedding algorithm
Is part of
Information technology and control = Informacinės technologijos ir valdymas. Kaunas : Technologija, 2007, Vol. 36, no. 4
Date Issued
Date |
---|
2007 |
Publisher
Kaunas : Technologija
Is Referenced by
Extent
p. 359-364
Abstract (en)
This paper deals with a method, called locally linear embedding. It is a nonlinear dimensionality reduction technique that computes low-dimensional, neighbourhood preserving embeddings of high dimensional data and attempts to discover nonlinear structure in high dimensional data. The implementation of the algorithm is fairly straightforward, as the algorithm has only two control parameters: the number of neighbours of each data point and the regularisation parameter. The mapping quality is quite sensitive to these parameters. In this paper, we propose a new way for selecting the number of the nearest neighbours of each data point. Our approach is experimentally verified on two data sets: artificial data and real world pictures.
Type of document
type::text::journal::journal article::research article
Language
Anglų / English (en)
Coverage Spatial
Lietuva / Lithuania (LT)
ISSN (of the container)
1392-124X
WOS
WOS:000255331000004
Other Identifier(s)
VDU02-000055796