방법 비교

	설명 가능한 K-평균	랜덤 포레스트
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2020	2001
창시자	Dasgupta, S.; Moshkovitz, M.; Frost, N.; Rashtchian, C.	Breiman, L.
유형	Explainable unsupervised clustering algorithm	Ensemble (bagging of decision trees)
원전	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. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	ExKMC, interpretable k-means, decision-tree k-means, explainable clustering	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	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.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.