IDEAS home Printed from https://ideas.repec.org/a/igg/jcini0/v5y2011i1p94-112.html
   My bibliography  Save this article

Equivalence Between LDA/QR and Direct LDA

Author

Listed:
  • Rong-Hua Li

    (The Hong Kong Polytechnic University, Hong Kong)

  • Shuang Liang

    (The Hong Kong Polytechnic University, Hong Kong)

  • George Baciu

    (The Hong Kong Polytechnic University, Hong Kong)

  • Eddie Chan

    (The Hong Kong Polytechnic University, Hong Kong)

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.

Suggested Citation

  • Rong-Hua Li & Shuang Liang & George Baciu & Eddie Chan, 2011. "Equivalence Between LDA/QR and Direct LDA," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), IGI Global, vol. 5(1), pages 94-112, January.
    • Handle: RePEc:igg:jcini0:v:5:y:2011:i:1:p:94-112
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jcini.2011010106
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jcini0:v:5:y:2011:i:1:p:94-112. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.