A package to build an optimal binary decision tree classifier.
Project description
- Authors:
Gaël Aglin, Siegfried Nijssen, Pierre Schaus
This project implements an algorithm for inferring optimal binary decision trees classifiers. It is scikit-learn compatible package which provide classifiers and clustering algorithms and can be used with any scikit-learn functions. As any scikit-learn estimators, you have to use methods “fit” and “predict”.
This tool can be installed by two ways:
download the sources from github and compile using the command python3 setup.py install in the root folder
install from pip by using the command pip install dl8.5 in your console
Installation from sources ensure you to have up-to-date functionalities when pip method ensure you to have last release.
The complete documentation is available at https://dl85.readthedocs.io/en/latest/?badge=latest
Aglin, G., Nijssen, S., Schaus, P. Learning optimal decision trees using caching branch-and-bound search. In AAAI. 2020.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.