libri scuola books Fumetti ebook dvd top ten sconti 0 Carrello


Torna Indietro

moshkov mikhail - comparative analysis of deterministic and nondeterministic decision trees

Comparative Analysis of Deterministic and Nondeterministic Decision Trees




Disponibilità: Normalmente disponibile in 15 giorni


PREZZO
108,98 €
NICEPRICE
103,53 €
SCONTO
5%



Questo prodotto usufruisce delle SPEDIZIONI GRATIS
selezionando l'opzione Corriere Veloce in fase di ordine.


Pagabile anche con Carta della cultura giovani e del merito, 18App Bonus Cultura e Carta del Docente


Facebook Twitter Aggiungi commento


Spese Gratis

Dettagli

Genere:Libro
Lingua: Inglese
Editore:

Springer

Pubblicazione: 03/2021
Edizione: 1st ed. 2020





Trama

This book compares four parameters of problems in arbitrary information systems: complexity of problem representation and complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees for problem solving. Deterministic decision trees are widely used as classifiers, as a means of knowledge representation, and as algorithms. Nondeterministic (strongly nondeterministic) decision trees can be interpreted as systems of true decision rules that cover all objects (objects from one decision class).

 

This book develops tools for the study of decision trees, including bounds on complexity and algorithms for construction of decision trees for decision tables with many-valued decisions. It considers two approaches to the investigation of decision trees for problems in information systems: local, when decision trees can use only attributes from the problem representation; and global, when decision trees can use arbitrary attributes from the information system. For both approaches, it describes all possible types of relationships among the four parameters considered and discusses the algorithmic problems related to decision tree optimization. The results presented are useful for researchers who apply decision trees and rules to algorithm design and to data analysis, especially those working in rough set theory, test theory and logical analysis of data. This book can also be used as the basis for graduate courses. 





Sommario

Introduction.- Basic De?nitions and Notation.-  Lower Bounds on Complexity of Deterministic Decision Trees for Decision Tables.- Upper Bounds on Complexity and Algorithms for Construction of Deterministic Decision Trees for Decision Tables.-  Bounds on Complexity and Algorithms for Construction of Nondeterministic and Strongly Nondeterministic Decision Trees for Decision Tables.- Closed Classes of Boolean Functions.- Algorithmic Problems.- Basic De?nitions and Notation.- Main Reductions.- Functions on Main Diagonal and Below.- Local Upper Types of Restricted Sccf-Triples.- Bounds Inside Types.  










Altre Informazioni

ISBN:

9783030417307

Condizione: Nuovo
Collana: Intelligent Systems Reference Library
Dimensioni: 235 x 155 mm
Formato: Brossura
Illustration Notes:XVI, 297 p. 4 illus.
Pagine Arabe: 297
Pagine Romane: xvi


Dicono di noi