Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| HDBSCAN semi-supervizat× | DBSCAN semi-supervizat× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2017–present | 2000s |
| Autorul original≠ | McInnes, L.; Healy, J. (base HDBSCAN); semi-supervised extensions by various authors | Ester, M. et al. (DBSCAN base); semi-supervised extensions by multiple authors (2000s–2010s) |
| Tip≠ | Semi-supervised density-based clustering | Constrained density-based clustering |
| Sursa seminală≠ | McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI ↗ | Ester, M., Kriegel, H.-P., Sander, J., & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), pp. 226–231. AAAI Press. link ↗ |
| Denumiri alternative | Constrained HDBSCAN, Semi-supervised hierarchical density clustering, HDBSCAN with partial labels, SS-HDBSCAN | Constrained DBSCAN, SS-DBSCAN, DBSCAN with must-link/cannot-link constraints, seeded DBSCAN |
| Înrudite≠ | 6 | 5 |
| Rezumat≠ | Semi-supervised HDBSCAN extends the Hierarchical Density-Based Spatial Clustering of Applications with Noise (HDBSCAN) algorithm by incorporating partial supervision — such as must-link and cannot-link pairwise constraints or a small set of labeled examples — to guide the density-based cluster hierarchy toward cluster assignments that are consistent with available domain knowledge. | Semi-supervised DBSCAN extends the canonical density-based clustering algorithm (Ester et al., 1996) by incorporating a small set of pairwise or label constraints — must-link pairs that must share a cluster, cannot-link pairs that must be separated, or a handful of known labels — to guide cluster formation while retaining DBSCAN's ability to discover arbitrary-shaped clusters and flag noise points. |
| ScholarGateSet de date ↗ |
|
|