Some Bounds On Minimal Decision Tree Depth

Authors:
Mikhail Moshkov
Affiliations:
(Most part of this work was done when the author visited the Inst. of Math. at Warsaw Univ., also supp by Russian Fdn. for Fund. Res. (grant # 93-01-00488). The travel to RSKD'93 was supp. by ...
Venue:
Fundamenta Informaticae
Year:
1996

Citing 3
Cited 0

Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory

Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Decision Trees for Decision Tables

RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate decision trees for decision tables. We present upper and lower bounds on the minimal decision tree depth. Some bounds are expressed by parameters of decision rule systems constructed for decision tables.