Inproceedings,

The alternating decision tree learning algorithm,

, and .
Proc. 16th International Conf. on Machine Learning, page 124--133. Morgan Kaufmann, San Francisco, CA, (1999)

Abstract

The application of boosting procedures to decision tree algorithms has been shown to produce very accurate classifiers. These classifiers are in the form of a majority vote over a number of decision trees. Unfortunately, these classifiers are often large, complex and difficult to interpret. This paper describes a new type of classification rule, the alternating decision tree, which is a generalization of decision trees, voted decision trees and voted decision stumps. At the same time...

Tags

Users

  • @hotho
  • @earthfare
  • @dblp

Comments and Reviews