東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Computation trees = a generalization of decision trees /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Computation trees/ by Mikhail Moshkov.
其他題名:	a generalization of decision trees /
作者:	Moshkov, Mikhail.
出版者:	Cham :Springer Nature Switzerland : : 2025.,
面頁冊數:	xii, 165 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer Nature eBook
標題:	Decision trees. -
電子資源:	https://doi.org/10.1007/978-3-031-91748-6
ISBN:	9783031917486

Computation trees = a 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. 275..

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

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

827433
Decision trees.

LC Class. No.: QA166

Dewey Class. No.: 511.65

Computation trees = a generalization of decision trees /
LDR:02396nmm a2200337 a 4500 001 2414293
003 DE-He213
005 20250819130301.0
006 m d
007 cr nn 008maaau
008 260205s2025 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 3450098
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 827433
650 1 4 $a Computational Intelligence. $3 1001631
650 2 4 $a Control and Systems Theory. $3 3381515
650 2 4 $a Data Engineering. $3 3409361
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Intelligent systems reference library ; $v v. 275. $3 3790904
856 4 0 $u https://doi.org/10.1007/978-3-031-91748-6
950 $a Intelligent Technologies and Robotics (SpringerNature-42732)