방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 앙상블 K-최근접 이웃× | 랜덤 포레스트× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2000s | 2001 |
| 창시자≠ | Domeniconi, C. & Yan, B. (key formalization) | Breiman, L. |
| 유형≠ | Ensemble (aggregated KNN classifiers/regressors) | Ensemble (bagging of decision trees) |
| 원전≠ | Domeniconi, C., & Yan, B. (2004). Nearest neighbor ensemble. In Proceedings of the 17th International Conference on Pattern Recognition (ICPR), Vol. 1, pp. 228–231. IEEE. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 별칭 | Ensemble KNN, KNN ensemble, aggregated k-nearest neighbors, combined KNN | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 관련≠ | 5 | 4 |
| 요약≠ | Ensemble K-Nearest Neighbors combines multiple KNN models — each trained with a different value of k, distance metric, feature subset, or data bootstrap — and aggregates their predictions by majority vote (classification) or averaging (regression). The approach reduces the high variance inherent in any single KNN model and produces more stable, accurate predictions on tabular data. | 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. |
| ScholarGate데이터셋 ↗ |
|
|