Abstract
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 language | English (US) |
|---|---|
| Pages (from-to) | 160-169 |
| Number of pages | 10 |
| Journal | CEUR Workshop Proceedings |
| Volume | 928 |
| State | Published - 2012 |
| Event | 21th International Workshop on Concurrency, Specification and Programming, CS and P 2012 - Berlin, Germany Duration: Sep 26 2012 → Sep 28 2012 |
ASJC Scopus subject areas
- General Computer Science