A theoretical contribution to the fast implementation of null linear discriminant analysis with random matrix multiplication
From MaRDI portal
Publication:5739749
Abstract: The null linear discriminant analysis method is a competitive approach for dimensionality reduction. The implementation of this method, however, is computationally expensive. Recently, a fast implementation of null linear discriminant analysis method using random matrix multiplication with scatter matrices was proposed. However, if the random matrix is chosen arbitrarily, the orientation matrix may be rank deficient, and some useful discriminant information will be lost. In this paper, we investigate how to choose the random matrix properly, such that the two criteria of the null LDA method are satisfied theoretically. We give a necessary and sufficient condition to guarantee full column rank of the orientation matrix. Moreover, the geometric characterization of the condition is also described.
Recommendations
- A new perspective to null linear discriminant analysis method and its fast implementation using random matrix multiplication with scatter matrices
- A new and fast implementation for null space based linear discriminant analysis
- Complexity-reduced implementations of complete and null-space-based linear discriminant analysis
- Computational and theoretical analysis of null space and orthogonal linear discriminant analysis
- Fast rate of convergence in high-dimensional linear discriminant analysis
- A new reduced-rank linear discriminant analysis method and its applications
- A new and fast orthogonal linear discriminant analysis on undersampled problems
- Fast and robust discriminant analysis
- High-dimensional linear discriminant analysis using nonparametric methods
Cites work
- scientific article; zbMATH DE number 3052156 (Why is no real title available?)
- A comparison of generalized linear discriminant analysis algorithms
- A new perspective to null linear discriminant analysis method and its fast implementation using random matrix multiplication with scatter matrices
- Complexity-reduced implementations of complete and null-space-based linear discriminant analysis
Cited in
(2)
This page was built for publication: A theoretical contribution to the fast implementation of null linear discriminant analysis with random matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739749)