crillab / pyxai
PyXAI (Python eXplainable AI) is a Python library (version 3.6 or later) allowing to bring formal explanations suited to (regression or classification) tree-based ML models (Decision Trees, Random Forests, Boosted Trees, ...).
☆33Updated last week
Alternatives and similar repositories for pyxai:
Users that are interested in pyxai are comparing it to the libraries listed below
- A Python Library for modeling combinatorial constrained problems☆67Updated this week
- XReason - formal reasoning about explanations for ML models☆16Updated last year
- A toolbox for logical and probabilistic reasoning, StarAI, ILP and Program synthesis☆23Updated 4 years ago
- Julia hybrid constraint programming solver enhanced by a reinforcement learning driven search.☆169Updated last year
- Python package for Sentential Decision Diagrams (SDD)☆56Updated 2 months ago
- Exact optimization for cost function networks and additive graphical models☆53Updated last week
- mETRICS - rEproducible sofTware peRformance analysIs in perfeCt Simplicity☆11Updated 4 months ago
- ☆31Updated last year
- Manipulate NNF (Negation Normal Form) logical sentences☆17Updated 2 years ago
- Code for "Explainable Data-Driven Optimization" (ICML 2023)☆14Updated last year
- ☆37Updated 5 months ago
- Constraint Solver ACE☆29Updated last week
- Constraint Programming and Modeling library in Python, based on numpy, with direct solver access.☆253Updated this week
- An algorithm for learning optimal decision trees, with Python interface☆64Updated last year
- Differentiable probabilistic answer set programming☆20Updated 5 months ago
- A toolbox for fair and explainable machine learning☆55Updated 10 months ago
- A package for tree-based statistical estimation and inference using optimal decision trees.☆40Updated 9 months ago
- ☆14Updated this week
- OCEAN: Optimal Counterfactual Explanations in Tree Ensembles (ICML 2021)☆20Updated last year
- Python implementation of the main algorithms of the Learning From Interpretation Transitions (LFIT) framework☆13Updated 9 months ago
- Born-Again Tree Ensembles: Transforms a random forest into a single, minimal-size, tree with exactly the same prediction function in the …☆65Updated last year
- Fast Gradient Boosting Decision Trees with Bit-Level Data Structures☆17Updated 2 years ago
- Replacing standard support propagation by belief propagation in MiniCP☆12Updated 3 weeks ago
- Discrete Optimization is a python library to ease the definition and re-use of discrete optimization problems and solvers.☆58Updated 2 weeks ago
- SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers☆38Updated 2 years ago
- Binary Programming Formulation for Learning Classification Trees Using Cplex☆12Updated 6 years ago
- ☆19Updated 2 years ago
- ☆20Updated 3 years ago
- A cpmpy-based library for constraint acquisition.☆16Updated 2 months ago
- Probabilistic programming system for fast and exact symbolic inference☆79Updated 9 months ago