A Generic Complete Anytime Beam Search for Optimal Decision Tree

Harold Silvère Kiossou, Siegfried Nijssen, Pierre Schaus

Finding an optimal decision tree that minimizes classification error is known to be NP-hard. While exact algorithms based on MILP, CP, SAT, or dynamic programming guarantee optimal…