An empirical comparison of ensemble methods based on classification trees

DOI10.1080/00949650410001729472zbMath1075.62051OpenAlexW2027541734MaRDI QIDQ5697317

Mounir Hamza, Denis Larocque

Publication date: 17 October 2005

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00949650410001729472

zbMATH Keywords

entropytablesGininoiseclassification treeCARTbaggingboostingarcingsplitting rulerandom forest (RF)linear combination of variablestwoing

Mathematics Subject Classification ID

Related Items (12)

On the asymptotics of random forests ⋮ Ensemble of randomized soft decision trees for robust classification ⋮ Model-Assisted Estimation Through Random Forests in Finite Population Sampling ⋮ RandGA: injecting randomness into parallel genetic algorithm for variable selection ⋮ Stochastic correlation coefficient ensembles for variable selection ⋮ Discrete-time survival trees and forests with time-varying covariates ⋮ Global and local two-sample tests via regression ⋮ Mixed-effects random forest for clustered data ⋮ Discrete-time survival trees ⋮ Regression trees and forests for non-homogeneous Poisson processes ⋮ An ensemble method for concept drift in nonstationary environment ⋮ Robustness of random forests for regression

Cites Work

• Unnamed Item
• Unnamed Item
• Arcing classifiers. (With discussion)
• Soft margins for AdaBoost
• A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms
• An adaptive version of the boost by majority algorithm
• Random forests

This page was built for publication: An empirical comparison of ensemble methods based on classification trees