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 Comp. Math. and Cybernetics of Nizhny Novgorod State Univ. 23, Gagarina Av., Nizhny Novgorod 6 ...;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:
2003

Citing 2
Cited 6

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

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
Constructing an optimal decision tree for FAST corner point detection

RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
On optimization of decision trees

Transactions on Rough Sets IV
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.01

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.