Interpretable Clustering via Optimal Trees
Dimitris Bertsimas, Agni Orfanoudaki, Holly Wiberg

TL;DR
This paper introduces an interpretable clustering algorithm using optimal trees and mixed integer optimization, providing high-quality, explainable clusters especially useful in healthcare settings.
Contribution
It presents a novel unsupervised learning method that produces globally optimal, interpretable tree-based clusters incorporating mixed data types and internal validation metrics.
Findings
Achieves comparable or better clustering performance than K-Means.
Provides significantly higher interpretability of clustering results.
Automatically determines the optimal number of clusters.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Data Mining Algorithms and Applications · Data Management and Algorithms
