Feature Selection for Vertex Discriminant Analysis

03/21/2022
by   Alfonso Landeros, et al.
0

We revisit vertex discriminant analysis (VDA) from the perspective of proximal distance algorithms. By specifying sparsity sets as constraints that directly control the number of active features, VDA is able to fit multiclass classifiers with no more than k active features. We combine our sparse VDA approach with repeated cross validation to fit classifiers across the full range of model sizes on a given dataset. Our numerical examples demonstrate that grappling with sparsity directly is an attractive approach to model building in high-dimensional settings. Applications to kernel-based VDA are also considered.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/11/2018

Compressive Regularized Discriminant Analysis of High-Dimensional Data with Applications to Microarray Studies

We propose a modification of linear discriminant analysis, referred to a...
research
07/04/2018

Diagonal Discriminant Analysis with Feature Selection for High Dimensional Data

We introduce a new method of performing high dimensional discriminant an...
research
02/12/2019

Sparse Feature Selection in Kernel Discriminant Analysis via Optimal Scoring

We consider the two-group classification problem and propose a kernel cl...
research
11/19/2017

Vision Recognition using Discriminant Sparse Optimization Learning

To better select the correct training sample and obtain the robust repre...
research
05/09/2020

A Compressive Classification Framework for High-Dimensional Data

We propose a compressive classification framework for settings where the...
research
10/04/2018

Projective Inference in High-dimensional Problems: Prediction and Feature Selection

This paper discusses predictive inference and feature selection for gene...

Please sign up or login with your details

Forgot password? Click here to reset