Preprint · 2020 · Open access

Learning Optimal Classification Trees: Strong Max-Flow Formulations

Sina Aghaei, Andrés Gómez, Phebe Vayanos

arXiv (Cornell University) · Published 21 February 2020 · DOI 10.48550/arxiv.2002.09142

Open PDFView at the publisherCite this paper

In brief

“Learning Optimal Classification Trees: Strong Max-Flow Formulations” is a 2020 preprint by Sina Aghaei and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 42 citations as of 20 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
42
Most cited in
2023 (14)
References
26
Authors
3

Abstract

We consider the problem of learning optimal binary classification trees. Literature on the topic has burgeoned in recent years, motivated both by the empirical suboptimality of heuristic approaches and the tremendous improvements in mixed-integer programming (MIP) technology. Yet, existing approaches from the literature do not leverage the power of MIP to its full extent. Indeed, they rely on weak formulations, resulting in slow convergence and large optimality gaps. To fill this gap in the literature, we propose a flow-based MIP formulation for optimal binary classification trees that has a stronger linear programming relaxation. Our formulation presents an attractive decomposable structure. We exploit this structure and max-flow/min-cut duality to derive a Benders' decomposition method, which scales to larger instances. We conduct extensive computational experiments on standard benchmark datasets on which we show that our proposed approaches are 50 times faster than state-of-the art MIP-based techniques and improve out of sample performance up to 13.8%.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Aghaei, S., Gómez, A., & Vayanos, P. (2020). Learning Optimal Classification Trees: Strong Max-Flow Formulations. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2002.09142

MLA 9

Aghaei, Sina, et al. “Learning Optimal Classification Trees: Strong Max-Flow Formulations.” arXiv (Cornell University), 2020. https://doi.org/10.48550/arxiv.2002.09142.

Chicago

Aghaei, Sina, Andrés Gómez, and Phebe Vayanos. 2020. “Learning Optimal Classification Trees: Strong Max-Flow Formulations.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2002.09142.

Harvard

Aghaei, S., Gómez, A. and Vayanos, P. (2020) ‘Learning Optimal Classification Trees: Strong Max-Flow Formulations’, arXiv (Cornell University). doi:10.48550/arxiv.2002.09142.

IEEE

S. Aghaei, A. Gómez, and P. Vayanos, “Learning Optimal Classification Trees: Strong Max-Flow Formulations,” arXiv (Cornell University), 2020, doi: 10.48550/arxiv.2002.09142.

BibTeX

@misc{aghaei2020learning,
  title     = {{Learning Optimal Classification Trees: Strong Max-Flow Formulations}},
  author    = {Aghaei, Sina and Gómez, Andrés and Vayanos, Phebe},
  howpublished = {arXiv (Cornell University)},
  year      = {2020},
  doi       = {10.48550/arxiv.2002.09142},
  url       = {https://doi.org/10.48550/arxiv.2002.09142}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202066
202133
202277
20231414
202433
202566
202633

Topic and keywords

Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications

  • binary classification tree
  • linear programming relaxation
  • Benders decomposition

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Aghaei, S., Gómez, A., & Vayanos, P. (2020). Learning Optimal Classification Trees: Strong Max-Flow Formulations. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2002.09142

How many times has this paper been cited?

42 times, according to OpenAlex on 20 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Sina Aghaei, Andrés Gómez, Phebe Vayanos.

What is the DOI of this paper?

10.48550/arxiv.2002.09142, permanently at https://doi.org/10.48550/arxiv.2002.09142. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 20 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.