A Bayesian Random Split to Build Ensembles of Classification Trees

DOI10.1007/978-3-642-02906-6_41zbMath1245.62075OpenAlexW1596697978WikidataQ57551185 ScholiaQ57551185MaRDI QIDQ3638170

Andrés Cano, Serafín Moral, Andrés R. Masegosa

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

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

Cites Work

• Unnamed Item
• Bagging predictors
• Arcing classifiers. (With discussion)
• Combining Decision Trees Based on Imprecise Probabilities and Uncertainty Measures
• Extremely randomized trees
• Random forests

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