A theoretical contribution to the fast implementation of null linear discriminant analysis with random matrix multiplication

From MaRDI portal
Publication:5739749

DOI10.1002/NLA.1990zbMATH Open1374.65084arXiv1409.2579OpenAlexW2135650845MaRDI QIDQ5739749FDOQ5739749


Authors: Gang Wu, Tingting Feng Edit this on Wikidata


Publication date: 19 July 2016

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1409.2579




Recommendations




Cites Work


Cited In (2)

Uses Software





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)