Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Självövervakad Isolation Forest× | One-class SVM× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2008–2020s | 1999–2001 |
| Upphovsperson≠ | Liu, F. T., Ting, K. M., & Zhou, Z.-H. (iForest); SSL extensions by multiple authors | Scholkopf, B., Platt, J. C., Smola, A. J., Williamson, R. C. |
| Typ≠ | Ensemble anomaly detector with self-supervised pre-training | Anomaly / novelty detection (unsupervised) |
| Ursprungskälla≠ | Liu, F. T., Ting, K. M., & Zhou, Z.-H. (2008). Isolation Forest. In Proceedings of the 8th IEEE International Conference on Data Mining (ICDM), pp. 413–422. DOI ↗ | 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 ↗ |
| Alias | SSL Isolation Forest, self-supervised iForest, semi-supervised isolation forest, contrastive isolation forest | OCSVM, one-class support vector machine, novelty SVM, unsupervised SVM |
| Närliggande≠ | 4 | 3 |
| Sammanfattning≠ | Self-supervised Isolation Forest augments the classic Isolation Forest anomaly detector with a self-supervised pre-training stage. A pretext task — such as predicting rotation, masked features, or contrastive pairs — is solved without labels to learn a richer feature representation, which is then used when building the isolation trees, yielding sharper anomaly scores on complex, high-dimensional tabular data. | 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. |
| ScholarGateDatamängd ↗ |
|
|