A Compressive Classification Framework for High-Dimensional Data
원문 초록
We propose a compressive classification framework for settings where the data dimensionality is significantly higher than the sample size. The proposed method, referred to as compressive regularized discriminant analysis (CRDA) is based on linear discriminant analysis and has the ability to select significant features by using joint-sparsity promoting hard thresholding in the discriminant rule. Since the number of features is larger than the sample size, the method also uses state-of-the-art regularized sample covariance matrix estimators. Several analysis examples on real data sets, including image, speech signal and gene expression data illustrate the promising improvements offered by the proposed CRDA classifier in practise. Overall, the proposed method gives fewer misclassification errors than its competitors, while at the same time achieving accurate feature selection results. The open-source R package and MATLAB toolbox of the proposed method (named compressiveRDA) is freely available.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
LLSF - Learning Label Specific Features for Multi-Label Classifcation
ExploreKit: Automatic Feature Generation and Selection
Malware Classification Leveraging NLP & Machine Learning for Enhanced Accuracy
Margin-aware Fuzzy Rough Feature Selection: Bridging Uncertainty Characterization and Pattern Classification
An Interpretable Adaptive Multiscale Attention Deep Neural Network for Tabular Data
Bio-Inspired Feature Selection in Brain Disease Detection via an Improved Sparrow Search Algorithm
토론
이 논문과 연결된 포럼 글이 아직 없습니다.