방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 온라인 서포트 벡터 머신× | 온라인 그래디언트 부스팅× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2005–2011 | 2011–2015 |
| 창시자≠ | Shalev-Shwartz, Singer, et al. (Pegasos); Bordes, Bottou et al. (LASVM) | Grubb, A. & Bagnell, J. A.; Beygelzimer, A. et al. |
| 유형≠ | Online kernel classifier | Online ensemble (sequential boosting on streaming data) |
| 원전≠ | Shalev-Shwartz, S., Singer, Y., Srebro, N., & Cotter, A. (2011). Pegasos: Primal estimated sub-gradient solver for SVM. Mathematical Programming, 127(1), 3–30. DOI ↗ | Grubb, A. & Bagnell, J. A. (2011). Generalized Boosting Algorithms for Convex Optimization. Proceedings of the 28th International Conference on Machine Learning (ICML 2011), 1209–1216. link ↗ |
| 별칭 | Online SVM, Incremental SVM, LASVM, Pegasos SVM | OGB, streaming gradient boosting, incremental gradient boosting, online boosting with gradient descent |
| 관련≠ | 3 | 6 |
| 요약≠ | Online SVM adapts the classical support vector machine to streaming or sequentially arriving data by updating the decision boundary one example at a time rather than solving a global quadratic program. Algorithms such as Pegasos and LASVM make this tractable at large scale, preserving the margin-maximising spirit of SVMs with sub-linear time per update. | Online Gradient Boosting adapts the gradient boosting framework for streaming settings where data arrives one sample at a time rather than as a fixed batch. At each step the model computes a pseudo-residual for the incoming observation and updates a weak learner in place, growing an additive ensemble without storing or revisiting past data. This makes it suitable for real-time prediction and large-scale streaming pipelines where retraining from scratch is infeasible. |
| ScholarGate데이터셋 ↗ |
|
|