Pith. sign in

On Explaining Decision Trees

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it
abstract

Decision trees (DTs) epitomize what have become to be known as interpretable machine learning (ML) models. This is informally motivated by paths in DTs being often much smaller than the total number of features. This paper shows that in some settings DTs can hardly be deemed interpretable, with paths in a DT being arbitrarily larger than a PI-explanation, i.e. a subset-minimal set of feature values that entails the prediction. As a result, the paper proposes a novel model for computing PI-explanations of DTs, which enables computing one PI-explanation in polynomial time. Moreover, it is shown that enumeration of PI-explanations can be reduced to the enumeration of minimal hitting sets. Experimental results were obtained on a wide range of publicly available datasets with well-known DT-learning tools, and confirm that in most cases DTs have paths that are proper supersets of PI-explanations.

years

2026 3

representative citing papers

Long-Term Dynamical Evolution and Ejection of Near-Earth Asteroids

astro-ph.EP · 2026-04-18 · unverdicted · novelty 6.0 · 2 refs

Machine learning classifiers on initial orbital elements and convolutional neural networks on recurrence plots from short integrations classify long-term ejection of near-Earth asteroids with accuracy comparable to full numerical simulations.

citing papers explorer

Showing 3 of 3 citing papers.