השוואת שיטות

	One-Class SVM (Support Vector Machine) רובוסטי	מכונת וקטורים תומכים חד-מחלקתית (One-Class SVM)
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	2000s–2010s	1999–2001
הוגה השיטה	Extensions of Scholkopf et al. (1999); robust variants developed in 2000s–2010s	Scholkopf, B., Platt, J. C., Smola, A. J., Williamson, R. C.
סוג	Anomaly detection / novelty detection	Anomaly / novelty detection (unsupervised)
מקור מכונן	Scholkopf, B., Williamson, R., Smola, A., Shawe-Taylor, J., & Platt, J. (1999). Support vector method for novelty detection. Advances in Neural Information Processing Systems (NeurIPS), 12, 582–588.	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.
כינויים	Robust OCSVM, Outlier-robust One-Class SVM, Contamination-tolerant OCSVM, Robust novelty detection SVM	OCSVM, one-class support vector machine, novelty SVM, unsupervised SVM
קשורות	5	3
תקציר	Robust One-Class SVM extends the classic One-Class Support Vector Machine for novelty and anomaly detection by incorporating robustness mechanisms — such as trimmed objectives, robust kernel choices, or contamination-tolerant loss functions — that reduce the influence of heavy-tailed noise or outliers present in the training data, yielding a decision boundary that better represents the true support of the normal class.	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.