Journal article · 2026 · Open access

Pareto-optimal trees and Pareto forest: a bi-objective optimization model for binary classification

Marianna De Santis, Daniele Patria, Justo Puerto

Computational Optimization and Applications · Published 9 June 2026 · DOI 10.1007/s10589-026-00799-9

Open PDFView at the publisherCite this paper

In brief

“Pareto-optimal trees and Pareto forest: a bi-objective optimization model for binary classification” is a 2026 journal article by Marianna De Santis and 2 co-authors, published in Computational Optimization and Applications. OpenAlex counts 1 citations as of 21 November 2026. It is open access under a CC BY licence: the full text is free to read at Computational Optimization and Applications.

Citations
1
Most cited in
2026 (1)
Field-weighted impact
0.97
References
31
Authors
3

Abstract

As inherently transparent models, classification trees play a central role in interpretable machine learning by providing easily traceable decision paths that allow users to understand how input features contribute to specific predictions. In this work, we introduce a new class of interpretable binary classification models, named Pareto-optimal trees, which aim at combining the complementary strengths of Optimal Classification Trees with Hyperplane-based splits (OCT-H) and Support Vector Machines (SVM). We formulate a bi-objective mixed-integer quadratic optimization problem, whose nondominated solutions represent trade-offs between these two different classification techniques. To further enhance robustness and performance, we propose the Pareto forest, an ensemble method based on the Pareto-optimal trees, aggregated through majority voting. Extensive experiments on benchmark datasets demonstrate that our models can outperform standard methods such as CART and OCT, underscoring the improvements gained through the bi-objective perspective. In particular, Pareto-optimal trees unify the ability of OCT-H and SVM within a single framework, resulting in enhanced classification performance relative to either method alone. Embracing a multiobjective perspective allows the construction of multiple “high quality" trees. Our comparison between Pareto forests and random forests shows that building shallow ensembles from a small number of such optimized trees outperforms relying on a large set of random trees with variable depth.

Cite this paper

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

APA 7

De Santis, M., Patria, D., & Puerto, J. (2026). Pareto-optimal trees and Pareto forest: a bi-objective optimization model for binary classification. Computational Optimization and Applications. https://doi.org/10.1007/s10589-026-00799-9

MLA 9

De Santis, Marianna, et al. “Pareto-optimal trees and Pareto forest: a bi-objective optimization model for binary classification.” Computational Optimization and Applications, 2026. https://doi.org/10.1007/s10589-026-00799-9.

Chicago

De Santis, Marianna, Daniele Patria, and Justo Puerto. 2026. “Pareto-optimal trees and Pareto forest: a bi-objective optimization model for binary classification.” Computational Optimization and Applications. https://doi.org/10.1007/s10589-026-00799-9.

Harvard

De Santis, M., Patria, D. and Puerto, J. (2026) ‘Pareto-optimal trees and Pareto forest: a bi-objective optimization model for binary classification’, Computational Optimization and Applications. doi:10.1007/s10589-026-00799-9.

IEEE

M. De Santis, D. Patria, and J. Puerto, “Pareto-optimal trees and Pareto forest: a bi-objective optimization model for binary classification,” Computational Optimization and Applications, 2026, doi: 10.1007/s10589-026-00799-9.

BibTeX

@article{desantis2026pareto,
  title     = {{Pareto-optimal trees and Pareto forest: a bi-objective optimization model for binary classification}},
  author    = {De Santis, Marianna and Patria, Daniele and Puerto, Justo},
  journal   = {Computational Optimization and Applications},
  year      = {2026},
  doi       = {10.1007/s10589-026-00799-9},
  url       = {https://doi.org/10.1007/s10589-026-00799-9}
}

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

Topic and keywords

Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)

  • binary classification
  • model interpretability
  • classification trees
  • support vector machine
  • bi-objective optimization
  • ensemble methods
  • majority voting
  • decision tree

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?

De Santis, M., Patria, D., & Puerto, J. (2026). Pareto-optimal trees and Pareto forest: a bi-objective optimization model for binary classification. Computational Optimization and Applications. https://doi.org/10.1007/s10589-026-00799-9

How many times has this paper been cited?

1 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 Computational Optimization and Applications: sign in and open the PDF from this page.

Who wrote this paper?

Marianna De Santis, Daniele Patria, Justo Puerto.

What is the DOI of this paper?

10.1007/s10589-026-00799-9, permanently at https://doi.org/10.1007/s10589-026-00799-9. 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.