Inhibitory Rules in Data Analysis

This monograph is devoted to theoretical and experimental study of inhibitory decision and association rules. Inhibitory rules contain on the right-hand side a relation of the kind "attribut does not equal value". The use of inhibitory rules instead of deterministic (standard) ones allows us to describe more completely information encoded in decision or information systems and to design classifiers of high quality.

The most important feature of this monograph is that it includes an advanced mathematical analysis of problems on inhibitory rules. We consider algorithms for construction of inhibitory rules, bounds on minimal complexity of inhibitory rules, and algorithms for construction of the set of all minimal inhibitory rules.We also discuss results of experiments with standard and lazy classifiers based on inhibitory rules. These results show that inhibitory decision and association rules can be used in data mining and knowledge discovery both for knowledge representation and for prediction. Inhibitory rules can be also used under the analysis and design of concurrent systems.

The results obtained in the monograph can be useful for researchers in such areas as machine learning, data mining and knowledge discovery, especially for those who are working in rough set theory, test theory, and logical analysis of data (LAD). The monograph can be used under the creation of courses for graduate students and for Ph.D. studies.

Contenu

Maximal Consistent Extensions of Information Systems.- Minimal Inhibitory Association Rules for Almost All k-Valued Information Systems.- Partial Covers and Inhibitory Decision Rules.- Partial Covers and Inhibitory Decision Rules with Weights.- Classifiers Based on Deterministic and Inhibitory Decision Rules.- Lazy Classification Algorithms Based on Deterministic and Inhibitory Association Rules.- Lazy Classification Algorithms Based on Deterministic and Inhibitory Decision Rules.- Final Remarks.