語系:
繁體中文
English
日文
簡体中文
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Automatic design of decision-tree In...
~
Barros, Rodrigo C.
Automatic design of decision-tree Induction algorithms[electronic resource] /
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
杜威分類號:
005.1
書名/作者:
Automatic design of decision-tree Induction algorithms/ by Rodrigo C. Barros, Andre C.P.L.F de Carvalho, Alex A. Freitas.
作者:
Barros, Rodrigo C.
其他作者:
Carvalho, Andre C.P.L.F. de.
出版者:
Cham : : Springer International Publishing :, 2015.
面頁冊數:
xii, 176 p. : : ill., digital ;; 24 cm.
Contained By:
Springer eBooks
標題:
Computer algorithms.
標題:
Decision trees.
標題:
Computer Science.
標題:
Data Mining and Knowledge Discovery.
標題:
Pattern Recognition.
ISBN:
9783319142319 (electronic bk.)
ISBN:
9783319142302 (paper)
內容註:
Introduction -- Decision-Tree Induction -- Evolutionary Algorithms and Hyper-Heuristics -- HEAD-DT: Automatic Design of Decision-Tree Algorithms -- HEAD-DT: Experimental Analysis -- HEAD-DT: Fitness Function Analysis -- Conclusions.
摘要、提要註:
Presents a detailed study of the major design components that constitute a top-down decision-tree induction algorithm, including aspects such as split criteria, stopping criteria, pruning and the approaches for dealing with missing values. Whereas the strategy still employed nowadays is to use a 'generic' decision-tree induction algorithm regardless of the data, the authors argue on the benefits that a bias-fitting strategy could bring to decision-tree induction, in which the ultimate goal is the automatic generation of a decision-tree induction algorithm tailored to the application domain of interest. For such, they discuss how one can effectively discover the most suitable set of components of decision-tree induction algorithms to deal with a wide variety of applications through the paradigm of evolutionary computation, following the emergence of a novel field called hyper-heuristics. "Automatic Design of Decision-Tree Induction Algorithms" would be highly useful for machine learning and evolutionary computation students and researchers alike.
電子資源:
http://dx.doi.org/10.1007/978-3-319-14231-9
Automatic design of decision-tree Induction algorithms[electronic resource] /
Barros, Rodrigo C.
Automatic design of decision-tree Induction algorithms
[electronic resource] /by Rodrigo C. Barros, Andre C.P.L.F de Carvalho, Alex A. Freitas. - Cham :Springer International Publishing :2015. - xii, 176 p. :ill., digital ;24 cm. - SpringerBriefs in computer science,2191-5768. - SpringerBriefs in computer science..
Introduction -- Decision-Tree Induction -- Evolutionary Algorithms and Hyper-Heuristics -- HEAD-DT: Automatic Design of Decision-Tree Algorithms -- HEAD-DT: Experimental Analysis -- HEAD-DT: Fitness Function Analysis -- Conclusions.
Presents a detailed study of the major design components that constitute a top-down decision-tree induction algorithm, including aspects such as split criteria, stopping criteria, pruning and the approaches for dealing with missing values. Whereas the strategy still employed nowadays is to use a 'generic' decision-tree induction algorithm regardless of the data, the authors argue on the benefits that a bias-fitting strategy could bring to decision-tree induction, in which the ultimate goal is the automatic generation of a decision-tree induction algorithm tailored to the application domain of interest. For such, they discuss how one can effectively discover the most suitable set of components of decision-tree induction algorithms to deal with a wide variety of applications through the paradigm of evolutionary computation, following the emergence of a novel field called hyper-heuristics. "Automatic Design of Decision-Tree Induction Algorithms" would be highly useful for machine learning and evolutionary computation students and researchers alike.
ISBN: 9783319142319 (electronic bk.)
Standard No.: 10.1007/978-3-319-14231-9doiSubjects--Topical Terms:
179921
Computer algorithms.
LC Class. No.: QA76.9.A43
Dewey Class. No.: 005.1
Automatic design of decision-tree Induction algorithms[electronic resource] /
LDR
:02359nam a2200337 a 4500
001
426603
003
DE-He213
005
20150915151210.0
006
m d
007
cr nn 008maaau
008
151119s2015 gw s 0 eng d
020
$a
9783319142319 (electronic bk.)
020
$a
9783319142302 (paper)
024
7
$a
10.1007/978-3-319-14231-9
$2
doi
035
$a
978-3-319-14231-9
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA76.9.A43
072
7
$a
UNF
$2
bicssc
072
7
$a
UYQE
$2
bicssc
072
7
$a
COM021030
$2
bisacsh
082
0 4
$a
005.1
$2
23
090
$a
QA76.9.A43
$b
B277 2015
100
1
$a
Barros, Rodrigo C.
$3
606830
245
1 0
$a
Automatic design of decision-tree Induction algorithms
$h
[electronic resource] /
$c
by Rodrigo C. Barros, Andre C.P.L.F de Carvalho, Alex A. Freitas.
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2015.
300
$a
xii, 176 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
SpringerBriefs in computer science,
$x
2191-5768
505
0
$a
Introduction -- Decision-Tree Induction -- Evolutionary Algorithms and Hyper-Heuristics -- HEAD-DT: Automatic Design of Decision-Tree Algorithms -- HEAD-DT: Experimental Analysis -- HEAD-DT: Fitness Function Analysis -- Conclusions.
520
$a
Presents a detailed study of the major design components that constitute a top-down decision-tree induction algorithm, including aspects such as split criteria, stopping criteria, pruning and the approaches for dealing with missing values. Whereas the strategy still employed nowadays is to use a 'generic' decision-tree induction algorithm regardless of the data, the authors argue on the benefits that a bias-fitting strategy could bring to decision-tree induction, in which the ultimate goal is the automatic generation of a decision-tree induction algorithm tailored to the application domain of interest. For such, they discuss how one can effectively discover the most suitable set of components of decision-tree induction algorithms to deal with a wide variety of applications through the paradigm of evolutionary computation, following the emergence of a novel field called hyper-heuristics. "Automatic Design of Decision-Tree Induction Algorithms" would be highly useful for machine learning and evolutionary computation students and researchers alike.
650
0
$a
Computer algorithms.
$3
179921
650
0
$a
Decision trees.
$3
606833
650
1 4
$a
Computer Science.
$3
423143
650
2 4
$a
Data Mining and Knowledge Discovery.
$3
464541
650
2 4
$a
Pattern Recognition.
$3
463916
700
1
$a
Carvalho, Andre C.P.L.F. de.
$3
606831
700
1
$a
Freitas, Alex A.
$3
606832
710
2
$a
SpringerLink (Online service)
$3
463450
773
0
$t
Springer eBooks
830
0
$a
SpringerBriefs in computer science.
$3
466946
856
4 0
$u
http://dx.doi.org/10.1007/978-3-319-14231-9
950
$a
Computer Science (Springer-11645)
筆 0 讀者評論
多媒體
多媒體檔案
http://dx.doi.org/10.1007/978-3-319-14231-9
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入