The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
A two-stage linear discriminant analysis via QR-decomposition
Abstract
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional data, such as image and text classification. An intrinsic limitation of classical LDA is the so-called singularity problems; that is, it fails when all scatter matrices are singular. Many LDA extensions were proposed in the past to overcome the singularity problems. Among these extensions, PCA+LDA, a two-stage method, received relatively more attention. In PCA+LDA, the LDA stage is preceded by an intermediate dimension reduction stage using Principal Component Analysis (PCA). Most previous LDA extensions are computationally expensive, and not scalable, due to the use of Singular Value Decomposition or Generalized Singular Value Decomposition. In this paper, we propose a two-stage LDA method, namely LDA/QR, which aims to overcome the singularity problems of classical LDA, while achieving efficiency and scalability simultaneously. The key difference between LDA/QR and PCA+LDA lies in the first stage, where LDA/QR applies QR decomposition to a small matrix involving the class centroids, while PCA+LDA applies PCA to the total scatter matrix involving all training data points. We further justify the proposed algorithm by showing the relationship among LDA/QR and previous LDA methods. Extensive experiments on face images and text documents are presented to show the effectiveness of the proposed algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Turk, M., & Pentland, A. (1991) · Journal of Cognitive Neuroscience · doi:10.1162/jocn.1991.3.1.71 · Cited by 13,733
Eigenfaces vs. Fisherfaces: recognition using class specific linear projection
Belhumeur, P. N., Hespanha, J. P., & Kriegman, D. J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.598228 · Cited by 11,707
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
Jolliffe, I. T. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,273
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096
Russell, E. L., Chiang, L. H., & Braatz, R. D. (2000) · Advances in Industrial Control · doi:10.1007/978-1-4471-0409-4_3 · Cited by 7,862
Learning With Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Williams, C. K. I. (2003) · Journal of the American Statistical Association · doi:10.1198/jasa.2003.s269 · Cited by 4,281
Introduction to statistical pattern recognition (2nd ed.)
Fukunaga, K. (1990) · Academic Press Professional, Inc. eBooks · Cited by 3,797
Martinez, A. M., & Kak, A. C. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.908974 · Cited by 3,249
Automatic text processing: the transformation, analysis, and retrieval of information by computer
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0351 · Cited by 3,188
Martínez, A. M. (1998) · CTIT technical reports series · Cited by 2,778
Comparison of Discrimination Methods for the Classification of Tumors Using Gene Expression Data
Dudoit, S., Fridlyand, J., & Speed, T. P. (2002) · Journal of the American Statistical Association · doi:10.1198/016214502753479248 · Cited by 2,672
Regularized Discriminant Analysis
Friedman, J. H. (1989) · Journal of the American Statistical Association · doi:10.1080/01621459.1989.10478752 · Cited by 2,421
Generalized Discriminant Analysis Using a Kernel Approach
Baudat, G., & Anouar, F. (2000) · Neural Computation · doi:10.1162/089976600300014980 · Cited by 1,673
Using discriminant eigenfeatures for image retrieval
Swets, D. L., & Weng, J. J. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.531802 · Cited by 1,620
A direct LDA algorithm for high-dimensional data — with application to face recognition
Yu, H., & Yang, J. (2001) · Pattern Recognition · doi:10.1016/s0031-3203(00)00162-x · Cited by 1,578
A new LDA-based face recognition system which can solve the small sample size problem
Chen, L.-F., Liao, H.-Y. M., Ko, M.-T., Lin, J.-C., & Yu, G.-J. (2000) · Pattern Recognition · doi:10.1016/s0031-3203(99)00139-9 · Cited by 1,427
Generalizing the Singular Value Decomposition
Loan, C. F. V. (1976) · SIAM Journal on Numerical Analysis · doi:10.1137/0713009 · Cited by 656
Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering
Zhao, Y., & Karypis, G. (2004) · Machine Learning · doi:10.1023/b:mach.0000027785.44527.d6 · Cited by 611
Face recognition using kernel direct discriminant analysis algorithms
Lu, J., Plataniotis, K. N., & Venetsanopoulos, A. N. (2003) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2002.806629 · Cited by 608
Discriminative common vectors for face recognition
Cevikalp, H., Neamtu, M., Wilkes, M., & Barkana, A. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.9 · Cited by 528
Robust principal component analysis for computer vision
De la Torre, F., & Black, M. J. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937541 · Cited by 387
Reuters-21578 Text Categorization Test Collection, Distribution 1.0
Lewis, D. (1997) · Medical Entomology and Zoology · Cited by 263
Krzanowski, W. J., Jonathan, P., McCarthy, W. V., & Thomas, M. R. (1995) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.2307/2986198 · Cited by 216
Expected classification error of the Fisher linear classifier with pseudo-inverse covariance matrix
Raudys, S., & Duin, R. P. W. (1998) · Pattern Recognition Letters · doi:10.1016/s0167-8655(98)00016-6 · Cited by 187
Howland, P., Jeon, M., & Park, H. (2003) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479801393666 · Cited by 178
Fast and accurate text classification via multiple linear discriminant projections
Chakrabarti, S., Roy, S., & Soundalgekar, M. V. (2003) · The VLDB Journal · doi:10.1007/s00778-003-0098-9 · Cited by 142
Enhanced Fisher linear discriminant models for face recognition
Liu, C., & Wechsler, H. (2002) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1998.711956 · Cited by 118
An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing
Jin, H., Ooi, B. C., Shen, H. T., Yu, C., & Zhou, A. Y. (2004) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2003.1260784 · Cited by 47
Robust Parameterized Component Analysis: Theory and Applications to 2D Facial Modeling
la Torre, F. D., & Black, M. J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47979-1_44 · Cited by 35
Cited by
Geometric Mean for Subspace Selection
Tao, D., Li, X., Wu, X., & Maybank, S. J. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.70 · Cited by 583
Yang, J., Zhang, D., Yang, J.-Y., & Niu, B. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1008 · Cited by 497
Limitations of Principal Components Analysis for Hyperspectral Target Recognition
Prasad, S., & Bruce, L. M. (2008) · IEEE Geoscience and Remote Sensing Letters · doi:10.1109/lgrs.2008.2001282 · Cited by 340
Tao, D., Li, X., Wu, X., Hu, W., & Maybank, S. J. (2007) · Knowledge and Information Systems · doi:10.1007/s10115-006-0050-6 · Cited by 299
Linear discriminant analysis for the small sample size problem: an overview
Sharma, A., & Paliwal, K. K. (2015) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-013-0226-9 · Cited by 279
Metadata
- Authors
- Ye, J., & Li, Q.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2005-06
- Volume
- 27
- Issue
- 6
- Pages
- 929-941
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2171347282
- Cited by
- 286
- References
- 31
- FWCI
- 21.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.