Abstract
In the paper for the most part of binary decision tables upper and lower bounds on the cardinality of partial reducts and length of irreducible partial decision rules are obtained. The number of partial reducts and the number of irreducible partial decision rules are evaluated. Complexity of algorithms for construction of all partial reducts and all irreducible partial decision rules is studied on the basis of obtained bounds.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 357-374 |
| Number of pages | 18 |
| Journal | Fundamenta Informaticae |
| Volume | 75 |
| Issue number | 1-4 |
| State | Published - 2007 |
| Externally published | Yes |
Keywords
- Algorithms for construction
- Complexity
- Irreducible partial decision rules
- Partial reducts
ASJC Scopus subject areas
- Theoretical Computer Science
- Algebra and Number Theory
- Information Systems
- Computational Theory and Mathematics