Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| DBSCAN× | Support Vector Machine (Klassificering)× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1996 | 1995 |
| Upphovsperson≠ | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. | Cortes, C. & Vapnik, V. |
| Typ≠ | Density-based clustering algorithm | Maximum-margin classifier (kernel method) |
| Ursprungskälla≠ | 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 ↗ | Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297. DOI ↗ |
| Alias≠ | DBSCAN Kümeleme, density-based clustering, density-based spatial clustering | Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier |
| Närliggande≠ | 3 | 5 |
| Sammanfattning≠ | 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. | 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. |
| ScholarGateDatamängd ↗ |
|
|