방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| Robust Gaussian Mixture Model× | One-Class SVM× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2000 | 1999–2001 |
| 창시자≠ | Peel, D. & McLachlan, G. J. | Scholkopf, B., Platt, J. C., Smola, A. J., Williamson, R. C. |
| 유형≠ | Probabilistic clustering / density estimation | Anomaly / novelty detection (unsupervised) |
| 원전≠ | Peel, D. & McLachlan, G. J. (2000). Robust mixture modelling using the t distribution. Statistics and Computing, 10(4), 339–348. 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 ↗ |
| 별칭 | Robust GMM, mixture of t-distributions, trimmed GMM, heavy-tailed mixture model | OCSVM, one-class support vector machine, novelty SVM, unsupervised SVM |
| 관련≠ | 5 | 3 |
| 요약≠ | Robust Gaussian Mixture Model replaces the standard Gaussian components with heavier-tailed distributions — most commonly Student's t-distributions — or incorporates trimming and down-weighting of outliers within the EM framework. The result is a probabilistic clustering and density-estimation method that assigns genuinely anomalous points less influence on component parameters, preventing outliers from distorting cluster shapes or positions. | 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데이터셋 ↗ |
|
|