方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 在线朴素贝叶斯× | 在线学习× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | 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数据集 ↗ |
|
|