Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Pădurea Aleatoare (Random Forest)× | Arbore de decizie× | Mașina cu Vectori Suport (Clasificare)× | |
|---|---|---|---|
| Domeniu | Învățare automată | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning | Machine learning |
| Anul apariției≠ | 2001 | 1984 | 1995 |
| Autorul original≠ | Breiman, L. | Breiman, Friedman, Olshen & Stone | Cortes, C. & Vapnik, V. |
| Tip≠ | Ensemble (bagging of decision trees) | Recursive partitioning (if-then rules) | Maximum-margin classifier (kernel method) |
| Sursa seminală≠ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ | Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297. DOI ↗ |
| Denumiri alternative≠ | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier |
| Înrudite≠ | 4 | 5 | 5 |
| Rezumat≠ | 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. | A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf. | 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. |
| ScholarGateSet de date ↗ |
|
|
|