Automatic choice of the number of nearest neighbors in locally linear embedding

14Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Locally linear embedding (LLE) is a method for nonlinear dimensionality reduction, which calculates a low dimensional embedding with the property that nearby points in the high dimensional space remain nearby and similarly co-located with respect to one another in the low dimensional space [1]. LLE algorithm needs to set up a free parameter, the number of nearest neighbors k. This parameter has a strong influence in the transformation. In this paper is proposed a cost function that quantifies the quality of the embedding results and computes an appropriate k. Quality measure is tested on artificial and real-world data sets, which allow us to visually confirm whether the embedding was correctly calculated. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Valencia-Aguirre, J., Álvarez-Mesa, A., Daza-Santacoloma, G., & Castellanos-Domínguez, G. (2009). Automatic choice of the number of nearest neighbors in locally linear embedding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5856 LNCS, pp. 77–84). https://doi.org/10.1007/978-3-642-10268-4_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free