Abstract
In the paper algorithms are considered which allow to optimize decision trees consecutively againsts relatively different criterions. For decision tables over an arbitrary infinite restricted information system, these algorithms have polynomial time complexity.
Original language | English (US) |
---|---|
Title of host publication | Fundamenta Informaticae |
Pages | 87-96 |
Number of pages | 10 |
State | Published - Jun 1 2004 |
Externally published | Yes |
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Algebra and Number Theory
- Theoretical Computer Science
- Information Systems