IDEAS home Printed from https://ideas.repec.org/a/bpj/sagmbi/v12y2013i3p347-359n1004.html
   My bibliography  Save this article

Block-diagonal discriminant analysis and its bias-corrected rules

Author

Listed:
  • Pang Herbert

    (Department of Biostatistics and Bioinformatics, Duke University School of Medicine, Durham, NC 27710, USA)

  • Tong Tiejun

    (Department of Mathematics, Hong Kong Baptist University, Hong Kong)

  • Ng Michael

    (Department of Mathematics, Hong Kong Baptist University, Hong Kong)

Abstract

High-throughput expression profiling allows simultaneous measure of tens of thousands of genes at once. These data have motivated the development of reliable biomarkers for disease subtypes identification and diagnosis. Many methods have been developed in the literature for analyzing these data, such as diagonal discriminant analysis, support vector machines, and k-nearest neighbor methods. The diagonal discriminant methods have been shown to perform well for high-dimensional data with small sample sizes. Despite its popularity, the independence assumption is unlikely to be true in practice. Recently, a gene module based linear discriminant analysis strategy has been proposed by utilizing the correlation among genes in discriminant analysis. However, the approach can be underpowered when the samples of the two classes are unbalanced. In this paper, we propose to correct the biases in the discriminant scores of block-diagonal discriminant analysis. In simulation studies, our proposed method outperforms other approaches in various settings. We also illustrate our proposed discriminant analysis method for analyzing microarray data studies.

Suggested Citation

  • Pang Herbert & Tong Tiejun & Ng Michael, 2013. "Block-diagonal discriminant analysis and its bias-corrected rules," Statistical Applications in Genetics and Molecular Biology, De Gruyter, vol. 12(3), pages 347-359.
  • Handle: RePEc:bpj:sagmbi:v:12:y:2013:i:3:p:347-359:n:1004
    DOI: 10.1515/sagmb-2012-0017
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/sagmb-2012-0017
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.

    File URL: https://libkey.io/10.1515/sagmb-2012-0017?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:bpj:sagmbi:v:12:y:2013:i:3:p:347-359:n:1004. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.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.