Exact and approximate algorithms for variable selection in linear discriminant analysis

Authors:
Michael J. Brusco;Douglas Steinley
Affiliations:
Florida State University, USA;University of Missouri-Columbia, USA
Venue:
Computational Statistics & Data Analysis
Year:
2011

Citing 5
Cited 2

Efficient variable screening for multivariate analysis

Journal of Multivariate Analysis
Analysis of new variable selection methods for discriminant analysis

Computational Statistics & Data Analysis
DALASS: Variable selection in discriminant analysis via the LASSO

Computational Statistics & Data Analysis
Variable selection in multivariate methods using global score estimation

Computational Statistics
A simple method for screening variables before clustering microarray data

Computational Statistics & Data Analysis

Structural model of credit migration

Computational Statistics & Data Analysis
Exact methods for variable selection in principal component analysis: Guide functions and pre-selection

Computational Statistics & Data Analysis

Quantified Score

Hi-index	0.03

Visualization

Abstract

Variable selection is a venerable problem in multivariate statistics. In the context of discriminant analysis, the goal is to select a subset of variables that accomplishes one of two objectives: (1) the provision of a parsimonious, yet descriptive, representation of group structure, or (2) the ability to correctly allocate new cases to groups. We present an exact (branch-and-bound) algorithm for variable selection in linear discriminant analysis that identifies subsets of variables that minimize Wilks' @L. An important feature of this algorithm is a variable reordering scheme that greatly reduces computation time. We also present an approximate procedure based on tabu search, which can be implemented for a variety of objective criteria designed for either the descriptive or allocation goals associated with discriminant analysis. The tabu search heuristic is especially useful for maximizing the hit ratio (i.e., the percentage of correctly classified cases). Computational results for the proposed methods are provided for two data sets from the literature.