paper-with-me

홈 › Papers

Mixture of Decision Trees for Interpretable Machine Learning

2022-11-26 · Simeon Brüggenjürgen, Nina Schaaf, Pascal Kerschke, Marco F. Huber

This work introduces a novel interpretable machine learning method called Mixture of Decision Trees (MoDT). It constitutes a special case of the Mixture of Experts ensemble architecture, which utilizes a linear model as gating function and decision trees as experts. Our proposed method is ideally suited for problems that cannot be satisfactorily learned by a single decision tree, but which can alternatively be divided into subproblems. Each subproblem can then be learned well from a single decision tree. Therefore, MoDT can be considered as a method that improves performance while maintaining interpretability by making each of its decisions understandable and traceable to humans. Our work is accompanied by a Python implementation, which uses an interpretable gating function, a fast learning algorithm, and a direct interface to fine-tuned interpretable visualization methods. The experiments confirm that the implementation works and, more importantly, show the superiority of our approach compared to single decision trees and random forests of similar complexity.

📄 PDF Abstract BibTeX arXiv:2211.14617

Code (1)

simsal0r/mixture-of-decision-trees 공식 구현

Tasks

Interpretable Machine LearningMixture-of-Experts

Similar Papers 제목 키워드 기반

Decision Trees for Interpretable Clusters in Mixture Models and Deep Representations

2024-11-03 · Maximilian Fleissner, Maedeh Zarvandi, Debarghya Ghoshdastidar

Decision Trees are one of the backbones of explainable machine learning, and often serve as interpretable alternatives to black-box models. Traditionally utilized in the supervised setting, there has recently also been a…

Clustering

MoET: Interpretable and Verifiable Reinforcement Learning via Mixture of Expert Trees

2019-09-25 · Marko Vasic, Andrija Petrovic, Kaiyuan Wang, Mladen Nikolic 외

Deep Reinforcement Learning (DRL) has led to many recent breakthroughs on complex control tasks, such as defeating the best human player in the game of Go. However, decisions made by the DRL agent are not explainable, hi…

Deep Reinforcement LearningGame of GoImitation LearningMixture-of-Experts+3

Rectified Decision Trees: Exploring the Landscape of Interpretable and Effective Machine Learning

2020-08-21 · Yiming Li, Jiawang Bai, Jiawei Li, Xue Yang 외

Interpretability and effectiveness are two essential and indispensable requirements for adopting machine learning methods in reality. In this paper, we propose a knowledge distillation based decision trees extension, dub…

BIG-bench Machine LearningKnowledge Distillation

Enhancing LIME using Neural Decision Trees

2026-03-21 · Mohamed Aymen Bouyahia, Argyris Kalogeratos arxiv

Interpreting complex machine learning models is a critical challenge, especially for tabular data where model transparency is paramount. Local Interpretable Model-Agnostic Explanations (LIME) has been a very popular fram…

Interpretable Machine Learning

Explaining Kernel Clustering via Decision Trees

2024-02-15 · Maximilian Fleissner, Leena Chennuru Vankadara, Debarghya Ghoshdastidar

Despite the growing popularity of explainable and interpretable machine learning, there is still surprisingly limited work on inherently interpretable clustering methods. Recently, there has been a surge of interest in e…

ClusteringInterpretable Machine Learning