Average depth and number of misclassifications for decision trees

Igor Chikalov, Shahid Hussain, Mikhail Moshkov

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations


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

Original languageEnglish (US)
Pages (from-to)160-169
Number of pages10
JournalCEUR Workshop Proceedings
StatePublished - 2012
Event21th International Workshop on Concurrency, Specification and Programming, CS and P 2012 - Berlin, Germany
Duration: Sep 26 2012Sep 28 2012

ASJC Scopus subject areas

  • General Computer Science


Dive into the research topics of 'Average depth and number of misclassifications for decision trees'. Together they form a unique fingerprint.

Cite this