國立虎尾科技大學 |

Evolutionary Decision Trees in Large-Scale Data Mining

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Evolutionary Decision Trees in Large-Scale Data Mining/ by Marek Kretowski.
Author:	Kretowski, Marek.
Description:	XI, 180 p. 69 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Engineering—Data processing. -
Online resource:	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. - 1st ed. 2019. - XI, 180 p. 69 illus.online resource. - Studies in Big Data,592197-6503 ;. - Studies in Big Data,8.

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:

1297966
Engineering—Data processing.

LC Class. No.: TA345-345.5

Dewey Class. No.: 620.00285

Evolutionary Decision Trees in Large-Scale Data Mining
LDR:02800nam a22004215i 4500 001 1007642
003 DE-He213
005 20200704130729.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030218515 $9 978-3-030-21851-5
024 7 $a 10.1007/978-3-030-21851-5 $2 doi
035 $a 978-3-030-21851-5
050 4 $a TA345-345.5
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 620.00285 $2 23
100 1 $a Kretowski, Marek. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1228351
245 1 0 $a Evolutionary Decision Trees in Large-Scale Data Mining $h [electronic resource] / $c by Marek Kretowski.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XI, 180 p. 69 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 Studies in Big Data, $x 2197-6503 ; $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 Engineering—Data processing. $3 1297966
650 0 $a Computational intelligence. $3 568984
650 0 $a Big data. $3 981821
650 1 4 $a Data Engineering. $3 1226308
650 2 4 $a Computational Intelligence. $3 768837
650 2 4 $a Big Data. $3 1017136
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030218508
776 0 8 $i Printed edition: $z 9783030218522
776 0 8 $i Printed edition: $z 9783030218539
830 0 $a Studies in Big Data, $x 2197-6503 ; $v 8 $3 1256918
856 4 0 $u https://doi.org/10.1007/978-3-030-21851-5
912 $a ZDB-2-INR
912 $a ZDB-2-SXIT
950 $a Intelligent Technologies and Robotics (SpringerNature-42732)
950 $a Intelligent Technologies and Robotics (R0) (SpringerNature-43728)