A New and Fast Orthogonal Linear Discriminant Analysis on Undersampled Problems

DOI10.1137/090766772zbMATH Open1215.93024OpenAlexW2022086975MaRDI QIDQ2998034FDOQ2998034

Siong Thye Goh, Delin Chu

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

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 (4)

• Regularized orthogonal linear discriminant analysis
• Incremental regularized least squares for dimensionality reduction of large-scale data
• Complexity-reduced implementations of complete and null-space-based linear discriminant analysis
• A theoretical contribution to the fast implementation of null linear discriminant analysis with random matrix multiplication

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)