Self-Regulation of Neighborhood Parameter for Locally Linear Embedding
Kang Hua Hui, Chun Li Li, Xin Zhong Xu, Xiao Rong Feng
Abstract
Kang Hua Hui, Chun Li Li, Xin Zhong Xu, Xiao Rong Feng
Abstract
The locally linear embedding (LLE) algorithm is considered as a powerful method for the problem of nonlinear dimensionality reduction. In this paper, a new method called Self-Regulated LLE is proposed. It achieves to solve the problem of deciding appropriate neighborhood parameter for LLE by finding the local patch which is close to be a linear one. The experiment results show that LLE with self-regulation performs better in most cases than LLE based on different evaluation criteria and spends less time on several data sets.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The locally linear embedding (LLE) algorithm is considered as a powerful method for the problem of nonlinear dimensionality reduction. In this paper, a new method called Self-Regulated LLE is proposed. It achieves to solve the problem of deciding appropriate neighborhood parameter for LLE by finding the local patch which is close to be a linear one. The experiment results show that LLE with self-regulation performs better in most cases than LLE based on different evaluation criteria and spends less time on several data sets.
Key concepts: Embedding, Dimensionality reduction, Curse of dimensionality, Mathematics, Nonlinear system, Mathematical optimization, Computer science, Algorithm