We analyze the performance of top down algorithms for decision tree learning, such as those employed by the widely used C4.5 and CART software packages. Our main result is a proof that such algorithms are boosting algorithms. By this we mean that if the functions that label the internal nodes of the
Learning algorithms based on the construction of decision trees
β Scribed by V.I. Donskoi
- Publisher
- Elsevier Science
- Year
- 1982
- Weight
- 905 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Decision forest is an ensemble classification method that combines multiple decision trees to in a manner that results in more accurate classifications. By combining multiple heterogeneous decision trees, decision forest is effective in mitigating noise that is often prevalent in real-world classifi
The Model Base Management System (MBMS) in a Decision Support System (DSS) has become increasingly important in handling complicated decision problems. Traditionally, models are retrieved from the human experts. This approach has the disadvantages of low productivity and being subjective by differen