Central Library

Normal view MARC view ISBD view

Automatic Design of Decision-Tree Induction Algorithms [electronic resource] / by Rodrigo C. Barros, Andr�e C.P.L.F de Carvalho, Alex A. Freitas.

By: Barros, Rodrigo C [author.].
Contributor(s): de Carvalho, Andr�e C.P.L.F [author.] | Freitas, Alex A [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: SpringerBriefs in Computer Science: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2015Description: XII, 176 p. 18 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319142319.Subject(s): Computer science | Data mining | Pattern recognition | Computer Science | Data Mining and Knowledge Discovery | Pattern RecognitionAdditional physical formats: Printed edition:: No titleDDC classification: 006.312 Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.