방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 온라인 원클래스 SVM× | Isolation Forest× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2006 (incremental/online variant); 1999 (base method) | 2008 |
| 창시자≠ | Laskov, P. et al. (incremental extension); Scholkopf, B. et al. (original OC-SVM) | Liu, F.T., Ting, K.M. & Zhou, Z.-H. |
| 유형≠ | Online anomaly detection / novelty detection | Unsupervised ensemble (random partitioning trees) |
| 원전≠ | Laskov, P., Gehl, C., Krueger, S., & Muller, K.-R. (2006). Incremental support vector learning: Analysis, implementation and applications. Journal of Machine Learning Research, 7, 1909–1936. link ↗ | Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗ |
| 별칭≠ | Online OC-SVM, Incremental One-Class SVM, Online SVDD, Sequential One-Class SVM | Isolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection |
| 관련≠ | 4 | 5 |
| 요약≠ | Online One-Class SVM is an incremental extension of the classical One-Class Support Vector Machine that updates its decision boundary as new data arrive one sample at a time, making it suitable for streaming environments and real-time anomaly or novelty detection without retraining from scratch. | Isolation Forest is an unsupervised machine-learning method for anomaly and outlier detection, introduced by Liu, Ting and Zhou in 2008, that isolates anomalies through random partitioning of the data. It works without any labelled anomaly data and scales to high-dimensional datasets. |
| ScholarGate데이터셋 ↗ |
|
|