Length and coverage of inhibitory decision rules

Fawaz Alsolami, Igor Chikalov, Mikhail Moshkov, Beata Zielosko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

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 languageEnglish (US)
Title of host publicationComputational Collective Intelligence. Technologies and Applications
PublisherSpringer Nature
Pages325-334
Number of pages10
ISBN (Print)9783642347061
DOIs
StatePublished - 2012

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Length and coverage of inhibitory decision rules'. Together they form a unique fingerprint.

Cite this