Relationships between Average Depth and Number of Misclassifications for Decision Trees

Authors:
Igor Chikalov;Shahid Hussain;Mikhail Moshkov
Affiliations:
Computer, Electrical and Mathematical Sciences and Engineering, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia. {igor.chikalov, shahid.hussain, mikhail.moshkov ...;Computer, Electrical and Mathematical Sciences and Engineering, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia. {igor.chikalov, shahid.hussain, mikhail.moshkov ...;Computer, Electrical and Mathematical Sciences and Engineering, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia. {igor.chikalov, shahid.hussain, mikhail.moshkov ...
Venue:
Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek
Year:
2014

Citing 6
Cited 0

From optimal hyperplanes to optimal decision trees

Fundamenta Informaticae
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
On algorithm for building of optimal α-decision trees

RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
A tool for study of optimal decision trees

RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Relationships between depth and number of misclassifications for decision trees

RSFDGrC'11 Proceedings of the 13th international conference on Rough sets, fuzzy sets, data mining and granular computing
Time complexity of decision trees

Transactions on Rough Sets III

Quantified Score

Hi-index	0.00

Visualization

Abstract

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