Preprint · 2020 · Open access

MurTree: Optimal Classification Trees via Dynamic Programming and Search

Emir Demirović, Anna Lukina, Emmanuel Hébrard, Jeffrey Chan, James P. Bailey, Christopher A. Leckie, Kotagiri Ramamohanarao, Peter J. Stuckey

Monash University Research Portal (Monash University), 23(26), 1–47 · Published 24 July 2020 · DOI 10.48550/arxiv.2007.12652

Open full textView at the publisherCite this paper

In brief

“MurTree: Optimal Classification Trees via Dynamic Programming and Search” is a 2020 preprint by Emir Demirović and 7 co-authors, published in Monash University Research Portal (Monash University). OpenAlex counts 105 citations as of 21 November 2026. It is open access: the full text is free to read at Monash University Research Portal (Monash University).

Citations
105
Most cited in
2023 (26)
References
46
Authors
8

Abstract

Decision tree learning is a widely used approach in machine learning, favoured in applications that require concise and interpretable models. Heuristic methods are traditionally used to quickly produce models with reasonably high accuracy. A commonly criticised point, however, is that the resulting trees may not necessarily be the best representation of the data in terms of accuracy and size. In recent years, this motivated the development of optimal classification tree algorithms that globally optimise the decision tree in contrast to heuristic methods that perform a sequence of locally optimal decisions. We follow this line of work and provide a novel algorithm for learning optimal classification trees based on dynamic programming and search. Our algorithm supports constraints on the depth of the tree and number of nodes. The success of our approach is attributed to a series of specialised techniques that exploit properties unique to classification trees. Whereas algorithms for optimal classification trees have traditionally been plagued by high runtimes and limited scalability, we show in a detailed experimental study that our approach uses only a fraction of the time required by the state-of-the-art and can handle datasets with tens of thousands of instances, providing several orders of magnitude improvements and notably contributing towards the practical realisation of optimal decision trees.

Cite this paper

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

APA 7

Demirović, E., Lukina, A., Hébrard, E., Chan, J., Bailey, J. P., Leckie, C. A., Ramamohanarao, K., & Stuckey, P. J. (2020). MurTree: Optimal Classification Trees via Dynamic Programming and Search. Monash University Research Portal (Monash University), 23(26), 1–47. https://doi.org/10.48550/arxiv.2007.12652

MLA 9

Demirović, Emir, et al. “MurTree: Optimal Classification Trees via Dynamic Programming and Search.” Monash University Research Portal (Monash University), vol. 23, no. 26, 2020, pp. 1–47. https://doi.org/10.48550/arxiv.2007.12652.

Chicago

Demirović, Emir, Anna Lukina, Emmanuel Hébrard, Jeffrey Chan, James P. Bailey, Christopher A. Leckie, Kotagiri Ramamohanarao, and Peter J. Stuckey. 2020. “MurTree: Optimal Classification Trees via Dynamic Programming and Search.” Monash University Research Portal (Monash University) 23 (26): 1–47. https://doi.org/10.48550/arxiv.2007.12652.

Harvard

Demirović, E. et al. (2020) ‘MurTree: Optimal Classification Trees via Dynamic Programming and Search’, Monash University Research Portal (Monash University), 23(26), pp. 1–47. doi:10.48550/arxiv.2007.12652.

IEEE

E. Demirović et al., “MurTree: Optimal Classification Trees via Dynamic Programming and Search,” Monash University Research Portal (Monash University), vol. 23, no. 26, pp. 1–47, 2020, doi: 10.48550/arxiv.2007.12652.

BibTeX

@misc{demirovic2020murtree,
  title     = {{MurTree: Optimal Classification Trees via Dynamic Programming and Search}},
  author    = {Demirović, Emir and Lukina, Anna and Hébrard, Emmanuel and Chan, Jeffrey and Bailey, James P. and Leckie, Christopher A. and Ramamohanarao, Kotagiri and Stuckey, Peter J.},
  howpublished = {Monash University Research Portal (Monash University)},
  year      = {2020},
  volume    = {23},
  number    = {26},
  pages     = {1--47},
  doi       = {10.48550/arxiv.2007.12652},
  url       = {https://doi.org/10.48550/arxiv.2007.12652}
}

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

Citations by year

YearCitationsShare of the best year
20211010
20221212
20232626
20242222
20251818
20261717

Topic and keywords

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

  • decision tree induction
  • dynamic programming
  • search algorithms
  • scalability
  • interpretable models
  • global optimization

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?

Demirović, E., Lukina, A., Hébrard, E., Chan, J., Bailey, J. P., Leckie, C. A., Ramamohanarao, K., & Stuckey, P. J. (2020). MurTree: Optimal Classification Trees via Dynamic Programming and Search. Monash University Research Portal (Monash University), 23(26), 1–47. https://doi.org/10.48550/arxiv.2007.12652

How many times has this paper been cited?

105 times, according to OpenAlex on 21 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 Monash University Research Portal (Monash University): sign in and open the full text from this page.

Who wrote this paper?

Emir Demirović, Anna Lukina, Emmanuel Hébrard, Jeffrey Chan, James P. Bailey, Christopher A. Leckie, Kotagiri Ramamohanarao, Peter J. Stuckey.

What is the DOI of this paper?

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

Bibliographic data from OpenAlex (CC0), last checked 21 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.