ScholarGate
Assistant

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×Regroupement par K-moyennes×HDBSCAN semi-supervisé×
DomaineApprentissage automatiqueApprentissage automatiqueApprentissage automatique
FamilleMachine learningMachine learningMachine learning
Année d'origine20131967 (formalized 1982)2017–present
Auteur d'origineCampello, R. J. G. B.; Moulavi, D.; Sander, J.MacQueen, J. B.; Lloyd, S. P.McInnes, L.; Healy, J. (base HDBSCAN); semi-supervised extensions by various authors
TypeHierarchical density-based clusteringPartitional clusteringSemi-supervised density-based clustering
Source fondatriceCampello, 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 ↗Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI ↗
AliasHDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-meansConstrained HDBSCAN, Semi-supervised hierarchical density clustering, HDBSCAN with partial labels, SS-HDBSCAN
Apparentées346
Résumé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.K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis.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.
ScholarGateJeu de données
  1. v1
  2. 3 Sources
  3. PUBLISHED
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 2 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: HDBSCAN · K-means · Semi-supervised HDBSCAN. Consulté le 2026-06-19 sur https://scholargate.app/fr/compare