방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 베이지안 단일 클래스 SVM× | 가우시안 프로세스× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2001–2010 | 2006 (book); roots in Kriging, 1951) |
| 창시자≠ | Scholkopf et al. (base OCSVM); Bayesian extension via Tipping and others | Rasmussen, C. E. & Williams, C. K. I. |
| 유형≠ | Probabilistic anomaly detection | Probabilistic non-parametric model |
| 원전≠ | 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 |
| 별칭 | Bayesian OCSVM, Bayesian one-class classifier, probabilistic one-class SVM, Bayes-OCSVM | GP, Gaussian Process Regression, GPR, Kriging |
| 관련≠ | 6 | 3 |
| 요약≠ | 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. |
| ScholarGate데이터셋 ↗ |
|
|