TY - DATA T1 - Source code and data for the paper "Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming" PY - 2023/11/01 AU - Jacobus G. M. van der Linden AU - M.M. (Mathijs) de Weerdt AU - Emir Demirovic UR - DO - 10.4121/cb4f4468-05d1-4309-bc4b-d74748e3cfba.v1 KW - optimal decision trees KW - dynamic programming KW - prescriptive policy generation KW - group fairness N2 -

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.

ER -