Evidence map›Paper›PMID 38624654›Full record

ArticleTop (Berlin, Germany)2021

Mathematical optimization in classification and regression trees.

Emilio Carrizosa, Cristina Molero-Río, Dolores Romero Morales

Abstract read
In one paragraph

Article in Top (Berlin, Germany), 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 14 papers.

0numbers the graph read from it
0cells of the map it votes in
14citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

14 citing papers in PubMed.

  1. Which features best differentiate Sjögren's-related from non-Sjögren's-related dry eye disease?Graefe's archive for clinical and experimental ophthalmology = Albrecht von Graefes Archiv fur klinische und experimentelle Ophthalmologie · 2026
    Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Exploring the Whole Rashomon Set of Sparse Decision Trees.Advances in neural information processing systems · 2022
    Article
  13. Fast Sparse Decision Tree Optimization via Reference Ensembles.Proceedings of the ... AAAI Conference on Artificial Intelligence. AAAI Conference on Artificial Intelligence · 2022
    Article
  14. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Emilio CarrizosaInstituto de Matemáticas de la Universidad de Sevilla, Seville, Spain.ORCID https://orcid.org/0000-0002-0832-8700
Cristina Molero-RíoInstituto de Matemáticas de la Universidad de Sevilla, Seville, Spain.ORCID https://orcid.org/0000-0002-9600-4799
Dolores Romero MoralesDepartment of Economics, Copenhagen Business School, Frederiksberg, Denmark.ORCID https://orcid.org/0000-0001-7945-1469

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Classification and regression trees, as well as their variants, are off-the-shelf methods in Machine Learning. In this paper, we review recent contributions within the Continuous Optimization and the Mixed-Integer Linear Optimization paradigms to develop novel formulations in this research area. We compare those in terms of the nature of the decision variables and the constraints required, as well as the optimization algorithms proposed. We illustrate how these powerful formulations enhance the flexibility of tree models, being better suited to incorporate desirable properties such as cost-sensitivity, explainability, and fairness, and to deal with complex data, such as functional data.

Indexed as

Classification and regression treesContinuous nonlinear optimizationExplainabilityMixed-integer linear optimizationSparsityTree ensembles

Identifiers

PMID38624654
PMCPMC7967110

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.