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

Brita et al. "Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound." AAAI Conference on Artificial Intelligence, 2025. doi:10.1609/AAAI.V39I11.33210

[Brita et al. "Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound." AAAI Conference on Artificial Intelligence, 2025.](https://mlanthology.org/aaai/2025/brita2025aaai-optimal/) doi:10.1609/AAAI.V39I11.33210

@inproceedings{brita2025aaai-optimal,
  title     = {{Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound}},
  author    = {Brita, Catalin E. and van der Linden, Jacobus G. M. and Demirovic, Emir},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2025},
  pages     = {11131-11139},
  doi       = {10.1609/AAAI.V39I11.33210},
  url       = {https://mlanthology.org/aaai/2025/brita2025aaai-optimal/}
}