preprint · HAL (Le Centre pour la Communication Scientifique Directe) · 2023

Blossom: an Anytime Algorithm for Computing Optimal Decision Trees

Emir Demirović, Emmanuel Hébrard, Louis Jean

Cited by 0Open access

Abstract

International audience

Cite this paper

Demirović, E., Hébrard, E., & Jean, L. (2023). Blossom: an Anytime Algorithm for Computing Optimal Decision Trees. HAL (Le Centre pour la Communication Scientifique Directe).

MLA 9

Demirović, Emir, et al. “Blossom: an Anytime Algorithm for Computing Optimal Decision Trees.” HAL (Le Centre pour la Communication Scientifique Directe), 2023.

Chicago

Demirović, Emir, Emmanuel Hébrard, and Louis Jean. 2023. “Blossom: an Anytime Algorithm for Computing Optimal Decision Trees.” HAL (Le Centre pour la Communication Scientifique Directe).

Harvard

Demirović, E., Hébrard, E. and Jean, L. (2023) ‘Blossom: an Anytime Algorithm for Computing Optimal Decision Trees’, HAL (Le Centre pour la Communication Scientifique Directe).

BibTeX

@misc{demirovic2023blossom,
  title = {{Blossom: an Anytime Algorithm for Computing Optimal Decision Trees}},
  author = {Demirović, Emir and Hébrard, Emmanuel and Jean, Louis},
  journal = {HAL (Le Centre pour la Communication Scientifique Directe)},
  year = {2023}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.