Generalising Combinatorial Discriminant Analysis through Conditioning Truncated Rayleigh Flow
Abstract
Fisher's Linear Discriminant Analysis (LDA) has been widely used for linear classification, feature selection, and metrics learning in multivariate data analytics. To ensure high classification accuracy while optimally discovering predictive features from the data, this paper studied CDA, namely Combinatorial Discriminant Analysis that intends to combinatorially select a subset of features and assign weights to them optimally. CDA extents the Truncated Rayleigh Flow algorithm (Tan et al. in J R Stat Soc: Ser B (Stat Methodol) 80(5):1057–1086, 2018) and improves LDA estimation under k-sparsity constraint. The experimental results based on the synthesized and real-world datasets demonstrate that our algorithm outperforms other LDA baselines and downstream classifiers. The empirical analysis shows that our algorithm can recover the combinatorial structure of optimal LDA with empirical consistency.
Recommended Citation
S. Yang et al., "Generalising Combinatorial Discriminant Analysis through Conditioning Truncated Rayleigh Flow," Knowledge and Information Systems, vol. 63, no. 8, pp. 2189 - 2208, Springer, Aug 2021.
The definitive version is available at https://doi.org/10.1007/s10115-021-01587-z
Department(s)
Computer Science
International Standard Serial Number (ISSN)
0219-3116; 0219-1377
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2021 Springer, All rights reserved.
Publication Date
01 Aug 2021
