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) |
|---|---|
| Pages (from-to) | 87-96 |
| Number of pages | 10 |
| Journal | Fundamenta Informaticae |
| Volume | 61 |
| Issue number | 2 |
| State | Published - Jun 2004 |
| Externally published | Yes |
Keywords
- Complexity measures
- Decision trees
- Optimization
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Algebra and Number Theory
- Computational Theory and Mathematics