ONLY $9.90 DELIVERY INFO

Close Notification

Your cart does not contain any items

Computation Trees

A Generalization of Decision Trees

Mikhail Moshkov

$370.95   $296.98

Hardback

Not in-store but you can order this
How long will it take?

QTY:

English
Springer International Publishing AG
20 August 2025
This book is devoted to the study of deterministic and nondeterministic computation trees. Computation trees are a natural generalization of decision trees: in addition to the one-place predicate-type operations (attributes) used in decision trees, computation trees can use multi-place predicate and function operations. They arise both where we deal with algorithms for solving problems of combinatorial optimization, computational geometry, etc., and where we solve classification or prediction problems, especially if we use combinations of input variables as attributes. This book mainly studies the complexity of computation trees and also examines related optimization problems. The results discussed in this book may be useful to researchers studying algorithms and using algorithm models similar to computation trees. These results may also be useful to researchers working with decision trees and decision rule systems in data analysis, particularly, in rough set theory, logical analysis of data, and test theory. The book is also used to create graduate courses.
By:  
Imprint:   Springer International Publishing AG
Country of Publication:   Switzerland
Volume:   275
Dimensions:   Height: 235mm,  Width: 155mm, 
ISBN:   9783031917479
ISBN 10:   3031917472
Series:   Intelligent Systems Reference Library
Pages:   165
Publication Date:  
Audience:   Professional and scholarly ,  Undergraduate
Format:   Hardback
Publisher's Status:   Active
Introduction.- Computation Trees Over Predicate Structures. Local Approach.- Computation Trees Over Predicate Structures. Global Approach.- Rough Analysis of Computation Trees.- Algorithmic Problems for Computation Trees.- Programs Versus Finite Tree-Programs.

See Also