ScholarGate
Assistent

Võrdle meetodeid

Vaata valitud meetodeid kõrvuti; erinevad read on esile tõstetud.

Ensemble HDBSCAN×K-keskmiste klasterdamine×
ValdkondMasinõpeMasinõpe
PerekondMachine learningMachine learning
Tekkeaasta2011–20171967 (formalized 1982)
LoojaVega-Pons, S. & Ruiz-Shulcloper, J. (ensemble clustering framework); McInnes, L. et al. (HDBSCAN base)MacQueen, J. B.; Lloyd, S. P.
TüüpConsensus clustering ensemblePartitional clustering
AlgallikasMcInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI ↗Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗
RööpnimetusedHDBSCAN ensemble clustering, consensus HDBSCAN, multi-run HDBSCAN, cluster ensemble HDBSCANk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
Seotud44
KokkuvõteEnsemble 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.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.
ScholarGateAndmestik
  1. v1
  2. 2 Allikad
  3. PUBLISHED
  1. v1
  2. 2 Allikad
  3. PUBLISHED

Mine otsingusse Laadi slaidid alla

ScholarGateVõrdle meetodeid: Ensemble HDBSCAN · K-means. Loetud 2026-06-18 aadressilt https://scholargate.app/et/compare