Comparison between IMM and Ex-Greedy algorithms for explainable (decision-tree-induced) clustering

This repository implements an explainable clustering algorithm for the minimization of the sum of squared Euclidean distances between data points and its representatives. The results of the Ex-Greedy algorithm are compared to those of the IMM algorithm found in ExKMC: Expanding Explainable k-Means Clustering.

To reproduce the results, please run the notebook in the ExKMC folder.