A Bayesian Random Split to Build Ensembles of Classification Trees

DOI10.1007/978-3-642-02906-6_41MaRDI QIDQ3638170zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Andrés Cano, Andrés Masegosa, Serafin Moral

Publication date 2 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02906-6_41

Mathematics Subject Classification ID

Bayesian problems; characterization of Bayes procedures (62C10) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Random forests
• A random forest guided tour
• Random forest with acceptance-rejection trees
• Double random forest
• Random Forests and Adaptive Nearest Neighbors

Cites work

• Arcing classifiers. (With discussion)
• Bagging predictors
• Combining Decision Trees Based on Imprecise Probabilities and Uncertainty Measures
• Extremely randomized trees
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• Random forests

Cited in

(3)

• Random forest with acceptance-rejection trees
• A novel ensemble model -- the random granular reflections
• Random forest prediction method based on Bayesian model combination

This page was built for publication: A Bayesian Random Split to Build Ensembles of Classification Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638170)