Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic

DOI10.1016/J.ENDM.2018.03.029zbMath1408.90353OpenAlexW2796650389MaRDI QIDQ1791966

Luiz Henrique de Campos Merschmann, Haroldo Gambini Santos, Matheus Guedes Vilas Boas

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.029

zbMATH Keywords

integer programmingdata miningvariable neighborhood searchdecision treesCOIN-OR branch-and-cutfeature based parameter tunning

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• MIPLIB
• C4.5

Cites Work

• Constructing optimal binary decision trees is NP-complete
• Variable neighborhood search
• An Automatic Method of Solving Discrete Programming Problems

This page was built for publication: Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic