השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| תיקוף מקוון (Online Bagging)× | Boosting מקוון× | |
|---|---|---|
| תחום | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning |
| שנת המקור | 2001 | 2001 |
| הוגה השיטה | Oza, N. C. & Russell, S. | Oza, N. C. & Russell, S. |
| סוג≠ | Online ensemble (streaming bagging) | Online ensemble (incremental boosting) |
| מקור מכונן≠ | Oza, N. C., & Russell, S. (2001). Online bagging and boosting. In Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics (AISTATS 2001), pp. 105–112. link ↗ | Oza, N. C., & Russell, S. (2001). Online Bagging and Boosting. In Artificial Intelligence and Statistics 2001 (pp. 105–112). Morgan Kaufmann. link ↗ |
| כינויים | incremental bagging, streaming bagging, online bootstrap aggregating, OzaBag | streaming boosting, incremental boosting, online AdaBoost, online ensemble boosting |
| קשורות≠ | 4 | 6 |
| תקציר≠ | Online Bagging is a streaming ensemble method introduced by Oza and Russell in 2001 that adapts the classical bootstrap aggregating (Bagging) framework to the online learning setting. Instead of resampling a fixed dataset, each incoming instance is fed to every base learner a Poisson(1)-distributed number of times, faithfully approximating bootstrap sampling as the stream evolves. The result is a robust, incrementally updated ensemble that can handle concept drift and continuous data arrival without storing the entire dataset. | Online Boosting adapts the classical boosting framework to data streams, updating an ensemble of weak learners one example at a time without storing the full dataset. The Oza-Russell formulation approximates AdaBoost's reweighting using Poisson-sampled instance counts, enabling accurate, adaptive classification in real-time or resource-constrained environments. |
| ScholarGateמערך נתונים ↗ |
|
|