विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| ऑनलाइन बैगिंग× | बैगिंग (बूटस्ट्रैप एग्रीगेटिंग)× | |
|---|---|---|
| क्षेत्र | मशीन अधिगम | मशीन अधिगम |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 2001 | 1996 |
| प्रवर्तक≠ | Oza, N. C. & Russell, S. | Breiman, L. |
| प्रकार≠ | Online ensemble (streaming bagging) | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) |
| मौलिक स्रोत≠ | 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 ↗ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ |
| उपनाम≠ | incremental bagging, streaming bagging, online bootstrap aggregating, OzaBag | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor |
| संबंधित≠ | 4 | 5 |
| सारांश≠ | 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. | Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner. |
| ScholarGateडेटासेट ↗ |
|
|