Consecutive Optimization of Decision Trees Concerning Various Complexity Measures

Authors:
Mikhail Ju. Moshov;Igor V. Chikalov
Affiliations:
Intel Labs, Russian Research Center, 30, Turgenev Str., Nizhny Novgorod 603950, Russia and Faculty of Computing Mathematics and Cybernetics of Nizhny Novgorod State University 23, Gagarina Av., Ni ...;Intel Labs, Russian Research Center, 30, Turgenev Str., Nizhny Novgorod 603950, Russia
Venue:
Fundamenta Informaticae - International Conference on Soft Computing and Distributed Processing (SCDP'2002)
Year:
2004

Citing 3
Cited 0

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
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
On Algorithm for Constructing of Decision Trees with Minimal Depth

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper algorithms are considered which allow to optimize decision trees consecutively againsts relatively different criterions. For decision tables over an arbitrary infinite restricted information system [4], these algorithms have polynomial time complexity.