Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| SVM bayesian de o singură clasă× | Proces Gaussian× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2001–2010 | 2006 (book); roots in Kriging, 1951) |
| Autorul original≠ | Scholkopf et al. (base OCSVM); Bayesian extension via Tipping and others | Rasmussen, C. E. & Williams, C. K. I. |
| Tip≠ | Probabilistic anomaly detection | Probabilistic non-parametric model |
| Sursa seminală≠ | 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 ↗ | Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9 |
| Denumiri alternative | Bayesian OCSVM, Bayesian one-class classifier, probabilistic one-class SVM, Bayes-OCSVM | GP, Gaussian Process Regression, GPR, Kriging |
| Înrudite≠ | 6 | 3 |
| Rezumat≠ | Bayesian one-class SVM combines the classical one-class support vector machine — which learns a tight boundary around normal training examples — with Bayesian inference to produce calibrated probability estimates of anomaly, rather than only a binary flag. This allows uncertainty quantification over the novelty decision, making the approach more suitable when downstream actions depend on how confident the model is that a new observation is anomalous. | A Gaussian Process (GP) is a non-parametric, fully probabilistic machine learning model that places a prior distribution directly over functions. Rather than predicting a single value, it returns a predictive mean and a calibrated uncertainty estimate at every test point, making it especially valuable for regression on small to medium datasets and for Bayesian optimization tasks. |
| ScholarGateSet de date ↗ |
|
|