Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Zheng, W.
Right arrow Articles by Zou, C.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Zheng, W.
Right arrow Articles by Zou, C.
(Neural Computation. 2004;16:1283-1297.)
© 2004 The MIT Press


Letter

A Modified Algorithm for Generalized Discriminant Analysis

Wenming Zheng

wenming_zheng{at}seu.edu.cn, Engineering Research Center of Information Processing and Application, Southest University, Nanjing, Jiangsu 210096, People's Republic of China

Li Zhao

zhaoli{at}seu.edu.cn, Engineering Research Center of Information Processing and Application, Southest University, Nanjing, Jiangsu 210096, People's Republic of China

Cairong Zou

cairong{at}seu.edu.cn, Engineering Research Center of Information Processing and Application, Southest University, Nanjing, Jiangsu 210096, People's Republic of China

Generalized discriminant analysis (GDA) is an extension of the classical linear discriminant analysis (LDA) from linear domain to a nonlinear domain via the kernel trick. However, in the previous algorithm of GDA, the solutions may suffer from the degenerate eigenvalue problem (i.e., several eigenvectors with the same eigenvalue), which makes them not optimal in terms of the discriminant ability. In this letter, we propose a modified algorithm for GDA (MGDA) to solve this problem. The MGDA method aims to remove the degeneracy of GDA and find the optimal discriminant solutions, which maximize the between-class scatter in the subspace spanned by the degenerate eigenvectors of GDA. Theoretical analysis and experimental results on the ORL face database show that the MGDA method achieves better performance than the GDA method.




This article has been cited by other articles:


Home page
Neural Comput.Home page
W. Zheng
Class-incremental generalized discriminant analysis.
Neural Comput., April 1, 2006; 18(4): 979 - 1006.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2004 by The MIT Press.