國立高雄大學圖資館 |

Language: English

Back

Computation treesa generalization of decision trees /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Computation treesby Mikhail Moshkov.
Reminder of title:	a generalization of decision trees /
Author:	Moshkov, Mikhail.
Published:	Cham :Springer Nature Switzerland :2025.
Description:	xii, 165 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Decision trees.
Online resource:	https://doi.org/10.1007/978-3-031-91748-6
ISBN:	9783031917486$q(electronic bk.)

Computation treesa generalization of decision trees /
Moshkov, Mikhail.

Computation treesa generalization of decision trees /[electronic resource] :by Mikhail Moshkov. - Cham :Springer Nature Switzerland :2025. - xii, 165 p. :ill., digital ;24 cm. - Intelligent systems reference library,v. 2751868-4408 ;. - Intelligent systems reference library ;v.24..

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.

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.

ISBN: 9783031917486$q(electronic bk.)

Standard No.: 10.1007/978-3-031-91748-6doiSubjects--Topical Terms:

280975
Decision trees.

LC Class. No.: QA166

Dewey Class. No.: 511.65

Computation treesa generalization of decision trees /
LDR:02397nmm a2200337 a 4500 001 685966
003 DE-He213
005 20250819130301.0
006 m d
007 cr nn 008maaau
008 260209s2025 sz s 0 eng d
020 $a 9783031917486$q(electronic bk.)
020 $a 9783031917479$q(paper)
024 7 $a 10.1007/978-3-031-91748-6 $2 doi
035 $a 978-3-031-91748-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 511.65 $2 23
090 $a QA166 $b .M911 2025
100 1 $a Moshkov, Mikhail. $3 522527
245 1 0 $a Computation trees $h [electronic resource] : $b a generalization of decision trees / $c by Mikhail Moshkov.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xii, 165 p. : $b ill., digital ; $c 24 cm.
490 1 $a Intelligent systems reference library, $x 1868-4408 ; $v v. 275
505 0 $a 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.
520 $a 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.
650 0 $a Decision trees. $3 280975
650 1 4 $a Computational Intelligence. $3 338479
650 2 4 $a Control and Systems Theory. $3 825946
650 2 4 $a Data Engineering. $3 839346
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Intelligent systems reference library ; $v v.24. $3 558591
856 4 0 $u https://doi.org/10.1007/978-3-031-91748-6
950 $a Intelligent Technologies and Robotics (SpringerNature-42732)