Optimization of inhibitory decision rules relative to length and coverage

Authors:
Fawaz Alsolami;Igor Chikalov;Mikhail Moshkov;Beata Zielosko
Affiliations:
Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia;Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia;Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia;Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia,Institute of Computer Science, University of Silesia, Sosnow ...
Venue:
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Year:
2012

Citing 4
Cited 2

Inhibitory Rules in Data Analysis: A Rough Set Approach

Inhibitory Rules in Data Analysis: A Rough Set Approach
Two Families of Classification Algorithms

RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Comparison of lazy classification algorithms based on deterministic and inhibitory decision rules

RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Dynamic programming approach to optimization of approximate decision rules

Information Sciences: an International Journal

Length and coverage of inhibitory decision rules

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
Classifiers Based on Optimal Decision Rules

Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday

Quantified Score

Hi-index	0.00

Visualization

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.