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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Annals of mathematics and artificial intelligence Ročník 88; číslo 4; s. 291 - 311
Hlavní autori:	Bollwein, Ferdinand, Dahmen, Martin, Westphal, Stephan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.04.2020 Springer Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!