Skip to main content

A package to build an optimal binary decision tree classifier.

Project description

Travis CircleCI ReadTheDocs Codecov

Authors:

Gaël Aglin, Siegfried Nijssen, Pierre Schaus

Relevant paper: [DL852020]

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

[DL852020]

Aglin, G., Nijssen, S., Schaus, P. Learning optimal decision trees using caching branch-and-bound search. In AAAI. 2020.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

dl8.5-0.0.7.tar.gz (36.0 kB view hashes)

Uploaded Source

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page