방법 비교

	K-최근접 이웃	랜덤 포레스트
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1967	2001
창시자	Cover, T.M. & Hart, P.E.	Breiman, L.
유형	Instance-based (non-parametric) learning	Ensemble (bagging of decision trees)
원전	Cover, T.M. & Hart, P.E. (1967). Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), 21–27.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	KNN, K-En Yakın Komşu (KNN), nearest neighbor classifier, instance-based learning	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	5	4
요약	K-Nearest Neighbors (KNN), formalized by Cover and Hart in 1967, is a non-parametric, instance-based method that classifies or predicts a new observation by looking at the k closest examples in the training data. For classification it takes a majority vote among those neighbors; for regression it averages their values.	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.