Locality preserving projections with adaptive neighborhood size

N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Feature extraction methods are widely employed to reduce dimensionality of data and enhance the discriminative information. Among the methods, manifold learning approaches have been developed to detect the underlying manifold structure of the data based on local invariants, which are usually guaranteed by an adjacent graph of the sampled data set. The performance of the manifold learning approaches is however affected by the locality of the data, i.e. what is the neighborhood size for suitably representing the locality? In this paper, we address this issue through proposing a method to adaptively select the neighborhood size. It is applied to the manifold learning approach Locality Preserving Projections (LPP) which is a popular linear reduction algorithm. The effectiveness of the adaptive neighborhood selection method is evaluated by performing classification and clustering experiments on the real-life data sets.

Cite

CITATION STYLE

APA

Hu, W., Cheng, X., Jiang, Y., Choi, K. S., & Lou, J. (2017). Locality preserving projections with adaptive neighborhood size. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10361 LNCS, pp. 223–234). Springer Verlag. https://doi.org/10.1007/978-3-319-63309-1_21

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