Evolutionary Decision Trees in Large-Scale Data Mining

Marek Kretowski

ISBN 10: 3030218538 / ISBN 13: 9783030218539

Editore: Springer International Publishing, 2020

Riguardo questo articolo

Druck auf Anfrage Neuware - Printed after ordering - 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.

Codice articolo 9783030218539

Dati bibliografici

• Titolo: Evolutionary Decision Trees in Large-Scale Data Mining
• Editore: Springer International Publishing
• Data di pubblicazione: 2020
• Lingua: Inglese
• ISBN 10: 3030218538
• ISBN 13: 9783030218539
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 11 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 11 millimetri di profondità
• Peso: 300 grammi

Descrizione articolo

Riassunto

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.