Supervised subspace learning with multi-class Lagrangian SVM on the Grassmann manifold

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

Abstract

Learning robust subspaces to maximize class discrimination is challenging, and most current works consider a weak connection between dimensionality reduction and classifier design. We propose an alternate framework wherein these two steps are combined in a joint formulation to exploit the direct connection between dimensionality reduction and classification. Specifically, we learn an optimal subspace on the Grassmann manifold jointly minimizing the classification error of an SVM classifier. We minimize the regularized empirical risk over both the hypothesis space of functions that underlies this new generalized multi-class Lagrangian SVM and the Grassmann manifold such that a linear projection is to be found. We propose an iterative algorithm to meet the dual goal of optimizing both the classifier and projection. Extensive numerical studies on challenging datasets show robust performance of the proposed scheme over other alternatives in contexts wherein limited training data is used, verifying the advantage of the joint formulation. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Pham, D. S., & Venkatesh, S. (2011). Supervised subspace learning with multi-class Lagrangian SVM on the Grassmann manifold. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7106 LNAI, pp. 241–250). https://doi.org/10.1007/978-3-642-25832-9_25

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