השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| Online HDBSCAN× | למידה מקוונת× | |
|---|---|---|
| תחום | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 2015–2017 | 1958–2000s |
| הוגה השיטה≠ | Campello, R. J. G. B. et al. (base); incremental extensions by Hassani, M. et al. | Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors) |
| סוג≠ | Incremental hierarchical density-based clustering | Learning paradigm (sequential model update) |
| מקור מכונן≠ | Hassani, M., Seidl, T. (2017). Using internal evaluation measures to validate the quality of diverse stream clustering algorithms. Vietnam Journal of Computer Science, 4(3), 171–183. DOI ↗ | Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗ |
| כינויים | incremental HDBSCAN, streaming HDBSCAN, online hierarchical density clustering, dynamic HDBSCAN | incremental learning, sequential learning, streaming learning, online machine learning |
| קשורות | 6 | 6 |
| תקציר≠ | Online HDBSCAN extends the HDBSCAN hierarchical density-based clustering algorithm to incrementally process streaming or sequentially arriving data. Rather than rebuilding the full hierarchy from scratch with each new observation, it maintains and locally updates the mutual reachability graph, minimum spanning tree, condensed cluster tree, and stability-based cluster extraction, enabling continuous density-based clustering without full-dataset reprocessing. | 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מערך נתונים ↗ |
|
|