SAT-based optimal classification trees for non-binary data

DOI10.1007/s10601-023-09348-1OpenAlexW4383620205MaRDI QIDQ6049430

Eldan Cohen, Sheila A. McIlraith, Pouya Shati

Publication date: 15 September 2023

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-023-09348-1

zbMATH Keywords

classificationdecision treeSATcategorical dataMaxSATnumeric data

Mathematics Subject Classification ID

Statistics (62-XX) Mathematical programming (90Cxx) Artificial intelligence (68Txx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning Certifiably Optimal Rule Lists for Categorical Data
• Learning optimal decision trees using constraint programming
• Constructing optimal binary decision trees is NP-complete
• Learning customized and optimized lists of rules with mathematical programming
• A SAT-based approach to learn explainable decision sets
• Lower bounds on learning decision lists and trees
• Optimal decision trees for categorical data via integer programming
• Core-boosted linear search for incomplete MaxSAT
• SAT-based encodings for optimal decision trees with explicit paths
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Learning Optimal Decision Sets and Lists with SAT
• On Solving the Partial MAX-SAT Problem
• Principles and Practice of Constraint Programming – CP 2004
• Optimal classification trees

This page was built for publication: SAT-based optimal classification trees for non-binary data