Generating Better Decision Trees
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Machine Learning. Pages 800-804.
Abstract
A new decision tree learning algorithm called IDX is described. More general than existing algorithms, IDX addresses issues of decision tree quality largely overlooked in the artificial intelligence and machine learning literature. Decision tree size, error rate, and expected classification cost are just a few of the quality measures it can exploit. Furthermore, decision trees of varying quality can be induced simply by adjusting the complexity of the algorithm. Quality should be addressed during decision tree construction since retrospective pruning of the tree, or of a derived rule set, may be unable to compensate for inferior splitting decisions. The complexity of the algorithm, the basis for the heuristic it embodies, and the results of three different sets of experiments are described.
@inproceedings{ijcai1989p128,
title = {Generating Better Decision Trees},
author = {Norton, Steven W.},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {800--804},
year = {1989},
month = {8},
note = {Machine Learning},
url = {https://ijcai.org/proceedings/1989/128},
}
TY - CPAPER TI - Generating Better Decision Trees AU - Norton, Steven W. T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 800 EP - 804 UR - https://ijcai.org/proceedings/1989/128 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
