Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| DBSCAN× | Случайна гора× | Методът на опорните вектори (класификация)× | |
|---|---|---|---|
| Област | Машинно обучение | Машинно обучение | Машинно обучение |
| Семейство | Machine learning | Machine learning | Machine learning |
| Година на възникване≠ | 1996 | 2001 | 1995 |
| Създател≠ | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. | Breiman, L. | Cortes, C. & Vapnik, V. |
| Тип≠ | Density-based clustering algorithm | Ensemble (bagging of decision trees) | Maximum-margin classifier (kernel method) |
| Основополагащ източник≠ | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231. link ↗ | 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 ↗ |
| Други названия≠ | DBSCAN Kümeleme, density-based clustering, density-based spatial clustering | 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 |
| Свързани≠ | 3 | 4 | 5 |
| Резюме≠ | DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes. | 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Набор от данни ↗ |
|
|
|