Welcome to the InfoSci Platform
Reference Hub1
Equivalence Between LDA/QR and Direct LDA

Equivalence Between LDA/QR and Direct LDA

Rong-Hua Li, Shuang Liang, George Baciu, Eddie Chan
Copyright: © 2011 |Volume: 5 |Issue: 1 |Pages: 19
ISSN: 1557-3958|EISSN: 1557-3966|EISBN13: 9781613505991|DOI: 10.4018/jcini.2011010106
Cite Article Cite Article

MLA

Li, Rong-Hua, et al. "Equivalence Between LDA/QR and Direct LDA." IJCINI vol.5, no.1 2011: pp.94-112. http://doi.org/10.4018/jcini.2011010106

APA

Li, R., Liang, S., Baciu, G., & Chan, E. (2011). Equivalence Between LDA/QR and Direct LDA. International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), 5(1), 94-112. http://doi.org/10.4018/jcini.2011010106

Chicago

Li, Rong-Hua, et al. "Equivalence Between LDA/QR and Direct LDA," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI) 5, no.1: 94-112. http://doi.org/10.4018/jcini.2011010106

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.