השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| DBSCAN× | מכונת וקטורים תומכים חד-מחלקתית (One-Class SVM)× | |
|---|---|---|
| תחום | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 1996 | 1999–2001 |
| הוגה השיטה≠ | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. | Scholkopf, B., Platt, J. C., Smola, A. J., Williamson, R. C. |
| סוג≠ | Density-based clustering algorithm | Anomaly / novelty detection (unsupervised) |
| מקור מכונן≠ | 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 ↗ | Scholkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001). Estimating the support of a high-dimensional distribution. Neural Computation, 13(7), 1443–1471. DOI ↗ |
| כינויים≠ | DBSCAN Kümeleme, density-based clustering, density-based spatial clustering | OCSVM, one-class support vector machine, novelty SVM, unsupervised SVM |
| קשורות | 3 | 3 |
| תקציר≠ | 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. | One-class SVM is an unsupervised anomaly and novelty detection algorithm that learns a tight boundary around normal training data in a kernel-induced feature space, flagging new observations that fall outside that boundary as outliers. Introduced by Scholkopf et al. in 1999–2001, it extends the SVM framework to the single-class setting where no labelled anomalies are available. |
| ScholarGateמערך נתונים ↗ |
|
|