High-Dimensional Data Classification

DOI10.1007/978-1-4939-0742-7_8zbMath1365.68375OpenAlexW125955014MaRDI QIDQ5270620

Vijay Pappu, Panos M. Pardalos

Publication date: 26 June 2017

Published in: Clusters, Orders, and Trees: Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4939-0742-7_8

zbMATH Keywords

regularizationcurse of dimensionalityensemble methodsfeature selectionhigh-dimensional data classification

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Random forest kernel for high-dimension low sample size classification ⋮ Machine learning as a universal tool for quantitative investigations of phase transitions

Uses Software

• LIBSVM
• rda
• WEKA
• GeneSrF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bagging predictors
• Optimization by Simulated Annealing
• Logistic regression. A self-learning text. With contributions by Erica Rihl Pryor.
• Modified linear discriminant analysis approaches for classification of high-dimensional microarray data
• Performance of feature-selection methods in the classification of high-dimension data
• Wrappers for feature subset selection
• Class prediction by nearest shrunken centroids, with applications to DNA microarrays.
• Some theory for Fisher's linear discriminant function, `naive Bayes', and some alternatives when there are many more variables than observations
• Least angle regression. (With discussion)
• Boosting a weak learning algorithm by majority
• Open-Set Nearest Shrunken Centroid Classification
• Bias-Corrected Diagonal Discriminant Rules for High-Dimensional Classification
• Statistical challenges of high-dimensional data
• A theory of the learnable
• Comparison of Discrimination Methods for the Classification of Tumors Using Gene Expression Data
• Boosting With theL₂Loss
• Radius Margin Bounds for Support Vector Machines with the RBF Kernel
• 10.1162/153244303322753616
• Mercer’s Theorem, Feature Maps, and Smoothing
• Regularization and Variable Selection Via the Elastic Net
• Shrinkage‐based Diagonal Discriminant Analysis and Its Applications in High‐Dimensional Data
• Prediction Games and Arcing Algorithms
• The elements of statistical learning. Data mining, inference, and prediction
• Random forests
• Choosing multiple parameters for support vector machines
• Gene selection for cancer classification using support vector machines

This page was built for publication: High-Dimensional Data Classification