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. It is scikit-learn compatible and can be used in combination with scikit-learn. As a scikit-learn classifier, it implements the methods “fit” and “predict”.
This tool can be installed in two ways:
download the source from github and install using the command python3 setup.py install in the root folder
install from pip by using the command pip install dl8.5 in the console
Disclaimer: The compilation of the project has been tested with C++ compilers on the Linux and MacOS operating systems; Windows is not yet supported.
Aglin, G., Nijssen, S., Schaus, P. Learning optimal decision trees using caching branch-and-bound search. In AAAI. 2020.
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.
Source Distribution
File details
Details for the file dl8.5-0.0.15.tar.gz.
File metadata
- Download URL: dl8.5-0.0.15.tar.gz
- Upload date:
- Size: 38.3 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/3.1.1 pkginfo/1.5.0.1 requests/2.23.0 setuptools/46.1.3 requests-toolbelt/0.9.1 tqdm/4.45.0 CPython/3.8.1
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 2b3be5f5d72fa5f6c5283361fe6fa29e0fce369d5f0fa460cc424cc1057f7704 |
|
| MD5 | 0f7106cdbe30bae992e0ee53b254d810 |
|
| BLAKE2b-256 | 8d5689d4ed9b49628771c55939a677c0a272f98aa5cae3dba6a47b33c6c820a6 |
