方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 在线 DBSCAN× | 在线学习× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1998 | 1958–2000s |
| 提出者≠ | Ester, M., Kriegel, H.-P., Sander, J., Wimmer, M., & Xu, X. | Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors) |
| 类型≠ | Incremental density-based clustering | Learning paradigm (sequential model update) |
| 开创性文献≠ | Ester, M., Kriegel, H.-P., Sander, J., Wimmer, M., & Xu, X. (1998). Incremental Clustering for Mining in a Data Warehousing Environment. In Proceedings of the 24th International Conference on Very Large Data Bases (VLDB), pp. 323–333. link ↗ | Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗ |
| 别名 | Incremental DBSCAN, Streaming DBSCAN, Online density-based clustering, iDBSCAN | incremental learning, sequential learning, streaming learning, online machine learning |
| 相关≠ | 5 | 6 |
| 摘要≠ | Online DBSCAN extends the classic density-based clustering algorithm to handle continuously arriving data points without re-clustering the entire dataset from scratch. Each new observation is integrated into the existing cluster structure by local neighborhood queries, making it practical for streaming and data-warehousing scenarios where data grows incrementally. | 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数据集 ↗ |
|
|