Cătălin E. Brița

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound

Computing an optimal classification tree that provably maximizes training performance within a given size limit, is NP-hard, and in practice, most state-of-the-art methods do not scale beyond computing optimal trees of depth three. Therefore, most methods rely on a coarse binarization of continuous…