Length and Coverage of Inhibitory Decision Rules

Fawaz Alsolami; Igor Chikalov; Mikhail Moshkov; Beata Marta Zielosko

doi:10.1007/978-3-642-34707-8_33

Back

Length and Coverage of Inhibitory Decision Rules

Conference proceeding

Peer reviewed

Length and Coverage of Inhibitory Decision Rules

Fawaz Alsolami, Igor Chikalov, Mikhail Moshkov and Beata Marta Zielosko

COMPUTATIONAL COLLECTIVE INTELLIGENCE - TECHNOLOGIES AND APPLICATIONS, PT II, Vol.7654(2), pp.325-334

Lecture Notes in Computer Science

01/01/2012

DOI: https://doi.org/10.1007/978-3-642-34707-8_33

Abstract

Computer Science

Computer Science, Artificial Intelligence

Computer Science, Theory & Methods

Science & Technology

Technology

Authors present algorithms for optimization of inhibitory rules relative to the length and coverage. Inhibitory rules have a relation "attribute not equal 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.

Metrics

1 Record Views

Details

Title: Length and Coverage of Inhibitory Decision Rules
Creators - without role: Fawaz Alsolami - King Abdullah University of Science and Technology
Igor Chikalov - King Abdullah University of Science and Technology
Mikhail Moshkov - King Abdullah University of Science and Technology
Beata Marta Zielosko - University of Silesia
Contributors - without role: N T Nguyen
K Hoang
P Jedrzejowicz
Publication Details: COMPUTATIONAL COLLECTIVE INTELLIGENCE - TECHNOLOGIES AND APPLICATIONS, PT II, Vol.7654(2), pp.325-334
Series: Lecture Notes in Computer Science
Publisher: Springer Nature
Number of pages: 10
Identifiers: 9937915508331
Academic Unit: King Abdulaziz University; King Abdullah University of Science & Technology
Language: English
Resource Type: Conference proceeding