Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Ensemble HDBSCAN× | Învățare online× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2011–2017 | 1958–2000s |
| Autorul original≠ | Vega-Pons, S. & Ruiz-Shulcloper, J. (ensemble clustering framework); McInnes, L. et al. (HDBSCAN base) | Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors) |
| Tip≠ | Consensus clustering ensemble | Learning paradigm (sequential model update) |
| Sursa seminală≠ | McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI ↗ | Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗ |
| Denumiri alternative | HDBSCAN ensemble clustering, consensus HDBSCAN, multi-run HDBSCAN, cluster ensemble HDBSCAN | incremental learning, sequential learning, streaming learning, online machine learning |
| Înrudite≠ | 4 | 6 |
| Rezumat≠ | Ensemble HDBSCAN runs HDBSCAN multiple times under different hyperparameter settings or data subsamples and combines the resulting partitions into a single stable consensus clustering. Because HDBSCAN is sensitive to its minimum cluster size and minimum samples parameters, pooling multiple runs greatly reduces sensitivity to any single configuration and yields more reproducible cluster assignments on noisy, high-dimensional data. | 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. |
| ScholarGateSet de date ↗ |
|
|