Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| HDBSCAN semi-supervisé× | DBSCAN× | HDBSCAN× | DBSCAN semi-supervisé× | |
|---|---|---|---|---|
| Domaine | Apprentissage automatique | Apprentissage automatique | Apprentissage automatique | Apprentissage automatique |
| Famille | Machine learning | Machine learning | Machine learning | Machine learning |
| Année d'origine≠ | 2017–present | 1996 | 2013 | 2000s |
| Auteur d'origine≠ | McInnes, L.; Healy, J. (base HDBSCAN); semi-supervised extensions by various authors | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. | Campello, R. J. G. B.; Moulavi, D.; Sander, J. | Ester, M. et al. (DBSCAN base); semi-supervised extensions by multiple authors (2000s–2010s) |
| Type≠ | Semi-supervised density-based clustering | Density-based clustering algorithm | Hierarchical density-based clustering | Constrained density-based clustering |
| Source fondatrice≠ | 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. Proceedings of the 2nd KDD, 226–231. link ↗ | Campello, R. J. G. B., Moulavi, D., & Sander, J. (2013). Density-Based Clustering Based on Hierarchical Density Estimates. In J. Pei et al. (Eds.), Advances in Knowledge Discovery and Data Mining. PAKDD 2013. Lecture Notes in Computer Science, vol. 7819 (pp. 160–172). Springer, Berlin, Heidelberg. 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 ↗ |
| Alias≠ | Constrained HDBSCAN, Semi-supervised hierarchical density clustering, HDBSCAN with partial labels, SS-HDBSCAN | DBSCAN Kümeleme, density-based clustering, density-based spatial clustering | HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN* | Constrained DBSCAN, SS-DBSCAN, DBSCAN with must-link/cannot-link constraints, seeded DBSCAN |
| Apparentées≠ | 6 | 3 | 3 | 5 |
| Résumé≠ | 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. | DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes. | HDBSCAN (Hierarchical Density-Based Spatial Clustering of Applications with Noise) is a density-based clustering algorithm introduced by Campello, Moulavi, and Sander in 2013. It extends DBSCAN by building a full hierarchy of density-based clusters across all density scales and then extracting a stable flat partition, making it robust to datasets where cluster densities vary substantially across regions. | 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. |
| ScholarGateJeu de données ↗ |
|
|
|
|