語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Evolutionary decision trees in large...
~
Kretowski, Marek.
FindBook
Google Book
Amazon
博客來
Evolutionary decision trees in large-scale data mining
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Evolutionary decision trees in large-scale data mining/ by Marek Kretowski.
作者:
Kretowski, Marek.
出版者:
Cham :Springer International Publishing : : 2019.,
面頁冊數:
xi, 180 p. :ill., digital ;24 cm.
內容註:
Evolutionary computation -- Decision trees in data mining -- Parallel and distributed computation -- Global induction of univariate trees -- Oblique and mixed decision trees -- Cost-sensitive tree induction -- Multi-test decision trees for gene expression data -- Parallel computations for evolutionary induction.
Contained By:
Springer eBooks
標題:
Data mining. -
電子資源:
https://doi.org/10.1007/978-3-030-21851-5
ISBN:
9783030218515
Evolutionary decision trees in large-scale data mining
Kretowski, Marek.
Evolutionary decision trees in large-scale data mining
[electronic resource] /by Marek Kretowski. - Cham :Springer International Publishing :2019. - xi, 180 p. :ill., digital ;24 cm. - Studies in big data,v.592197-6503 ;. - Studies in big data ;v.59..
Evolutionary computation -- Decision trees in data mining -- Parallel and distributed computation -- Global induction of univariate trees -- Oblique and mixed decision trees -- Cost-sensitive tree induction -- Multi-test decision trees for gene expression data -- Parallel computations for evolutionary induction.
This book presents a unified framework, based on specialized evolutionary algorithms, for the global induction of various types of classification and regression trees from data. The resulting univariate or oblique trees are significantly smaller than those produced by standard top-down methods, an aspect that is critical for the interpretation of mined patterns by domain analysts. The approach presented here is extremely flexible and can easily be adapted to specific data mining applications, e.g. cost-sensitive model trees for financial data or multi-test trees for gene expression data. The global induction can be efficiently applied to large-scale data without the need for extraordinary resources. With a simple GPU-based acceleration, datasets composed of millions of instances can be mined in minutes. In the event that the size of the datasets makes the fastest memory computing impossible, the Spark-based implementation on computer clusters, which offers impressive fault tolerance and scalability potential, can be applied.
ISBN: 9783030218515
Standard No.: 10.1007/978-3-030-21851-5doiSubjects--Topical Terms:
562972
Data mining.
LC Class. No.: QA76.9.D343 / K74 2019
Dewey Class. No.: 006.312
Evolutionary decision trees in large-scale data mining
LDR
:02421nmm a2200349 a 4500
001
2192189
003
DE-He213
005
20190616021234.0
006
m d
007
cr nn 008maaau
008
200506s2019 gw s 0 eng d
020
$a
9783030218515
$q
(electronic bk.)
020
$a
9783030218508
$q
(paper)
024
7
$a
10.1007/978-3-030-21851-5
$2
doi
035
$a
978-3-030-21851-5
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA76.9.D343
$b
K74 2019
072
7
$a
UN
$2
bicssc
072
7
$a
COM018000
$2
bisacsh
072
7
$a
UN
$2
thema
072
7
$a
TB
$2
thema
082
0 4
$a
006.312
$2
23
090
$a
QA76.9.D343
$b
K92 2019
100
1
$a
Kretowski, Marek.
$3
3412280
245
1 0
$a
Evolutionary decision trees in large-scale data mining
$h
[electronic resource] /
$c
by Marek Kretowski.
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2019.
300
$a
xi, 180 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Studies in big data,
$x
2197-6503 ;
$v
v.59
505
0
$a
Evolutionary computation -- Decision trees in data mining -- Parallel and distributed computation -- Global induction of univariate trees -- Oblique and mixed decision trees -- Cost-sensitive tree induction -- Multi-test decision trees for gene expression data -- Parallel computations for evolutionary induction.
520
$a
This book presents a unified framework, based on specialized evolutionary algorithms, for the global induction of various types of classification and regression trees from data. The resulting univariate or oblique trees are significantly smaller than those produced by standard top-down methods, an aspect that is critical for the interpretation of mined patterns by domain analysts. The approach presented here is extremely flexible and can easily be adapted to specific data mining applications, e.g. cost-sensitive model trees for financial data or multi-test trees for gene expression data. The global induction can be efficiently applied to large-scale data without the need for extraordinary resources. With a simple GPU-based acceleration, datasets composed of millions of instances can be mined in minutes. In the event that the size of the datasets makes the fastest memory computing impossible, the Spark-based implementation on computer clusters, which offers impressive fault tolerance and scalability potential, can be applied.
650
0
$a
Data mining.
$3
562972
650
0
$a
Decision trees.
$3
827433
650
1 4
$a
Data Engineering.
$3
3409361
650
2 4
$a
Computational Intelligence.
$3
1001631
650
2 4
$a
Big Data.
$3
3134868
710
2
$a
SpringerLink (Online service)
$3
836513
773
0
$t
Springer eBooks
830
0
$a
Studies in big data ;
$v
v.59.
$3
3412281
856
4 0
$u
https://doi.org/10.1007/978-3-030-21851-5
950
$a
Intelligent Technologies and Robotics (Springer-42732)
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9374785
電子資源
11.線上閱覽_V
電子書
EB QA76.9.D343 K74 2019
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入