A new and fast orthogonal linear discriminant analysis on undersampled problems

DOI10.1137/090766772zbMATH Open1215.93024OpenAlexW2022086975MaRDI QIDQ2998034FDOQ2998034

Authors: Delin Chu, Siong Thye Goh 

Publication date: 17 May 2011

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090766772

Recommendations

• A comparison of generalized linear discriminant analysis algorithms
• Fast Algorithms for the Generalized Foley–Sammon Discriminant Analysis
• Characterization of all solutions for undersampled uncorrelated linear discriminant analysis problems
• MBLDA: a novel multiple between-class linear discriminant analysis
• Characterization of a family of algorithms for generalized discriminant analysis on undersampled problems

zbMATH Keywords

dimensionality reductionlinear discriminant analysisorthogonal transformationQR factorization

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) System structure simplification (93B11) Feedback control (93B52)

Cited In (14)

• The variables affecting the performance of LDA
• A new perspective to null linear discriminant analysis method and its fast implementation using random matrix multiplication with scatter matrices
• Regularized orthogonal linear discriminant analysis
• Characterization of a family of algorithms for generalized discriminant analysis on undersampled problems
• Kernel-based nonlinear discriminant analysis using minimum squared errors criterion for multiclass and undersampled problems
• A new and fast implementation for null space based linear discriminant analysis
• Incremental regularized least squares for dimensionality reduction of large-scale data
• Characterization of all solutions for undersampled uncorrelated linear discriminant analysis problems
• Complexity-reduced implementations of complete and null-space-based linear discriminant analysis
• Unified formulation of linear discriminant analysis methods and optimal parameter selection
• A comparison of generalized linear discriminant analysis algorithms
• Computational and theoretical analysis of null space and orthogonal linear discriminant analysis
• A theoretical contribution to the fast implementation of null linear discriminant analysis with random matrix multiplication
• Blockwise projection matrix versus blockwise data on undersampled problems: analysis, comparison and applications

Uses Software

• rda

This page was built for publication: A new and fast orthogonal linear discriminant analysis on undersampled problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2998034)