Some Relationships between Decision Trees and Decision Rule Systems

Authors:
Mikhail Moshkov
Affiliations:
-
Venue:
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Year:
1998

Citing 2
Cited 1

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Learning Problem-Oriented Decision Structures from Decision Rule: The AQDT-2 System

ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems

Time complexity of decision trees

Transactions on Rough Sets III

Quantified Score

Hi-index	0.00

Visualization

Abstract

Relationships between parameters of a decision rule system and the minimal depth of a decision tree which solves the problem of the search of all realizable rules from the system are considered. Unimprovable upper and close to unimprovable lower bounds on the minimal depth of a decision tree are obtained.