Double random forest

DOI10.1007/s10994-020-05889-1OpenAlexW3040312898MaRDI QIDQ2203331

Hyunjoong Kim, Yung-Seop Lee, Sunwoo Han

Publication date: 6 October 2020

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-020-05889-1

zbMATH Keywords

classificationbootstrapdecision treerandom forestensemble

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• UCI-ml
• rpart
• ElemStatLearn
• ISLR
• StatLib Datasets Archive
• AdaBoost-SAMME
• XGBoost

Cites Work

• Unnamed Item
• Unnamed Item
• Bagging predictors
• Multi-class AdaBoost
• Out-of-bag estimation of the optimal sample size in bagging
• A weight-adjusted voting algorithm for ensembles of classifiers
• Improving the precision of classification trees
• A decision-theoretic generalization of on-line learning and an application to boosting
• How large should ensembles of classifiers be?
• Microarray learning with ABC
• An Introduction to Statistical Learning
• Random Forests and Adaptive Nearest Neighbors
• A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms
• The elements of statistical learning. Data mining, inference, and prediction
• Random forests

This page was built for publication: Double random forest