Jämför metoder

	Förklaringsbar K-medelvärden	Beslutsträd	K-Means-klustring
Ämnesområde	Maskininlärning	Maskininlärning	Maskininlärning
Familj	Machine learning	Machine learning	Machine learning
Ursprungsår	2020	1984	1967
Upphovsperson	Dasgupta, S.; Moshkovitz, M.; Frost, N.; Rashtchian, C.	Breiman, Friedman, Olshen & Stone	MacQueen, J.
Typ	Explainable unsupervised clustering algorithm	Recursive partitioning (if-then rules)	Partitional clustering (centroid-based)
Ursprungskälla	Dasgupta, S., Frost, N., Moshkovitz, M., & Rashtchian, C. (2020). Explainability of k-Means Clustering. Proceedings of the 37th International Conference on Machine Learning (ICML), PMLR 119.	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297.
Alias	ExKMC, interpretable k-means, decision-tree k-means, explainable clustering	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering
Närliggande	5	5	3
Sammanfattning	Explainable K-Means is a post-hoc and in-model interpretability approach to standard K-Means clustering that replaces or approximates cluster assignments with a small axis-aligned decision tree. Each leaf of the tree corresponds to one cluster, and every data point is assigned to a cluster by following a simple sequence of threshold rules on individual features — making cluster membership fully transparent and human-readable.	A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.	K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis.