A branch & bound algorithm to determine optimal cross-splits for decision tree induction

State-of-the-art decision tree algorithms are top-down induction heuristics which greedily partition the attribute space by iteratively choosing the best split on an individual attribute. Despite their attractive performance in terms of runtime, simple examples, such as the XOR-Problem, point out th...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of mathematics and artificial intelligence Vol. 88; no. 4; pp. 291 - 311
Main Authors:	Bollwein, Ferdinand, Dahmen, Martin, Westphal, Stephan
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.04.2020 Springer Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Bivariate analysis Branch and bound methods Combinatorial analysis Complex Systems Computer Science Datasets Decision trees Machine learning Mathematics Optimization Solution space Branch & bound Cross-splits 90C27 68T05 Decision trees Classification
ISSN:	1012-2443, 1573-7470
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!