Finding the optimal number of low dimension with locally linear embedding algorithm

Abstract

1) The problem this paper is going to solve is how to determine the optimal number of dimension when using dimensionality reduction methods, and in this paper, we mainly use local linear embedding (LLE) method as example. 2) The solution proposed is on the condition of the parameter k in LLE is set in advance. Firstly, we select the parameter k, and compute the distance matrix of each feature in the source data and in the data after dimensionality reduction. Then, we use the Log-Euclidean metric to compute the divergence of the distance matrix between the features in the original data and in the low-dimensional data. Finally, the optimal low dimension is determined by the minimum Log-Euclidean metric. 3) The performances are verified by a public dataset and a handwritten digit dataset experiments and the results show that the dimension found by the method is better than other dimension number when classifying the dataset.