Decision Trees with Hypotheses

Author:   Mohammad Azad ,  Igor Chikalov ,  Shahid Hussain ,  Mikhail Moshkov
Publisher:   Springer International Publishing AG
Edition:   1st ed. 2022
ISBN:  

9783031085840


Pages:   145
Publication Date:   19 November 2022
Format:   Hardback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $336.35 Quantity:  
Add to Cart

Share |

Decision Trees with Hypotheses


Add your own review!

Overview

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.

Full Product Details

Author:   Mohammad Azad ,  Igor Chikalov ,  Shahid Hussain ,  Mikhail Moshkov
Publisher:   Springer International Publishing AG
Imprint:   Springer International Publishing AG
Edition:   1st ed. 2022
Weight:   0.450kg
ISBN:  

9783031085840


ISBN 10:   3031085841
Pages:   145
Publication Date:   19 November 2022
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Introduction.- Main Notions.- Dynamic Programming Algorithms for Minimization of Decision Tree Complexity.- Construction of Optimal Decision Trees and Deriving Decision Rules from Them.- Greedy Algorithms for Construction of Decision Trees with Hypotheses.- Decision Trees with Hypotheses for Recognition of Monotone Boolean Functions and for Sorting.- Infinite Binary Information Systems. Decision Trees of Types 1, 2, and 3.- Infinite Binary Information Systems. Decision Trees of Types 4 and 5.- Infinite Families of Concepts.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List