Abstract
The paper is devoted to the study of algorithms for optimization of inhibitory rules relative to the length and coverage. In contrast with usual rules that have on the right-hand side a relation "attribute ≠ value", inhibitory rules have a relation "attribute = value" on the right-hand side. The considered algorithms are based on extensions of dynamic programming. © 2012 Springer-Verlag.
Original language | English (US) |
---|---|
Title of host publication | Rough Sets and Knowledge Technology |
Publisher | Springer Nature |
Pages | 149-154 |
Number of pages | 6 |
ISBN (Print) | 9783642318993 |
DOIs | |
State | Published - 2012 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science