Paper · 2019 · Open access

Learning optimal classification trees using a binary linear program formulation (extended abstract)

Sicco Verwer, Yingqian Zhang

TU/e Research Portal · Published 1 January 2019

Open full textView at the publisherCite this paper

In brief

“Learning optimal classification trees using a binary linear program formulation (extended abstract)” is a 2019 paper by Sicco Verwer and Yingqian Zhang, published in TU/e Research Portal. OpenAlex counts 0 citations as of 20 November 2026. It is open access under a CC BY licence: the full text is free to read at TU/e Research Portal.

Citations
0
Authors
2

Abstract

We provide a new formulation for the problem of learning the optimal classification tree of a given depth as a binary linear program. A limitation of previously proposed Mathematical Optimization formulations is that they create constraints and variables for every row in the training data. As a result, the running time of the existing Integer Linear programming (ILP) formulations increases dramatically with the size of data. In our new binary formulation, we aim to circumvent this problem by making the formulation size largely independent from the training data size. We show experimentally that our formulation achieves better performance than existing formulations on both small and large problem instances within shorter running time.

Cite this paper

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

APA 7

Verwer, S., & Zhang, Y. (2019). Learning optimal classification trees using a binary linear program formulation (extended abstract). TU/e Research Portal. http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=916087

MLA 9

Verwer, Sicco, and Yingqian Zhang. “Learning optimal classification trees using a binary linear program formulation (extended abstract).” TU/e Research Portal, 2019. http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=916087.

Chicago

Verwer, Sicco and Yingqian Zhang. 2019. “Learning optimal classification trees using a binary linear program formulation (extended abstract).” TU/e Research Portal. http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=916087.

Harvard

Verwer, S. and Zhang, Y. (2019) ‘Learning optimal classification trees using a binary linear program formulation (extended abstract)’, TU/e Research Portal. Available at: http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=916087.

IEEE

S. Verwer and Y. Zhang, “Learning optimal classification trees using a binary linear program formulation (extended abstract),” TU/e Research Portal, 2019.

BibTeX

@article{verwer2019learning,
  title     = {{Learning optimal classification trees using a binary linear program formulation (extended abstract)}},
  author    = {Verwer, Sicco and Zhang, Yingqian},
  journal   = {TU/e Research Portal},
  year      = {2019},
  url       = {http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=916087}
}

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

Topic and keywords

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

  • classification trees
  • binary linear programming
  • integer linear programming
  • tree induction
  • computational efficiency
  • training data size

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?

Verwer, S., & Zhang, Y. (2019). Learning optimal classification trees using a binary linear program formulation (extended abstract). TU/e Research Portal. http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=916087

How many times has this paper been cited?

0 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 TU/e Research Portal: sign in and open the full text from this page.

Who wrote this paper?

Sicco Verwer, Yingqian Zhang.

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.