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.
|Original language||English (US)|
|Title of host publication||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Number of pages||7|
|State||Published - Jan 1 1998|