Nonparametric discriminant multi-manifold learning

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, a nonparametric discirminant multi-manifold learning (NDML) method is presented for dimensionality reduction. Based on the assumption that the data with same label locate on the same manifold and those belonging to varied classes are resided on the corresponding manifolds, the traditional classification problem can be deduced to multi-manifold identification in low dimensional space. So this paper presents a discriminant learning algorithm to distinguish different manifolds, where a novel nonparametric manifold-to-manifold distance is defined. Moreover, an optimization function is modeled to explore a subspace with maximum manifold-to-manifold distances and minimum locality preserving. Experiments on AR face data and YaleB face data validate that NDML is of better performance than some other dimensionality reduction methods, such as Unsupervised Discriminant Projection (UDP), Constrained Maximum Variance Mapping (CMVM) and Linear Discriminant Analysis (LDA). © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Li, B., Li, J., & Zhang, X. P. (2014). Nonparametric discriminant multi-manifold learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8588 LNCS, pp. 113–119). Springer Verlag. https://doi.org/10.1007/978-3-319-09333-8_13

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