Relationships between depth and number of misclassifications for decision trees

Authors:
Igor Chikalov;Shahid Hussain;Mikhail Moshkov
Affiliations:
Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia;Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia;Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia
Venue:
RSFDGrC'11 Proceedings of the 13th international conference on Rough sets, fuzzy sets, data mining and granular computing
Year:
2011

Citing 3
Cited 2

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
On optimization of decision trees

Transactions on Rough Sets IV

Dynamic Programming Approach for Partial Decision Rule Optimization

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Relationships between Average Depth and Number of Misclassifications for Decision Trees

Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a new tool for the study of relationships between depth and number of misclassifications for decision trees. In addition to the algorithm the paper also presents the results of experiments with three datasets from UCI Machine Learning Repository [3].