This book presents a study in knowledge discovery in data with knowledge understood as a set of relations among objects and their properties. Relations in this case are implicative decision rules and the paradigm in which they are induced is that of computing with granules defined by rough inclusions, the latter introduced and studied within rough mereology, the fuzzified version of mereology. In this book basic classes of rough inclusions are defined and based on them methods for inducing granular structures from data are highlighted. The resulting granular structures are subjected to classifying algorithms, notably k—nearest neighbors and bayesian classifiers. Experimental results are given in detail both in tabular and visualized form for fourteen data sets from UCI data repository. A striking feature of granular classifiers obtained by this approach is that preserving the accuracy of them on original data, they reduce substantially the size of the granulated data set as well as the set of granular decision rules. This feature makes the presented approach attractive in cases where a small number of rules providing a high classification accuracy is desirable. As basic algorithms used throughout the text are explained and illustrated with hand examples, the book may also serve as a textbook.

This book presents a study in knowledge discovery in data with knowledge understood as a set of relations among objects and their properties. Relations in this case are implicative decision rules and the paradigm in which they are induced is that of computing with granules defined by rough inclusions, the latter introduced and studied within rough mereology, the fuzzified version of mereology. In this book basic classes of rough inclusions are defined and based on them methods for inducing granular structures from data are highlighted. The resulting granular structures are subjected to classifying algorithms, notably k-nearest neighbors and bayesian classifiers. Experimental results are given in detail both in tabular and visualized form for fourteen data sets from UCI data repository. A striking feature of granular classifiers obtained by this approach is that preserving the accuracy of them on original data, they reduce substantially the size of the granulated data set as well as the set of granular decision rules. This feature makes the presented approach attractive in cases where a small number of rules providing a high classification accuracy is desirable. As basic algorithms used throughout the text are explained and illustrated with hand examples, the book may also serve as a textbook.

This two-volume set LNAI 10313 and LNAI 10314 constitutes the proceedings of the International Joint Conference on Rough Sets, IJCRS 2017, held in Olsztyn, Poland, in July 2017. The 74 revised full papers presented together with 16 short papers and 16 invited talks, were carefully reviewed and selected from 130 submissions. The papers in this two set-volume of IJCRS 2017 follow the track already rutted by RSCTC and JRS conferences which aimed at unification of many facets of rough set theory from theoretical aspects of the rough set idea bordering on theory of concepts and going through algebraic structures, topological structures, logics for uncertain reasoning, decision algorithms, relations to other theories of vagueness and ambiguity, then to extensions of the rough set idea like granular structures, rough mereology, and to applications of the idea in diverse fields of applied science including hybrid methods like rough-fuzzy, neuro-rough, neuro-rough-fuzzy computing. IJCRS 2017 encompasses topics spread among four main tracks: Rough Sets and Data Science (in relation to RSCTC series organized since 1998); Rough Sets and Granular Computing (in relation to RSFDGrC series organized since 1999); Rough Sets and Knowledge Technology (in relation to RSKT series organized since 2006); and Rough Sets and Intelligent Systems (in relation to RSEISP series organized since 2007).

This two-volume set LNAI 10313 and LNAI 10314 constitutes the proceedings of the International Joint Conference on Rough Sets, IJCRS 2017, held in Olsztyn, Poland, in July 2017. The 74 revised full papers presented together with 16 short papers and 16 invited talks, were carefully reviewed and selected from 130 submissions. The papers in this two set-volume of IJCRS 2017 follow the track already rutted by RSCTC and JRS conferences which aimed at unification of many facets of rough set theory from theoretical aspects of the rough set idea bordering on theory of concepts and going through algebraic structures, topological structures, logics for uncertain reasoning, decision algorithms, relations to other theories of vagueness and ambiguity, then to extensions of the rough set idea like granular structures, rough mereology, and to applications of the idea in diverse fields of applied science including hybrid methods like rough-fuzzy, neuro-rough, neuro-rough-fuzzy computing. IJCRS 2017 encompasses topics spread among four main tracks: Rough Sets and Data Science (in relation to RSCTC series organized since 1998); Rough Sets and Granular Computing (in relation to RSFDGrC series organized since 1999); Rough Sets and Knowledge Technology (in relation to RSKT series organized since 2006); and Rough Sets and Intelligent Systems (in relation to RSEISP series organized since 2007).