SAT-based optimal classification trees for non-binary data

DOI10.1007/S10601-023-09348-1MaRDI QIDQ6049430zbMATH OpenOpenAlexFDO

Authors Pouya Shati, Eldan Cohen, Sheila A. McIlraith

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 treecategorical dataSATMaxSATnumeric data

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• A SAT-based approach to learn explainable decision sets
• Constructing optimal binary decision trees is NP-complete
• Core-boosted linear search for incomplete MaxSAT
• Fundamentals of machine learning for predictive data analytics. Algorithms, worked examples, and case studies
• Learning Optimal Decision Sets and Lists with SAT
• Learning certifiably optimal rule lists for categorical data
• Learning customized and optimized lists of rules with mathematical programming
• Learning optimal decision trees using constraint programming
• Lower bounds on learning decision lists and trees
• On Solving the Partial MAX-SAT Problem
• Optimal classification trees
• Optimal decision trees for categorical data via integer programming
• Principles and Practice of Constraint Programming – CP 2004
• SAT-based encodings for optimal decision trees with explicit paths
• Scikit-learn: machine learning in Python
• Temporal induction by incremental SAT solving
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints

Cited in

(1)

• Optimal multivariate decision trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6049430)