Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Online röstningsensemble× | Online Learning× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2001–2009 | 1958–2000s |
| Upphovsperson≠ | Oza, N. C. & Russell, S.; extended by Bifet et al. | Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors) |
| Typ≠ | Online ensemble (incremental majority vote) | Learning paradigm (sequential model update) |
| Ursprungskälla≠ | 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. 229–236. link ↗ | Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗ |
| Alias | streaming voting ensemble, incremental voting ensemble, online majority-vote ensemble, data-stream voting classifier | incremental learning, sequential learning, streaming learning, online machine learning |
| Närliggande | 6 | 6 |
| Sammanfattning≠ | Online Voting Ensemble is an incremental ensemble method that maintains a pool of base classifiers — each updated continuously on arriving data — and combines their predictions through a weighted or unweighted majority vote. Designed for data streams, it adapts to non-stationary distributions without retraining from scratch, making it well-suited to real-time classification tasks where data arrives sequentially and concept drift may occur. | Online learning is a machine learning paradigm in which a model is updated incrementally as each new data point arrives, rather than being trained once on a fixed dataset. It is essential when data streams continuously, storage is limited, or the underlying distribution shifts over time. Theoretical performance is measured by cumulative regret relative to the best fixed predictor in hindsight. |
| ScholarGateDatamängd ↗ |
|
|