Nonlinear Nearest Subspace Classifier

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

Abstract

As an effective nonparametric classifier, nearest subspace (NS) classifier exhibits its good performance on high-dimensionality data. However, NS could not well classify the data with the same direction distribution. To deal with this problem, this paper proposes a nonlinear extension of NS, or nonlinear nearest subspace classifier. Firstly, the data in the original sample space are mapped into a kernel empirical mapping space by using a kernel empirical mapping function. In this kernel empirical mapping space, NS is then performed on these mapped data. Experimental results on the toy and face data show this nonlinear nearest subspace classifier is a promising nonparametric classifier. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Zhang, L., Zhou, W. D., & Liu, B. (2011). Nonlinear Nearest Subspace Classifier. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7063 LNCS, pp. 638–645). https://doi.org/10.1007/978-3-642-24958-7_74

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