Journal article · 2023 · Open access
Margin optimal classification trees
Computers & Operations Research, 161, 106441 · Published 30 September 2023 · DOI 10.1016/j.cor.2023.106441
In brief
“Margin optimal classification trees” is a 2023 journal article by Federico D’Onofrio and 3 co-authors, published in Computers & Operations Research. OpenAlex counts 30 citations as of 21 November 2026. It is open access under a CC BY-NC-ND licence: the full text is free to read at Computers & Operations Research.
- Citations
- 30
- Most cited in
- 2026 (11)
- Field-weighted impact
- 1.66
- References
- 57
- Authors
- 4
Abstract
In recent years, there has been growing attention to interpretable machine learning models which can give explanatory insights on their behaviour. Thanks to their interpretability, decision trees have been intensively studied for classification tasks and, due to the remarkable advances in mixed integer programming (MIP), various approaches have been proposed to formulate the problem of training an Optimal Classification Tree (OCT) as a MIP model. We present a novel mixed integer quadratic formulation for the OCT problem, which exploits the generalization capabilities of Support Vector Machines for binary classification. Our model, denoted as Margin Optimal Classification Tree (MARGOT), encompasses maximum margin multivariate hyperplanes nested in a binary tree structure. To enhance the interpretability of our approach, we analyse two alternative versions of MARGOT, which include feature selection constraints inducing sparsity of the hyperplanes’ coefficients. First, MARGOT has been tested on non-linearly separable synthetic datasets in a 2-dimensional feature space to provide a graphical representation of the maximum margin approach. Finally, the proposed models have been tested on benchmark datasets from the UCI repository. The MARGOT formulation turns out to be easier to solve than other OCT approaches, and the generated tree better generalizes on new observations. The two interpretable versions effectively select the most relevant features, maintaining good prediction quality.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
D’Onofrio, F., Grani, G., Monaci, M., & Palagi, L. (2023). Margin optimal classification trees. Computers & Operations Research, 161, 106441. https://doi.org/10.1016/j.cor.2023.106441
MLA 9
D’Onofrio, Federico, et al. “Margin optimal classification trees.” Computers & Operations Research, vol. 161, 2023, p. 106441. https://doi.org/10.1016/j.cor.2023.106441.
Chicago
D’Onofrio, Federico, Giorgio Grani, Marta Monaci, and Laura Palagi. 2023. “Margin optimal classification trees.” Computers & Operations Research 161: 106441. https://doi.org/10.1016/j.cor.2023.106441.
Harvard
D’Onofrio, F. et al. (2023) ‘Margin optimal classification trees’, Computers & Operations Research, 161, p. 106441. doi:10.1016/j.cor.2023.106441.
IEEE
F. D’Onofrio, G. Grani, M. Monaci, and L. Palagi, “Margin optimal classification trees,” Computers & Operations Research, vol. 161, p. 106441, 2023, doi: 10.1016/j.cor.2023.106441.
BibTeX
@article{donofrio2023margin,
title = {{Margin optimal classification trees}},
author = {D’Onofrio, Federico and Grani, Giorgio and Monaci, Marta and Palagi, Laura},
journal = {Computers \& Operations Research},
year = {2023},
volume = {161},
pages = {106441},
doi = {10.1016/j.cor.2023.106441},
url = {https://doi.org/10.1016/j.cor.2023.106441}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2023 | 1 | |
| 2024 | 10 | |
| 2025 | 8 | |
| 2026 | 11 |
Its field-weighted citation impact is 1.66: it has been cited 1.66 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
- support vector machine
- feature selection
- sparsity
- model interpretability
- binary classification
- non-linearly separable data
- mixed integer programming
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
D’Onofrio, F., Grani, G., Monaci, M., & Palagi, L. (2023). Margin optimal classification trees. Computers & Operations Research, 161, 106441. https://doi.org/10.1016/j.cor.2023.106441
How many times has this paper been cited?
30 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 Computers & Operations Research: sign in and open the full text from this page.
Who wrote this paper?
Federico D’Onofrio, Giorgio Grani, Marta Monaci, Laura Palagi.
What is the DOI of this paper?
10.1016/j.cor.2023.106441, permanently at https://doi.org/10.1016/j.cor.2023.106441. 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.