Interpretable Clustering via Optimal Trees
Not on the map. Why?
Abstract (arXiv)
State-of-the-art clustering algorithms use heuristics to partition the feature space and provide little insight into the rationale for cluster membership, limiting their interpretability. In healthcare applications, the latter poses a barrier to the adoption of these methods since medical researchers are required to provide detailed explanations of their decisions in order to gain patient trust and limit liability. We present a new unsupervised learning algorithm that leverages Mixed Integer Optimization techniques to generate interpretable tree-based clustering models. Utilizing the flexible framework of Optimal Trees, our method approximates the globally optimal solution leading to high quality partitions of the feature space. Our algorithm, can incorporate various internal validation metrics, naturally determines the optimal number of clusters, and is able to account for mixed numeric and categorical data. It achieves comparable or superior performance on both synthetic and real world datasets when compared to K-Means while offering significantly higher interpretability.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Dec 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 1; 2023: 1; 2024: 2; 2025: 0; 2026: 1.
10 papers.
- 2021Explainable k-means. Don't be greedy, plant bigger trees!cited by 15
- 2021Shallow decision trees for explainable k-means clusteringcited by 15
- 2021Near-Optimal Explainable k-Means for All Dimensionscited by 13
- 2021Near-optimal Algorithms for Explainable k-Medians and k-Meanscited by 13
- 2024Interpretable Clustering: A Surveycited by 8
- 2021Algorithm-Agnostic Explainability for Unsupervised Clusteringcited by 4
- 2024Explaining Kernel Clustering via Decision Treescited by 2
- 2022Algorithm-Agnostic Interpretations for Clusteringcited by 0
- 2023Forecasting Auxiliary Energy Consumption for Electric Heavy-Duty Vehiclescited by 0
- 2026Optimal Recourse Summaries via Bi-Objective Decision Tree Learningcited by 0
- 2026Optimal Recourse Summaries via Bi-Objective Decision Tree Learning8 May 2026
- 2024Interpretable Clustering: A Survey1 Sep 2024
- 2024Explaining Kernel Clustering via Decision Trees15 Feb 2024
- 2023Forecasting Auxiliary Energy Consumption for Electric Heavy-Duty Vehicles27 Nov 2023
- 2022Algorithm-Agnostic Interpretations for Clustering21 Sep 2022
- 2021Shallow decision trees for explainable k-means clustering29 Dec 2021
- 2021Explainable k-means. Don't be greedy, plant bigger trees!4 Nov 2021
- 2021Near-optimal Algorithms for Explainable k-Medians and k-Means2 Jul 2021
- 2021Near-Optimal Explainable k-Means for All Dimensions29 Jun 2021
- 2021Algorithm-Agnostic Explainability for Unsupervised Clustering17 May 2021