Automatic Design of Decision-Tree Induction Algorithms (SpringerBriefs in Computer Science)

Automatic Design of Decision-Tree Induction Algorithms (SpringerBriefs in Computer Science)


Presents a close research of the main layout elements that represent a top-down decision-tree induction set of rules, together with points akin to cut up standards, preventing standards, pruning and the methods for facing lacking values. while the method nonetheless hired these days is to exploit a 'generic' decision-tree induction set of rules whatever the info, the authors argue at the advantages bias-fitting approach might carry to decision-tree induction, within which the last word objective is the automated iteration of a decision-tree induction set of rules adapted to the applying area of curiosity. For such, they speak about how you can successfully notice the main appropriate set of elements of decision-tree induction algorithms to house a wide selection of purposes in the course of the paradigm of evolutionary computation, following the emergence of a unique box known as hyper-heuristics.

"Automatic layout of Decision-Tree Induction Algorithms" will be hugely invaluable for computer studying and evolutionary computation scholars and researchers alike.

Show sample text content

Download sample