Please use this identifier to cite or link to this item:
Title: Equivalence between LDA/QR and direct LDA
Authors: Li, RH
Liang, S
Baciu, G 
Chan, E
Issue Date: 2011
Source: International journal of cognitive informatics and natural intelligence, 2011, v. 5, no. 1, p. 94-112
Abstract: Singularity problems of scatter matrices in Linear Discriminant Analysis (LDA) are challenging and have obtained attention during the last decade. Linear Discriminant Analysis via QR decomposition (LDA/QR) and Direct Linear Discriminant analysis (DLDA) are two popular algorithms to solve the singularity problem. This paper establishes the equivalent relationship between LDA/QR and DLDA. They can be regarded as special cases of pseudo-inverse LDA. Similar to LDA/QR algorithm, DLDA can also be considered as a two-stage LDA method. Interestingly, the first stage of DLDA can act as a dimension reduction algorithm. The experiment compares LDA/QR and DLDA algorithms in terms of classification accuracy, computational complexity on several benchmark datasets and compares their first stages. The results confirm the established equivalent relationship and verify their capabilities in dimension reduction.
Keywords: Direct LDA
Face recognition
Pseudo-Inverse LDA
Text classification
Publisher: IGI Global
Journal: International journal of cognitive informatics and natural intelligence 
ISSN: 1557-3958
EISSN: 1557-3966
DOI: 10.4018/jcini.2011010106
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Sep 7, 2020

Page view(s)

Last Week
Last month
Citations as of Sep 28, 2020

Google ScholarTM



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