{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:28:33Z","timestamp":1787333313528,"version":"build-2736575974"},"reference-count":48,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2010,1]]},"abstract":"<jats:p>Dimensionality reduction has become a ubiquitous preprocessing step in many applications. Linear discriminant analysis (LDA) has been known to be one of the most optimal dimensionality reduction methods for classification. However, a main disadvantage of LDA is that the so-called total scatter matrix must be nonsingular. But, in many applications, the scatter matrices can be singular since the data points are from a very high-dimensional space, and thus usually the number of the data samples is smaller than the data dimension. This is known as the undersampled problem. Many generalized LDA methods have been proposed in the past to overcome this singularity problem. There is a commonality for these generalized LDA methods; that is, they compute the optimal linear transformations by computing some eigen-decompositions and involving some matrix inversions. However, the eigen-decomposition is computationally expensive, and the involvement of matrix inverses may lead to the methods not numerically stable if the associated matrices are ill-conditioned. Hence, many existing LDA methods have high computational cost and have potential numerical instability problems. In this paper we present a new orthogonal LDA method for the undersampled problem. The main features of our proposed LDA method include the following: (i) the optimal transformation matrix is obtained easily by only orthogonal transformations without computing any eigen-decomposition and matrix inverse, and, consequently, our LDA method is inverse-free and numerically stable; (ii) our LDA method is implemented by using several QR factorizations and is a fast one. The effectiveness of our new method is illustrated by some real-world data sets.<\/jats:p>","DOI":"10.1137\/090766772","type":"journal-article","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T21:27:49Z","timestamp":1280957269000},"page":"2274-2297","source":"Crossref","is-referenced-by-count":17,"title":["A New and Fast Orthogonal Linear Discriminant Analysis on Undersampled Problems"],"prefix":"10.1137","volume":"32","author":[{"given":"Delin","family":"Chu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siong Thye","family":"Goh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2010,8,4]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1038\/35000501"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050264"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"P. Baldi and G. W. Hatfield,\n                      DNA Microarrays and Gene Expression: From Experiments to Data Analysis and Modeling\n                      , Cambridge University Press, Cambridge, 2002.","DOI":"10.1017\/CBO9780511541773"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-006-0001-x"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"P. Benner and R. Byers,\n                      Evaluating products of matrix pencils and collapsing matrix products\n                      , Numer. Linear Algebra Appl., 8 (2001), pp 357\u2013380.","DOI":"10.1002\/nla.251"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1137\/1037127"},{"key":"R7","unstructured":"C. M. Bishop,\n                      Pattern Recognition and Machine Learning\n                      , Springer, New York, 2006."},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2006.881945"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(99)00139-9"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-002-0431-z"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(02)00092-4"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1109\/34.9121"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1198\/016214502753479248"},{"key":"R14","unstructured":"R. Q. Duda, P. E., Hart, and D. G. Stork,\n                      Pattern Classification\n                      , 2nd ed., John Wiley and Sons, New York, 2001."},{"key":"R15","unstructured":"W. B. Frakes and R. Baeza-Yates,\n                      Information Retrieval: Data Structures and Algorithms\n                      , Prentice Hall PTR, Englewood Cliffs, NJ, 1992."},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1989.10478752"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"K. Fukunaga,\n                      Introduction to Statistical Pattern Recognition\n                      , 2nd ed., Academic Press, New York, 1990.","DOI":"10.1016\/B978-0-08-047865-4.50007-7"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1109\/34.927464"},{"key":"R19","unstructured":"G. H. Golub and C. F. Van Loan,\n                      Matrix Computations\n                      , 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996."},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxj035"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00510.x"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"W. Hersh, C. Buckley, T. J. Leone, and D. Hickam,\n                      OHSUMED: An interactive retrieval evaluation and new large test collection for research\n                      , in Proceedings of the ACM SIGIR, 1994, pp. 192\u2013201.","DOI":"10.1007\/978-1-4471-2099-5_20"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801393666"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.46"},{"key":"R25","doi-asserted-by":"crossref","unstructured":"R. Huang, Q. Liu, H. Lu, and S. Ma,\n                      Solving the small smaple size problem of LDA\n                      , in Proceedings of the International Conference on Pattern Recognition, 2002, pp. 29\u201332.","DOI":"10.1109\/ICPR.2002.1047787"},{"key":"R26","unstructured":"A. K. Jain and R. C. Dubes,\n                      Algorithms for Clustering Data\n                      , Prentice Hall, Englewood Cliffs, NJ, 1988."},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(00)00084-4"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(00)00135-7"},{"key":"R29","unstructured":"I. T. Jolliffe,\n                      Principal Component Analysis\n                      , 2nd ed., Springer, New York, 2002."},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1038\/89044"},{"key":"R31","doi-asserted-by":"crossref","unstructured":"H. Kim, P. Howland, and H. Park,\n                      Text classification using support vector machines with dimension reduction\n                      , in Proceedings of Text Mining Workshop of the 3rd SIAM International Conference on Data Mining, San Francisco, CA, 2003.","DOI":"10.1007\/978-1-4757-4305-0_1"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1145\/291128.291131"},{"key":"R33","unstructured":"G. Kowalski,\n                      Information Retrieval Systems: Theory and Implementation\n                      , Kluwer, Norwell, MA, 1997."},{"key":"R34","unstructured":"D. D. Lewis,\n                      Reuters-\n                      21578\n                      Text Categorization Test Collection\n                      , http:\/\/www.daviddlewis.com\/resources\/testcollections\/reuters21578\/."},{"key":"R35","doi-asserted-by":"publisher","DOI":"10.1137\/0718026"},{"key":"R36","unstructured":"H. Park, B. Drake, S. Lee, and C. Park,\n                      Fast Linear Discriminant Analysis Using QR Decomposition and Regularization\n                      , Technical report GT-CSE-07-21, Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, 2007."},{"key":"R37","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026039313770"},{"key":"R38","doi-asserted-by":"publisher","DOI":"10.1137\/040607599"},{"key":"R39","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti033"},{"key":"R40","doi-asserted-by":"publisher","DOI":"10.1109\/34.531802"},{"key":"R41","doi-asserted-by":"publisher","DOI":"10.1137\/0713009"},{"key":"R42","doi-asserted-by":"publisher","DOI":"10.1198\/016214506000001383"},{"key":"R43","first-page":"483","volume":"6","author":"Ye J.","year":"2005","journal-title":"J. Mach. Learn. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/1532-4435","issn-type":"print"},{"key":"R44","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.37"},{"key":"R45","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.110"},{"key":"R46","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2004.45"},{"key":"R47","first-page":"1183","volume":"7","author":"Ye J.","year":"2006","journal-title":"J. Mach. Learn. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/1532-4435","issn-type":"print"},{"key":"R48","doi-asserted-by":"publisher","DOI":"10.1137\/080720863"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/090766772","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:50:06Z","timestamp":1787331006000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/090766772"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["10.1137\/090766772"],"URL":"https:\/\/doi.org\/10.1137\/090766772","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}