Analysis of new variable selection methods for discriminant analysis
From MaRDI portal
Publication:1010495
DOI10.1016/j.csda.2006.04.019zbMath1157.62442OpenAlexW2057407958MaRDI QIDQ1010495
Laura Núñez, Silvia Casado, Joaquín Pacheco, Olga Gómez
Publication date: 6 April 2009
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2006.04.019
Related Items
Exact methods for variable selection in principal component analysis: guide functions and pre-selection ⋮ A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis ⋮ Robust variable selection for model-based learning in presence of adulteration ⋮ Integrating linear discriminant analysis, polynomial basis expansion, and genetic search for two-group classification ⋮ Bayesian variable selection in generalized linear models using a combination of stochastic optimization methods ⋮ Unobserved classes and extra variables in high-dimensional discriminant analysis ⋮ Exact and approximate algorithms for variable selection in linear discriminant analysis ⋮ Invariant optimal feature selection: A distance discriminant and feature ranking based solution ⋮ A discrete particle swarm optimization method for feature selection in binary classification problems ⋮ Variable selection and updating in model-based discriminant analysis for high dimensional data with food authenticity applications ⋮ Direct variable selection for discrimination among several groups ⋮ A variable selection method based on Tabu search for logistic regression models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automatic digital modulation recognition using artificial neural network and genetic algorithm
- A probabilistic heuristic for a computationally difficult set covering problem
- Feature Subset Selection by Bayesian network-based optimization
- Greedy randomized adaptive search procedures
- Efficient strategies for deriving the subset VAR models
- Solving feature subset selection problem by a parallel scatter search
- Tabu Search—Part I
- Tabu Search—Part II
- A Branch and Bound Algorithm for Feature Subset Selection
- A Gentle Introduction to Memetic Algorithms
- Using Adaptive Methods to Select Variables in Case-Control Studies
- Feature subset selection by Bayesian networks: A comparison with genetic and sequential algorithms