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 Zdzislaw 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...
In this book, the following three approaches to data analysis are presented:
- Test Theory, founded by Sergei V. Yablonskii (1924-1998); th...
Decision tree is a widely used form of representing algorithms and knowledge. Compact data models and fast algorithms require optimization of tree complexity. This book is a research monograph on average time complexity of decision trees. It generalizes several known results and considers a number of new problems. The book contains exact and approximate algorithms for decision tree optimization, and bounds on minimum average time complexity of decision trees. Methods of combinatorics, probability theory and complexity theory are used in the proofs as well as concepts from various branches of...
Decision tree is a widely used form of representing algorithms and knowledge. Compact data models and fast algorithms require optimization of tree com...
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 Zdzislaw 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...
In this book, the following three approaches to data analysis are presented:
- Test Theory, founded by Sergei V. Yablonskii (1924-1998); th...
Dynamic programming is an efficient technique for solving optimization problems. and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths.
Dynamic programming is an efficient technique for solving optimization problems. and multi-stage optimization for such classic combinatorial optimizat...
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...
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, ...
