방법 비교

	K-평균 군집화	랜덤 포레스트
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1967	2001
창시자	MacQueen, J.	Breiman, L.
유형	Partitional clustering (centroid-based)	Ensemble (bagging of decision trees)
원전	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.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	3	4
요약	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.	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.