A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms
From MaRDI portal
Publication:5938648
DOI10.1023/A:1007608224229zbMath0969.68669OpenAlexW2161349318WikidataQ56594407 ScholiaQ56594407MaRDI QIDQ5938648
Weih-Yin Loh, Yu-Shan Shih, Tjen-Sien Lim
Publication date: 1 October 2001
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1007608224229
Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)
Related Items (65)
(Psycho-)analysis of benchmark experiments: a formal framework for investigating the relationship between data sets and learning algorithms ⋮ Evaluation of decision trees: a multi-criteria approach ⋮ Learning effective classifiers with \(Z\)-value measure based on genetic programming ⋮ A novel method for combining Bayesian networks, theoretical analysis, and its applications ⋮ On selecting interestingness measures for association rules: user oriented description and multiple criteria decision aid ⋮ Training a reciprocal-sigmoid classifier by feature scaling-space ⋮ Logical analysis of data -- the vision of Peter L. Hammer ⋮ A survey of deep network techniques all classifiers can adopt ⋮ Breast cancer prediction using the isotonic separation technique ⋮ An information-theoretic instance-based classifier ⋮ Post-pruning in decision tree induction using multiple performance measures ⋮ Information-theoretic self-compression of multi-layered neural networks ⋮ Sensitivity analysis in classification using Bayesian smoothing spline ANOVA probit regression ⋮ Deterministic Neural Classification ⋮ Polynomial-based radial basis function neural networks (P-RBF NNs) realized with the aid of particle swarm optimization ⋮ Variational discriminant analysis with variable selection ⋮ Domains of competence of the semi-naive Bayesian network classifiers ⋮ Masking effects on linear regression in multi-class classification ⋮ Double random forest ⋮ An empirical bias–variance analysis of DECORATE ensemble method at different training sample sizes ⋮ A novel SVM+NDA model for classification with an application to face recognition ⋮ Variable selection for multivariate generalized linear models ⋮ Sequential correction of linear classifiers ⋮ Exploitation of Pairwise Class Distances for Ordinal Classification ⋮ Methods for pattern selection, class-specific feature selection and classification for automated learning ⋮ Performance Comparison of Machine Learning Platforms ⋮ An empirical comparison of ensemble methods based on classification trees ⋮ Automatic identification of music performers with learning ensembles ⋮ GFAM: Evolving Fuzzy ARTMAP neural networks ⋮ An estimation algorithm using distance clustering of data. ⋮ A METHODOLOGICAL COMPARISON BETWEEN STANDARD AND TWO STAGE MIXED INTEGER APPROACHES FOR DISCRIMINANT ANALYSIS ⋮ A comparative study of the leading machine learning techniques and two new optimization algorithms ⋮ Discrete support vector decision trees via tabu search ⋮ A novel Bayesian logistic discriminant model: an application to face recognition ⋮ IFS-CoCo: instance and feature selection based on cooperative coevolution with nearest neighbor rule ⋮ Correlation based splitting criterionin multi branch decision tree ⋮ Improving the precision of classification trees ⋮ Multinomial logit models with implicit variable selection ⋮ Hyper-rectangular space partitioning trees: practical approach ⋮ Spanned patterns for the logical analysis of data ⋮ Accelerated algorithm for pattern detection in logical analysis of data ⋮ Learning in the feed-forward Random Neural Network: A Critical Review ⋮ Multicategory classification via discrete support vector machines ⋮ The geometry of linear separability in data sets ⋮ The impact of preprocessing on data mining: an evaluation of classifier sensitivity in direct marketing ⋮ Diversification for better classification trees ⋮ Competitiveness of nations: a knowledge discovery examination ⋮ Data-mining-based dynamic dispatching rule selection mechanism for shop floor control systems using a support vector machine approach ⋮ G-PNN: a genetically engineered probabilistic neural network ⋮ Logistic model trees ⋮ Classification tree algorithm for grouped variables ⋮ Logistic model trees ⋮ Reusable components in decision tree induction algorithms ⋮ Mining supervised classification performance studies: a meta-analytic investigation ⋮ Where are the large and difficult datasets? ⋮ Gaussian-based visualization of Gaussian and non-Gaussian-based clustering ⋮ On-line identification of control chart patterns using self-organizing approaches ⋮ Comparison of Support Vector Machines to Other Classifiers Using Gene Expression Data ⋮ Statistical Disclosure Control for Data Privacy Using Sequence of Generalised Linear Models ⋮ High-dimensional pseudo-logistic regression and classification with applications to gene expression data ⋮ Design of adaptive Elman networks for credit risk assessment ⋮ Mathematical programming based heuristics for improving LP-generated classifiers for the multiclass supervised classification problem ⋮ Tuning Parameter Selector for the Penalized Likelihood Method in Multivariate Generalized Linear Models ⋮ Linear discriminant analysis with a generalization of the Moore–Penrose pseudoinverse ⋮ Using \(k\)-nearest-neighbor classification in the leaves of a tree
Uses Software
This page was built for publication: A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms
