On optimization of decision trees

Authors:
Igor V. Chikalov;Mikhail Ju. Moshkov;Maria S. Zelentsova
Affiliations:
Intel Labs, Russian Research Center, Nizhny Novgorod, Russia;Institute of Computer Science, University of Silesia, Sosnowiec, Poland;Faculty of Computing Mathematics and Cybernetics of Nizhny, Novgorod State University, Nizhny Novgorod, Russia
Venue:
Transactions on Rough Sets IV
Year:
2005

Citing 5
Cited 7

On algorithm for constructing of decision trees with minimal depth

Fundamenta Informaticae
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
On Finding Optimal Discretizations for Two Attributes

RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
On Algorithm for Constructing of Decision Trees with Minimal Number of Nodes

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Consecutive Optimization of Decision Trees Concerning Various Complexity Measures

Fundamenta Informaticae - International Conference on Soft Computing and Distributed Processing (SCDP'2002)

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
Sequential optimization of matrix chain multiplication relative to different cost functions

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
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
Comparison of greedy algorithms for α-decision tree construction

RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Sequential optimization of binary search trees for multiple cost functions

CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Sequential optimization of binary search trees for multiple cost functions

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper algorithms are considered which allow to consecutively optimize decision trees for decision tables with many-valued decisions relatively different complexity measures such as number of nodes, weighted depth, average weighted depth, etc. For decision tables over an arbitrary infinite restricted information system [5] these algorithms have (at least for the three mentioned measures) polynomial time complexity depending on the length of table description. For decision tables over one of such information systems experimental results of decision tree optimization are described.