On Algorithm for Constructing of Decision Trees with Minimal Depth

Authors:
Mikhail Moshkov;Igor Chikalov
Affiliations:
(Correspd.: Res. Inst. for Appl. Math. and Cybernetics of Nizhni Novgorod Ste. Univ., 10, Uljanova St., Nizhni Novgorod, 603005, Russia) Research Institute for Applied Mathematics and Cybernetics ...;(Correspd. Fac. of Comp. Math. and Cybernetics of Nizhni Novgorod Ste. Univ., 23, Gagarina Av., Nizhni Novgorod, 603600, Russia) Faculty of Computing Mathematics and Cybernetics of Nizhni Novgorod ...
Venue:
Fundamenta Informaticae
Year:
2000

Citing 1
Cited 6

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data

Consecutive Optimization of Decision Trees Concerning Various Complexity Measures

Fundamenta Informaticae - International Conference on Soft Computing and Distributed Processing (SCDP'2002)
Dynamic Programming Approach for Partial Decision Rule Optimization

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Dynamic programming approach to optimization of approximate decision rules

Information Sciences: an International Journal
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
Communication: Diagnosis of constant faults in iteration-free circuits over monotone basis

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm is considered which for a given decision table constructs a decision tree with minimal depth. The class of all information systems (finite and infinite) is described for which this algorithm has polynomial time complexity depending on the number of columns (attributes) in decision tables.