Learning optimal decision trees using constraint programming

Decision trees are among the most popular classification models in machine learning. Traditionally, they are learned using greedy algorithms. However, such algorithms pose several disadvantages: it is difficult to limit the size of the decision trees while maintaining a good classification accuracy,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Constraints : an international journal Jg. 25; H. 3-4; S. 226 - 250
Hauptverfasser:	Verhaeghe, Hélène, Nijssen, Siegfried, Pesant, Gilles, Quimper, Claude-Guy, Schaus, Pierre
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.12.2020
Schlagworte:	Artificial Intelligence Computer Science Operations Research/Decision Theory Optimization Original Research CoverSize Decision Tree AND/OR search tree Caching
ISSN:	1383-7133, 1572-9354
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!