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.
Original language | English (US) |
---|---|
Title of host publication | Rough Sets and Current Trends in Computing - 1st International Conference, RSCTC 1998, Proceedings |
Editors | Lech Polkowski, Andrzej Skowron |
Publisher | Springer Verlag |
Pages | 499-505 |
Number of pages | 7 |
ISBN (Print) | 3540646558, 9783540646556 |
DOIs | |
State | Published - 1998 |
Externally published | Yes |
Event | 1st International Conference on Rough Sets and Current Trends in Computing, RSCTC 1998 - Warsaw, Poland Duration: Jun 22 1998 → Jun 26 1998 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 1424 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Other
Other | 1st International Conference on Rough Sets and Current Trends in Computing, RSCTC 1998 |
---|---|
Country/Territory | Poland |
City | Warsaw |
Period | 06/22/98 → 06/26/98 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1998.
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science