Automatic Design of Decision-Tree Induction Algorithms (Paperback, 2015 ed.)

, ,
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.

R2,236

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles22360
Mobicred@R210pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 10 - 15 working days


Toggle WishListAdd to wish list
Review this Item

Product Description

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.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Springer International Publishing AG

Country of origin

Switzerland

Series

SpringerBriefs in Computer Science

Release date

February 2015

Availability

Expected to ship within 10 - 15 working days

First published

2015

Authors

, ,

Dimensions

235 x 155 x 10mm (L x W x T)

Format

Paperback

Pages

176

Edition

2015 ed.

ISBN-13

978-3-319-14230-2

Barcode

9783319142302

Categories

LSN

3-319-14230-5



Trending On Loot