Abstract
In the paper, authors presents a greedy algorithm for construction of exact and partial decision rules for decision tables with many-valued decisions. Exact decision rules can be 'over-fitted', so instead of exact decision rules with many attributes, it is more appropriate to work with partial decision rules with smaller number of attributes. Based on results for set cover problem authors study bounds on accuracy of greedy algorithm for exact and partial decision rule construction, and complexity of the problem of minimization of decision rule length. © 2011 Springer-Verlag.
Original language | English (US) |
---|---|
Title of host publication | Rough Sets and Knowledge Technology |
Publisher | Springer Nature |
Pages | 763-768 |
Number of pages | 6 |
ISBN (Print) | 9783642244247 |
DOIs | |
State | Published - 2011 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science