Relationships Between Average Depth and Number of Nodes for Decision Trees

Igor Chikalov, Shahid Hussain, Mikhail Moshkov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

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.
Original languageEnglish (US)
Title of host publicationAdvances in Intelligent Systems and Computing
PublisherSpringer Nature
Pages519-529
Number of pages11
ISBN (Print)9783642378317
DOIs
StatePublished - Jul 24 2013

Fingerprint Dive into the research topics of 'Relationships Between Average Depth and Number of Nodes for Decision Trees'. Together they form a unique fingerprint.

Cite this