Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.patcog.2012.01.007
DC FieldValue
dc.titleRegularized orthogonal linear discriminant analysis
dc.contributor.authorChing, W.-K.
dc.contributor.authorChu, D.
dc.contributor.authorLiao, L.-Z.
dc.contributor.authorWang, X.
dc.date.accessioned2014-10-28T02:44:33Z
dc.date.available2014-10-28T02:44:33Z
dc.date.issued2012-07
dc.identifier.citationChing, W.-K., Chu, D., Liao, L.-Z., Wang, X. (2012-07). Regularized orthogonal linear discriminant analysis. Pattern Recognition 45 (7) : 2719-2732. ScholarBank@NUS Repository. https://doi.org/10.1016/j.patcog.2012.01.007
dc.identifier.issn00313203
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/104041
dc.description.abstractIn this paper the regularized orthogonal linear discriminant analysis (ROLDA) is studied. The major issue of the regularized linear discriminant analysis is to choose an appropriate regularization parameter. In existing regularized linear discriminant analysis methods, they all select the best regularization parameter from a given parameter candidate set by using cross-validation for classification. An obvious limitation of such regularized linear discriminant analysis methods is that it is not clear how to choose an appropriate candidate set. Therefore, up to now, there is no concrete mathematical theory available in selecting an appropriate regularization parameter in practical applications of the regularized linear discriminant analysis. The present work is to fill this gap. Here we derive the mathematical relationship between orthogonal linear discriminant analysis and the regularized orthogonal linear discriminant analysis first, and then by means of this relationship we find a mathematical criterion for selecting the regularization parameter in ROLDA and consequently we develop a new regularized orthogonal linear discriminant analysis method, in which no candidate set of regularization parameter is needed. The effectiveness of our proposed regularized orthogonal linear discriminant analysis is illustrated by some real-world data sets. © 2012 Elsevier Ltd. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.patcog.2012.01.007
dc.sourceScopus
dc.subjectData dimensionality reduction
dc.subjectOrthogonal linear discriminant analysis
dc.subjectQR factorization
dc.subjectRegularized orthogonal linear discriminant analysis
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1016/j.patcog.2012.01.007
dc.description.sourcetitlePattern Recognition
dc.description.volume45
dc.description.issue7
dc.description.page2719-2732
dc.description.codenPTNRA
dc.identifier.isiut000302451000022
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.