Abstract
Authors present algorithms for optimization of inhibitory rules relative to the length and coverage. Inhibitory rules have a relation "attribute ≠ value" on the right-hand side. The considered algorithms are based on extensions of dynamic programming. Paper contains also comparison of length and coverage of inhibitory rules constructed by a greedy algorithm and by the dynamic programming algorithm. © 2012 Springer-Verlag.
Original language | English (US) |
---|---|
Title of host publication | Computational Collective Intelligence. Technologies and Applications |
Publisher | Springer Nature |
Pages | 325-334 |
Number of pages | 10 |
ISBN (Print) | 9783642347061 |
DOIs | |
State | Published - 2012 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science