Reducing Complexity of Decision Trees with Two Variable Tests
Abstract
This paper examines some ways to reduce the compexity of built trees particularly with respect to disjunctive concepts. A number of heuristics that allow two categorical (nominal) variables to be combined at each node are described. Different combinations of these heuristics are then applied to five data sets. When these cases are analysed it is found that a number of combinations perform better than or equal to the conventional partitioning techniques for nearly all the data sets. The only data set which doesn't perform well is the one which has attributes with a high arity. Future directions are then discussed raising the possibility of more (> 2) attributes tested at each node.
Cite
Text
Pearson and Smith. "Reducing Complexity of Decision Trees with Two Variable Tests." International Conference on Algorithmic Learning Theory, 1996. doi:10.1007/3-540-61863-5_37Markdown
[Pearson and Smith. "Reducing Complexity of Decision Trees with Two Variable Tests." International Conference on Algorithmic Learning Theory, 1996.](https://mlanthology.org/alt/1996/pearson1996alt-reducing/) doi:10.1007/3-540-61863-5_37BibTeX
@inproceedings{pearson1996alt-reducing,
title = {{Reducing Complexity of Decision Trees with Two Variable Tests}},
author = {Pearson, R. A. and Smith, E. K. T.},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {1996},
pages = {91-99},
doi = {10.1007/3-540-61863-5_37},
url = {https://mlanthology.org/alt/1996/pearson1996alt-reducing/}
}