Discriminant Graph Based Linear Embedding
LLE is a nonlinear dimensionality reduction method, which has been successfully applied to data visualization. Based on the assumption of local linearity, LLE can compute the weights between the KNN nodes using the local least reconstruction errors, which increase the computational cost. In this paper, a method titled Discriminant Graph Based Linear Embedding (DGBLE) is proposed to set the weights between the nodes in the KNN graph directly to reduce the computational expense. Moreover, label information can also be taken into account to improve the discriminant power of the original LLE. Experiments on some benchmark data show that the proposed method is feasible and effective.
KeywordsLLE graph linear embedding
Unable to display preview. Download preview PDF.
- 3.Belkin, M., Niyogi, P.: Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering. In: Dietterich, T.G., Becker, S., Ghahramani, Z. (eds.) Advances in Neural Information Processing Systems, vol. 14, pp. 585–591. MIT Press, Cambridge (2002)Google Scholar
- 4.Biometrics Research Centre, http://www4.comp.polyu.edu.hk/~biometrics
- 7.Kokiopoulou, E., Saad, Y.: Orthogonal Neighborhood Preserving Projections. In: The Fifth IEEE International Conference on Data Mining, pp. 1–7. IEEE Press, New York (2005)Google Scholar