Preprint · 2024 · Open access
BooleanOCT: Optimal Classification Trees based on multivariate Boolean Rules
arXiv (Cornell University) · Published 29 January 2024 · DOI 10.48550/arxiv.2401.16133
In brief
“BooleanOCT: Optimal Classification Trees based on multivariate Boolean Rules” is a 2024 preprint by Jiancheng Tu and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 2 citations as of 21 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 2
- Most cited in
- 2026 (2)
- References
- 55
- Authors
- 3
Abstract
The global optimization of classification trees has demonstrated considerable promise, notably in enhancing accuracy, optimizing size, and thereby improving human comprehensibility. While existing optimal classification trees substantially enhance accuracy over greedy-based tree models like CART, they still fall short when compared to the more complex black-box models, such as random forests. To bridge this gap, we introduce a new mixed-integer programming (MIP) formulation, grounded in multivariate Boolean rules, to derive the optimal classification tree. Our methodology integrates both linear metrics, including accuracy, balanced accuracy, and cost-sensitive cost, as well as nonlinear metrics such as the F1-score. The approach is implemented in an open-source Python package named BooleanOCT. We comprehensively benchmark these methods on the 36 datasets from the UCI machine learning repository. The proposed models demonstrate practical solvability on real-world datasets, effectively handling sizes in the tens of thousands. Aiming to maximize accuracy, this model achieves an average absolute improvement of 3.1\% and 1.5\% over random forests in small-scale and medium-sized datasets, respectively. Experiments targeting various objectives, including balanced accuracy, cost-sensitive cost, and F1-score, demonstrate the framework's wide applicability and its superiority over contemporary state-of-the-art optimal classification tree methods in small to medium-scale datasets.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Tu, J., Wenqi, F., & Wu, Z. (2024). BooleanOCT: Optimal Classification Trees based on multivariate Boolean Rules. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2401.16133
MLA 9
Tu, Jiancheng, et al. “BooleanOCT: Optimal Classification Trees based on multivariate Boolean Rules.” arXiv (Cornell University), 2024. https://doi.org/10.48550/arxiv.2401.16133.
Chicago
Tu, Jiancheng, Fan, Wenqi, and Zhibin Wu. 2024. “BooleanOCT: Optimal Classification Trees based on multivariate Boolean Rules.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2401.16133.
Harvard
Tu, J., Wenqi, F. and Wu, Z. (2024) ‘BooleanOCT: Optimal Classification Trees based on multivariate Boolean Rules’, arXiv (Cornell University). doi:10.48550/arxiv.2401.16133.
IEEE
J. Tu, F. Wenqi, and Z. Wu, “BooleanOCT: Optimal Classification Trees based on multivariate Boolean Rules,” arXiv (Cornell University), 2024, doi: 10.48550/arxiv.2401.16133.
BibTeX
@misc{tu2024booleanoct,
title = {{BooleanOCT: Optimal Classification Trees based on multivariate Boolean Rules}},
author = {Tu, Jiancheng and Wenqi, Fan, and Wu, Zhibin},
howpublished = {arXiv (Cornell University)},
year = {2024},
doi = {10.48550/arxiv.2401.16133},
url = {https://doi.org/10.48550/arxiv.2401.16133}
}
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
- mixed integer programming
- balanced accuracy
- F1 score
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?
Tu, J., Wenqi, F., & Wu, Z. (2024). BooleanOCT: Optimal Classification Trees based on multivariate Boolean Rules. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2401.16133
How many times has this paper been cited?
2 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 arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Jiancheng Tu, Fan, Wenqi, Zhibin Wu.
What is the DOI of this paper?
10.48550/arxiv.2401.16133, permanently at https://doi.org/10.48550/arxiv.2401.16133. 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.