方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 在线 DBSCAN× | 在线高斯混合模型× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1998 | 2000–2009 |
| 提出者≠ | Ester, M., Kriegel, H.-P., Sander, J., Wimmer, M., & Xu, X. | Cappé, O. & Moulines, E. (online EM formulation) |
| 类型≠ | Incremental density-based clustering | Probabilistic clustering / density estimation (incremental) |
| 开创性文献≠ | 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 ↗ | Cappé, O. & Moulines, E. (2009). On-line expectation-maximization algorithm for latent data models. Journal of the Royal Statistical Society: Series B, 71(3), 593–613. DOI ↗ |
| 别名 | Incremental DBSCAN, Streaming DBSCAN, Online density-based clustering, iDBSCAN | Online GMM, Incremental GMM, Streaming Gaussian Mixture Model, Sequential GMM |
| 相关 | 5 | 5 |
| 摘要≠ | 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 Gaussian Mixture Model adapts the classic GMM to streaming or large-scale data by replacing full-batch EM with incremental updates — processing one observation or mini-batch at a time and continuously refining component means, covariances, and mixing weights without revisiting the entire dataset. |
| ScholarGate数据集 ↗ |
|
|