방법 비교

	설명 가능한 K-평균	계층적 군집화
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2020	1963
창시자	Dasgupta, S.; Moshkovitz, M.; Frost, N.; Rashtchian, C.	Ward, J. H.
유형	Explainable unsupervised clustering algorithm	Unsupervised clustering (agglomerative)
원전	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.	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.
별칭	ExKMC, interpretable k-means, decision-tree k-means, explainable clustering	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
관련	5	4
요약	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.	Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963.