Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Онлайн-наївний Баєс× | Онлайн-навчання× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2000s | 1958–2000s |
| Автор методу≠ | Adapted from traditional Naive Bayes; incremental form established by the data-stream mining community (Domingos, Hulten, and others, circa 2000) | Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors) |
| Тип≠ | Probabilistic classifier (online/incremental) | Learning paradigm (sequential model update) |
| Основоположне джерело≠ | Domingos, P. & Hulten, G. (2000). Mining high-speed data streams. Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 71–80. ACM. DOI ↗ | Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗ |
| Інші назви | Incremental Naive Bayes, Streaming Naive Bayes, Naive Bayes with partial_fit, Online NB | incremental learning, sequential learning, streaming learning, online machine learning |
| Пов'язані | 6 | 6 |
| Підсумок≠ | Online Naive Bayes is an incremental adaptation of the classical Naive Bayes classifier that updates its class-conditional statistics one observation (or one mini-batch) at a time, making it well suited to data streams, very large datasets that cannot be held in memory, and settings where the model must adapt continuously as new labeled examples arrive. | 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. |
| ScholarGateНабір даних ↗ |
|
|