Length and coverage of inhibitory decision rules

Authors:
Fawaz Alsolami;Igor Chikalov;Mikhail Moshkov;Beata Marta 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, Sosno ...
Venue:
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
Year:
2012

Citing 6
Cited 0

Some Remarks on Extensions and Restrictions of Information Systems

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
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
Paper: Modeling by shortest data description

Automatica (Journal of IFAC)
Optimization of inhibitory decision rules relative to length and coverage

RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology

Quantified Score

Hi-index	0.00

Visualization

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.