Optimal decision trees for categorical data via integer programming

Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if allowed to grow large, they lose interpretability. In this pap...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 81; číslo 1; s. 233 - 260
Hlavní autori:	Günlük, Oktay, Kalagnanam, Jayant, Li, Minhan, Menickelly, Matt, Scheinberg, Katya
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.09.2021 Springer Springer Nature B.V
Predmet:	binary classification Combinatorial analysis Computer Science Decision trees Integer programming machine learning Mathematics MATHEMATICS AND COMPUTING Mathematics and Statistics Mixed integer Operations Research/Decision Theory Optimization Prediction models Real Functions Robustness (mathematics) S.i.: Gerad-40 Integer programming Decision trees Binary classification Machine learning
ISSN:	0925-5001, 1573-2916
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!