This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Laplacian MinMax Discriminant Projections
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
A new algorithm, Laplacian MinMax Discriminant Projection (LMMDP), is proposed in this paper for supervised dimensionality reduction. LMMDP aims at learning a linear transformation which is an extension of Linear Discriminant Analysis (LDA). Specifically, we define the within-class scatter and the between-class scatter using similarities which are based on pairwise distances in sample space. After the transformation, the considered pairwise samples within the same class are as close as possible, while those between classes are as far as possible. The structural information of classes is contained in the within-class and the between-class Laplacian matrices. Thus the discriminant projection subspace can be derived by controlling the structural evolution of Laplacian matrices. The performance on several data sets demonstrates the competence of the proposed algorithm.
Index Terms:
Linear Discriminant Analysis, Laplacian Matrix, Dimensionality Reduction, Supervised Learning
Citation:
Jianmin Zhao, Zhonglong Zheng, "Laplacian MinMax Discriminant Projections," csie, vol. 6, pp.43-47, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.