Relationships Between Average Depth and Number of Nodes for Decision Trees

Abstract
This paper presents a new tool for the study of relationships between total path length or average depth and number of nodes of decision trees. In addition to algorithm, the paper also presents the results of experiments with datasets from UCI ML Repository [1]. © Springer-Verlag Berlin Heidelberg 2014.

Citation
Chikalov, I., Hussain, S., & Moshkov, M. (2013). Relationships Between Average Depth and Number of Nodes for Decision Trees. Knowledge Engineering and Management, 519–529. doi:10.1007/978-3-642-37832-4_47

Publisher
Springer Nature

Journal
Advances in Intelligent Systems and Computing

Conference/Event Name
7th International Conference on Intelligent Systems and Knowledge Engineering, ISKE 2012

DOI
10.1007/978-3-642-37832-4_47

Permanent link to this record