From the 1 of 8 linked papers with an AI index.
8 papers
Search Strategies for Optimal Classification and Regression Trees
Jacobus G. M. van der Linden, Mim van den Bos, Emir DemiroviÄ
The paper presents a unified algorithmic framework for optimal decision trees that incorporates and compares 18 different search strategies, showing improved scalability and perfor…
Domain-Independent Dynamic Programming with Constraint Propagation
Imko Marijnissen, J. Christopher Beck, Emir DemiroviÄ +1
There are two prevalent model-based paradigms for combinatorial problems: 1) state-based representations, such as heuristic search, dynamic programming (DP), and decision diagrams,…
Using Certifying Constraint Solvers for Generating Step-wise Explanations
Ignace Bleukx, Maarten Flippo, Bart Bogaerts +2
In the field of Explainable Constraint Solving, it is common to explain to a user why a problem is unsatisfiable. A recently proposed method for this is to compute a sequence of ex…
SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration
Elif Arslan, Jacobus G. M. van der Linden, Serge Hoogendoorn +2
Sparse decision tree learning provides accurate and interpretable predictive models that are ideal for high-stakes applications by finding the single most accurate tree within a (s…
Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance
Jacobus G. M. van der Linden, Daniël Vos, Daniël Vos +4
Recently there has been a surge of interest in optimal decision tree (ODT) methods that globally optimize accuracy directly, in contrast to traditional approaches that locally opti…
Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
Catalin E. Brita, Jacobus G. M. van der Linden, Emir DemiroviÄ
Computing an optimal classification tree that provably maximizes training performance within a given size limit, is NP-hard, and in practice, most state-of-the-art methods do not s…