PyDL8.5: A library for learning optimal decision trees

23Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

Decision Trees (DTs) are widely used Machine Learning (ML) models with a broad range of applications. The interest in these models has increased even further in the context of Explainable AI (XAI), as decision trees of limited depth are very interpretable models. However, traditional algorithms for learning DTs are heuristic in nature; they may produce trees that are of suboptimal quality under depth constraints. We introduce PyDL8.5, a Python library to infer depth-constrained Optimal Decision Trees (ODTs). PyDL8.5 provides an interface for DL8.5, an efficient algorithm for inferring depth-constrained ODTs. The library provides an easy-to-use scikit-learn compatible interface. It cannot only be used for classification tasks, but also for regression, clustering, and other tasks. We introduce an interface that allows users to easily implement these other learning tasks. We provide a number of examples of how to use this library.

Cite

CITATION STYLE

APA

Aglin, G., Nijssen, S., & Schaus, P. (2020). PyDL8.5: A library for learning optimal decision trees. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2021-January, pp. 5222–5224). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2020/750

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free