High-dimensional data classification
From MaRDI portal
Recommendations
- Classification by ensembles from random partitions of high-dimensional data
- Ensemble decision forest of RBF networks via hybrid feature clustering approach for high-dimensional data classification
- A new ensemble method with feature space partitioning for high-dimensional data classification
- A novel divide-and-merge classification for high dimensional datasets
- scientific article; zbMATH DE number 5817573
Cites work
- 10.1162/153244303322753616
- A theory of the learnable
- Bagging predictors
- Bias-corrected diagonal discriminant rules for high-dimensional classification
- Boosting a weak learning algorithm by majority
- Boosting With theL2Loss
- Choosing multiple parameters for support vector machines
- Class prediction by nearest shrunken centroids, with applications to DNA microarrays.
- Comparison of Discrimination Methods for the Classification of Tumors Using Gene Expression Data
- Efficient feature selection via analysis of relevance and redundancy
- Gene selection for cancer classification using support vector machines
- scientific article; zbMATH DE number 590363 (Why is no real title available?)
- scientific article; zbMATH DE number 3798870 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 837698 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- scientific article; zbMATH DE number 1392848 (Why is no real title available?)
- Least angle regression. (With discussion)
- Logistic regression. A self-learning text. With contributions by Erica Rihl Pryor.
- Mercer’s Theorem, Feature Maps, and Smoothing
- Modified linear discriminant analysis approaches for classification of high-dimensional microarray data
- Open-set nearest shrunken centroid classification
- Optimization by simulated annealing
- Pattern classification.
- Pattern recognition and machine learning.
- Performance of feature-selection methods in the classification of high-dimension data
- Prediction Games and Arcing Algorithms
- Radius Margin Bounds for Support Vector Machines with the RBF Kernel
- Random forests
- Regularization and Variable Selection Via the Elastic Net
- Shrinkage-based diagonal discriminant analysis and its applications in high-dimensional data
- Some theory for Fisher's linear discriminant function, `naive Bayes', and some alternatives when there are many more variables than observations
- Sparse linear discriminant analysis with applications to high dimensional low sample size data
- Statistical challenges of high-dimensional data
- The elements of statistical learning. Data mining, inference, and prediction
- Wrappers for feature subset selection
Cited in
(7)- A training algorithm for classification of high-dimensional data
- Machine learning as a universal tool for quantitative investigations of phase transitions
- scientific article; zbMATH DE number 5817573 (Why is no real title available?)
- Random forest kernel for high-dimension low sample size classification
- Soft label guided unsupervised discriminative sparse subspace feature selection
- Quantifying overfitting in deep learning
- Minimum distance classification rules for high dimensional data
This page was built for publication: High-dimensional data classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270620)
