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.

Decision trees have become one of the most powerful and popular approaches in knowledge discovery and data mining; it is the science of exploring large and complex bodies of data in order to discover useful patterns. Decision tree learning continues to evolve over time. Existing methods are constantly being improved and new methods introduced.This 2nd Edition is dedicated entirely to the field of decision trees in data mining; to cover all aspects of this important technique, as well as improved or new methods and techniques developed after the publication of our first edition. In this new edition, all chapters have been revised and new topics brought in. New topics include Cost-Sensitive Active Learning, Learning with Uncertain and Imbalanced Data, Using Decision Trees beyond Classification Tasks, Privacy Preserving Decision Tree Learning, Lessons Learned from Comparative Studies, and Learning Decision Trees for Big Data. A walk-through guide to existing open-source data mining software is also included in this edition.This book invites readers to explore the many benefits in data mining that decision trees offer:

To-date computers are supposed to store and exploit knowledge. At least that is one of the aims of research fields such as Artificial Intelligence and Information Systems. However, the problem is to understand what knowledge means, to find ways of representing knowledge, and to specify automated machineries that can extract useful information from stored knowledge. Knowledge is something people have in their mind, and which they can express through natural language. Knowl edge is acquired not only from books, but also from observations made during experiments; in other words, from data. Changing data into knowledge is not a straightforward task. A set of data is generally disorganized, contains useless details, although it can be incomplete. Knowledge is just the opposite: organized (e.g. laying bare dependencies, or classifications), but expressed by means of a poorer language, i.e. pervaded by imprecision or even vagueness, and assuming a level of granularity. One may say that knowledge is summarized and organized data - at least the kind of knowledge that computers can store.

Why do people in a certain group behave the way they do? And, more importantly, what specific criteria was used by the group in question? This book presents a method for answering these questions.

Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects. This book develops extensions of dynamic programming, enabling us to (i) describe the set of objects under consideration; (ii) perform a multi-stage optimization of objects relative to different criteria; (iii) count the number of optimal objects; (iv) find the set of Pareto optimal points for bi-criteria optimization problems; and (v) to study relationships between two criteria. It considers various applications, including optimization of decision trees and decision rule systems as algorithms for problem solving, as ways for knowledge representation, and as classifiers; optimization of element partition trees for rectangular meshes, which are used in finite element methods for solving PDEs; and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths. The results presented are useful for researchers in combinatorial optimization, data mining, knowledge discovery, machine learning, and finite element methods, especially those working in rough set theory, test theory, logical analysis of data, and PDE solvers. This book can be used as the basis for graduate courses.

The results presented here (including the assessment of a new tool – inhibitory trees) offer valuable tools for researchers in the areas of data mining, knowledge discovery, and machine learning, especially those whose work involves decision tables with many-valued decisions. The authors consider various examples of problems and corresponding decision tables with many-valued decisions, discuss the difference between decision and inhibitory trees and rules, and develop tools for their analysis and design. Applications include the study of totally optimal (optimal in relation to a number of criteria simultaneously) decision and inhibitory trees and rules; the comparison of greedy heuristics for tree and rule construction as single-criterion and bi-criteria optimization algorithms; and the development of a restricted multi-pruning approach used in classification and knowledge representation.

The Handbook of Methodological Approaches to Community-Based Research is intended to aid the community-oriented researcher in learning about and applying cutting-edge quantitative, qualitative, and mixed methods approaches.

The area of smart homes is fast developing as an emergent area which attracts the synergy of several areas of science. This volume offers a collection of contributions addressing how artificial intelligence (AI), one of the core areas of computer science, can bring the growing area of smart homes to a higher level of functionality where homes can truly realize the long standing dream of proactively helping their inhabitants in an intelligent way. After an introductory section to describe a smart home scenario and to provide some basic terminology, the following 9 sections turn special attention to a particular exemplar application scenario (provision of healthcare and safety related services to increase the quality of life) exploring the application of specific areas of AI to this scenario.

Introduces machine learning and its algorithmic paradigms, explaining the principles behind automated learning approaches and the considerations underlying their usage.

A practical guide for therapeutic decision-making. The Drama Therapy Decision Tree unites therapy interventions with diagnostic information, individual and group processes, psychological distance, the drama therapy pie, and global outcomes. Rather than using a standardized protocol that makes the decisions for the therapist, drama therapy is based on dynamic, embodied, creative action with participants in the here and now. Conscious planning on the part of the drama therapist before the session supports spontaneity and creativity, preparing them to make good therapeutic decisions in the moment during the session. The authors strive to provide a common language for communicating what drama therapists do and how they do it in order to demystify drama therapy for other mental health and medical professionals. Using the decision tree as a guide, early career drama therapists can move forward confidently and ground their work with participants in an integrated system.