Beata Zielosko – författare

In this book, the concept of a hypothesis about the values of all attributes is added to the standard decision tree model, considered, in particular, in test theory and rough set theory. This extension allows us to use the analog of equivalence queries from exact learning and explore decision trees that are based on various combinations of attributes, hypotheses, and proper hypotheses (analog of proper equivalence queries). The two main goals of this book are (i) to provide tools for the experimental and theoretical study of decision trees with hypotheses and (ii) to compare these decision trees with conventional decision trees that use only queries, each based on a single attribute. 

Both experimental and theoretical results show that decision trees with hypotheses can have less complexity than conventional decision trees. These results open up some prospects for using decision trees with hypotheses as a means of knowledge representation and algorithms for computing Boolean functions. The obtained theoretical results and tools for studying decision trees with hypotheses are useful for researchers using decision trees and rules in data analysis. This book can also be used as the basis for graduate courses.

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).

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 2017encompasses 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).

Decision trees and decision rule systems are widely used in different applications

as algorithms for problem solving, as predictors, and as a way for

knowledge representation. Reducts play key role in the problem of attribute

(feature) selection. The aims of this book are (i) the consideration of the sets

of decision trees, rules and reducts; (ii) study of relationships among these

objects; (iii) design of algorithms for construction of trees, rules and reducts;

and (iv) obtaining bounds on their complexity. Applications for supervised

machine learning, discrete optimization, analysis of acyclic programs, fault

diagnosis, and pattern recognition are considered also. This is a mixture of

research monograph and lecture notes. It contains many unpublished results.

However, proofs are carefully selected to be understandable for students.

The results considered in this book can be useful for researchers in machine

learning, data mining and knowledge discovery, especially for those who are

working in rough set theory, test theory and logical analysis of data. The book

can be used in the creation of courses for graduate students.

In this book, the following three approaches to data analysis are presented:

 - Test Theory, founded by Sergei V. Yablonskii (1924-1998); the first publications appeared in 1955 and 1958,

-           Rough Sets, founded by Zdzisław I. Pawlak (1926-2006); the first publications appeared in 1981 and 1982,

-           Logical Analysis of Data, founded by Peter L. Hammer (1936-2006); the first publications appeared in 1986 and 1988.

These three approaches have much in common, but researchers active in one of these areas often have a limited knowledge about the results and methods developed in the other two. On the other hand, each of the approaches shows some originality and we believe that the exchange of knowledge can stimulate further development of each of them. This can lead to new theoretical results and real-life applications and, in particular, new results based on combination of these three data analysis approaches can be expected.

-           Logical Analysis of Data, founded by Peter L. Hammer (1936-2006); the firstpublications appeared in 1986 and 1988.

These three approaches have much in common, but researchers active in one of these areas often have a limited knowledge about the results and methods developed in the other two. On the other hand, each of the approaches shows some originality and we believe that the exchange of knowledge can stimulate further development of each of them. This can lead to new theoretical results and real-life applications and, in particular, new results based on combination of these three data analysis approaches can be expected.

These three approaches have much in common, but researchers active in one of these areas often have a limited knowledge about the results and methods developed in the other two. On the other hand, each of the approaches shows some originality and we believe that the exchange of knowledge can stimulate further development of each of them. This can lead to new theoretical results and real-life applications and, in particular, new results based on combination of these three data analysis approaches can be expected.