Rolling Lookahead Learning for Optimal Classification Trees

Classification trees continue to be widely adopted in machine learning applications due to their inherently interpretable nature and scalability. We propose a rolling subtree lookahead algorithm that combines the relative scalability of the myopic approaches with the foresight of the optimal approac...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Organ, Zeynel Batuhan, Kayış, Enis, Khaniyev, Taghi
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Learning Mathematics - Optimization and Control Statistics - Applications
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!