A simpler analysis of the multi-way branching decision tree boosting algorithm

DOI10.1007/3-540-45583-3_8MaRDI QIDQ4473544zbMATH OpenFDO

Authors Kohei Hatano

Publication date 4 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2225/22250077.htm

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• A simple boosting algorithm using multi-way branching decision trees
• Approximating Decision Trees with Multiway Branches
• On the boosting ability of top-down decision tree learning algorithms
• scientific article; zbMATH DE number 1256765
• Boosted tree ensembles for solving multiclass problems
• Top-down decision tree boosting and its applications
• A branch \& bound algorithm to determine optimal cross-splits for decision tree induction

Cited in

(2)

• A simple boosting algorithm using multi-way branching decision trees
• Top-down decision tree boosting and its applications

This page was built for publication: A simpler analysis of the multi-way branching decision tree boosting algorithm

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