ExKMC
Expanding Explainable K-Means Clustering
view repo
Clustering is a popular form of unsupervised learning for geometric data. Unfortunately, many clustering algorithms lead to cluster assignments that are hard to explain, partially because they depend on all the features of the data in a complicated way. To improve interpretability, we consider using a small decision tree to partition a data set into clusters, so that clusters can be characterized in a straightforward manner. We study this problem from a theoretical viewpoint, measuring cluster quality by the k-means and k-medians objectives: Must there exist a tree-induced clustering whose cost is comparable to that of the best unconstrained clustering, and if so, how can it be found? In terms of negative results, we show, first, that popular top-down decision tree algorithms may lead to clusterings with arbitrarily large cost, and second, that any tree-induced clustering must in general incur an Ω(log k) approximation factor compared to the optimal clustering. On the positive side, we design an efficient algorithm that produces explainable clusters using a tree with k leaves. For two means/medians, we show that a single threshold cut suffices to achieve a constant factor approximation, and we give nearly-matching lower bounds. For general k ≥ 2, our algorithm is an O(k) approximation to the optimal k-medians and an O(k^2) approximation to the optimal k-means. Prior to our work, no algorithms were known with provable guarantees independent of dimension and input size.
READ FULL TEXT
We provide a new bi-criteria Õ(log^2 k) competitive algorithm for
explai...
read it
Despite the popularity of explainable AI, there is limited work on effec...
read it
We study Ward's method for the hierarchical k-means problem. This popula...
read it
k-means clustering is a well-studied problem due to its wide applicabili...
read it
Many clustering algorithms are guided by certain cost functions such as ...
read it
Decision theoretical troubleshooting is about minimizing the expected co...
read it
Differential performance debugging is a technique to find performance
pr...
read it
Expanding Explainable K-Means Clustering
None
My python implementation of the "Iterative Mistake Minimization" algorithm, an explainable approximation of the k-means clustering algorithm proposed in https://arxiv.org/abs/2002.12538. Hoping to add some more functionality to this and get it on pip within the next year!
Comments
There are no comments yet.