語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Decision Trees with Hypotheses
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
正題名/作者:
Decision Trees with Hypotheses/ by Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov, Beata Zielosko.
作者:
Azad, Mohammad.
其他作者:
Zielosko, Beata.
面頁冊數:
XI, 145 p. 9 illus.online resource. :
Contained By:
Springer Nature eBook
標題:
Operations Research and Decision Theory. -
電子資源:
https://doi.org/10.1007/978-3-031-08585-7
ISBN:
9783031085857
Decision Trees with Hypotheses
Azad, Mohammad.
Decision Trees with Hypotheses
[electronic resource] /by Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov, Beata Zielosko. - 1st ed. 2022. - XI, 145 p. 9 illus.online resource. - Synthesis Lectures on Intelligent Technologies,2731-6920. - Synthesis Lectures on Intelligent Technologies,.
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.
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.
ISBN: 9783031085857
Standard No.: 10.1007/978-3-031-08585-7doiSubjects--Topical Terms:
1366301
Operations Research and Decision Theory.
LC Class. No.: Q342
Dewey Class. No.: 006.3
Decision Trees with Hypotheses
LDR
:03125nam a22003855i 4500
001
1085639
003
DE-He213
005
20221118100101.0
007
cr nn 008mamaa
008
221228s2022 sz | s |||| 0|eng d
020
$a
9783031085857
$9
978-3-031-08585-7
024
7
$a
10.1007/978-3-031-08585-7
$2
doi
035
$a
978-3-031-08585-7
050
4
$a
Q342
072
7
$a
UYQ
$2
bicssc
072
7
$a
TEC009000
$2
bisacsh
072
7
$a
UYQ
$2
thema
082
0 4
$a
006.3
$2
23
100
1
$a
Azad, Mohammad.
$e
author.
$4
aut
$4
http://id.loc.gov/vocabulary/relators/aut
$3
1325961
245
1 0
$a
Decision Trees with Hypotheses
$h
[electronic resource] /
$c
by Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov, Beata Zielosko.
250
$a
1st ed. 2022.
264
1
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2022.
300
$a
XI, 145 p. 9 illus.
$b
online resource.
336
$a
text
$b
txt
$2
rdacontent
337
$a
computer
$b
c
$2
rdamedia
338
$a
online resource
$b
cr
$2
rdacarrier
347
$a
text file
$b
PDF
$2
rda
490
1
$a
Synthesis Lectures on Intelligent Technologies,
$x
2731-6920
505
0
$a
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.
520
$a
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.
650
2 4
$a
Operations Research and Decision Theory.
$3
1366301
650
1 4
$a
Computational Intelligence.
$3
768837
650
0
$a
Operations research.
$3
573517
650
0
$a
Computational intelligence.
$3
568984
700
1
$a
Zielosko, Beata.
$4
aut
$4
http://id.loc.gov/vocabulary/relators/aut
$3
682885
700
1
$a
Moshkov, Mikhail.
$4
aut
$4
http://id.loc.gov/vocabulary/relators/aut
$3
786416
700
1
$a
Hussain, Shahid.
$e
author.
$4
aut
$4
http://id.loc.gov/vocabulary/relators/aut
$3
1310666
700
1
$a
Chikalov, Igor.
$4
aut
$4
http://id.loc.gov/vocabulary/relators/aut
$3
796415
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer Nature eBook
776
0 8
$i
Printed edition:
$z
9783031085840
776
0 8
$i
Printed edition:
$z
9783031085864
776
0 8
$i
Printed edition:
$z
9783031085871
830
0
$a
Synthesis Lectures on Intelligent Technologies,
$x
2731-6920
$3
1392182
856
4 0
$u
https://doi.org/10.1007/978-3-031-08585-7
912
$a
ZDB-2-SXSC
950
$a
Synthesis Collection of Technology (R0) (SpringerNature-85007)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入