β Scribed by Pawel Delimata, Mikhail Ju. Moshkov, Andrzej Skowron, Zbigniew Suraj (auth.)
No coin nor oath required. For personal study only.
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.
Front Matter....Pages -
Introduction....Pages 1-8
Maximal Consistent Extensions of Information Systems....Pages 9-29
Minimal Inhibitory Association Rules for Almost All k -Valued Information Systems....Pages 31-41
Partial Covers and Inhibitory Decision Rules....Pages 43-62
Partial Covers and Inhibitory Decision Rules with Weights....Pages 63-79
Classifiers Based on Deterministic and Inhibitory Decision Rules....Pages 81-86
Lazy Classification Algorithms Based on Deterministic and Inhibitory Association Rules....Pages 87-97
Lazy Classification Algorithms Based on Deterministic and Inhibitory Decision Rules....Pages 99-106
Final Remarks....Pages 107-108
Back Matter....Pages -
Appl.Mathematics/Computational Methods of Engineering; Artificial Intelligence (incl. Robotics)
π SIMILAR VOLUMES
<p><P>Along the years, rough set theory has earned a well-deserved reputation as a sound methodology for dealing with imperfect knowledge in a simple though mathematically sound way. This edited volume aims at continue stressing the benefits of applying rough sets in many real-life situations while
<p><P>Along the years, rough set theory has earned a well-deserved reputation as a sound methodology for dealing with imperfect knowledge in a simple though mathematically sound way. This edited volume aims at continue stressing the benefits of applying rough sets in many real-life situations while
<p><p>In this book, the following three approaches to data analysis are presented:</p><p> - Test Theory, founded by Sergei V. Yablonskii (1924-1998); the first publications appeared in 1955 and 1958,</p><p>- Rough Sets, founded by ZdzisΕaw I. Pawlak (1926-2006); the first publications appeared in 19
<p><p>In this book, the following three approaches to data analysis are presented:</p><p> - Test Theory, founded by Sergei V. Yablonskii (1924-1998); the first publications appeared in 1955 and 1958,</p><p>- Rough Sets, founded by ZdzisΕaw I. Pawlak (1926-2006); the first publications appeared in 19