Dimensionality Reduction Algorithm Based on Density Portrayal
Shenglan Liu
Abstract
Shenglan Liu
Abstract
In order to improve the correctness of dimensionality reduction algorithms based on Locally Linear Embedding(LLE) caused by data density change,a novel approach based on density is proposed in this paper.It adapts cam distribute to find the data’s nearest neighbor,meanwhile,adds the data’s density information during the low dimensional local reconstruction.The proposed algorithm is used to reduce the dimensionality of input feature,and the reduced feature is classified by simple classifier.Experimental result indicates that the method can effectively improve the recognition rate of handwritten digits and can dig the manifold embedded in the high dimensional space.
OpenAlex reports 2 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.
In order to improve the correctness of dimensionality reduction algorithms based on Locally Linear Embedding(LLE) caused by data density change,a novel approach based on density is proposed in this paper.It adapts cam distribute to find the data’s nearest neighbor,meanwhile,adds the data’s density information during the low dimensional local reconstruction.The proposed algorithm is used to reduce the dimensionality of input feature,and the reduced feature is classified by simple classifier.Experimental result indicates that the method can effectively improve the recognition rate of handwritten digits and can dig the manifold embedded in the high dimensional space.
Key concepts: Computer science, Dimensionality reduction, Nonlinear dimensionality reduction, Correctness, Curse of dimensionality, Embedding, Classifier (UML), k-nearest neighbors algorithm