방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 랜덤 포레스트× | 서포트 벡터 머신 (분류)× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2001 | 1995 |
| 창시자≠ | Breiman, L. | Cortes, C. & Vapnik, V. |
| 유형≠ | Ensemble (bagging of decision trees) | Maximum-margin classifier (kernel method) |
| 원전≠ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297. DOI ↗ |
| 별칭 | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier |
| 관련≠ | 4 | 5 |
| 요약≠ | 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. | The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data. |
| ScholarGate데이터셋 ↗ |
|
|