Performance of feature-selection methods in the classification of high-dimension data
From MaRDI portal
Publication:1005647
DOI10.1016/j.patcog.2008.08.001zbMath1181.68240OpenAlexW2077922582MaRDI QIDQ1005647
Edward R. Dougherty, Jianping Hua, Waibhav D. Tembe
Publication date: 9 March 2009
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2008.08.001
Related Items (12)
On selecting interacting features from high-dimensional data ⋮ A neuro-fuzzy classification technique using dynamic clustering and GSS rule generation ⋮ An opinion formation based binary optimization approach for feature selection ⋮ Selection of time instants and intervals with support vector regression for multivariate functional data ⋮ Why significant variables aren’t automatically good predictors ⋮ Bagging constraint score for feature selection with pairwise constraints ⋮ Unsupervised feature selection with ensemble learning ⋮ Fuzzy complex numbers and their application for classifiers performance evaluation ⋮ Modular proximal optimization for multidimensional total-variation regularization ⋮ Theory of optimal Bayesian feature filtering ⋮ A novel quality prediction method based on feature selection considering high dimensional product quality data ⋮ High-Dimensional Data Classification
Uses Software
Cites Work
- An extensive comparison of recent classification tools applied to microarray data
- Determination of optimal dimensionality in statistical pattern classification
- On the optimal number of features in the classification of multivariate Gaussian data
- Bolstered error estimation
- Determination of the optimal number of features for quadratic discriminant analysis via the normal approximation to the discriminant distribution
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
- Introductory Biostatistics
This page was built for publication: Performance of feature-selection methods in the classification of high-dimension data
