The doi above is for this specific version of this dataset, which is currently the latest. Newer versions may be published in the future. For a link that will always point to the latest version, please use
doi: 10.4121/cb4f4468-05d1-4309-bc4b-d74748e3cfba

van der Linden, Jacobus G. M.; de Weerdt, M.M. (Mathijs); Demirovic, Emir (2023): Source code and data for the paper "Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming". Version 1. 4TU.ResearchData. software. https://doi.org/10.4121/cb4f4468-05d1-4309-bc4b-d74748e3cfba.v1

Software

• Artificial Intelligence and Image Processing
• Information and Computing Sciences

dynamic programming, group fairness, optimal decision trees, prescriptive policy generation

MIT

RefWorks, BibTeX, Reference Manager, Endnote, DataCite, NLM, DC, CFF

by Jacobus G. M. van der Linden , M.M. (Mathijs) de Weerdt , Emir Demirovic

STreeD is a framework for optimal binary decision trees with separable optimization tasks. A separable optimization task is a task that can be optimized separately for the left and right subtree. The current STreeD Framework implements a broad set of such optimization tasks, from group fairness constraints to prescriptive policy generation. For an explanation of each application, see below. For details on what tasks are separable and how the algorithm works, see our paper.

• 2023-11-01 first online, published, posted

4TU.ResearchData

text/x-python

• https://github.com/AlgTUDelft/pystreed

TU Delft, Faculty of Electrical Engineering, Mathematics and Computer Science, Department of Software Technology