ScholarGate
Avustaja

Vertaile menetelmiä

Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.

Ensemble HDBSCAN×Ensemble K-means×HDBSCAN×
TieteenalaKoneoppiminenKoneoppiminenKoneoppiminen
MenetelmäperheMachine learningMachine learningMachine learning
Syntyvuosi2011–201720022013
KehittäjäVega-Pons, S. & Ruiz-Shulcloper, J. (ensemble clustering framework); McInnes, L. et al. (HDBSCAN base)Strehl, A. & Ghosh, J.Campello, R. J. G. B.; Moulavi, D.; Sander, J.
TyyppiConsensus clustering ensembleEnsemble clustering (consensus aggregation of K-means partitions)Hierarchical density-based clustering
AlkuperäislähdeMcInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI ↗Strehl, A. & Ghosh, J. (2002). Cluster ensembles — a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583–617. 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 ↗
RinnakkaisnimetHDBSCAN ensemble clustering, consensus HDBSCAN, multi-run HDBSCAN, cluster ensemble HDBSCANconsensus K-means, K-means ensemble clustering, cluster ensemble with K-means, EKMHDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*
Liittyvät433
TiivistelmäEnsemble 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.Ensemble K-means runs K-means clustering many times under varied initializations, random seeds, or feature subsets, then aggregates the resulting partitions into a single consensus assignment. This approach reduces K-means' well-known sensitivity to initialization and produces more stable, reproducible clusters than any single run.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.
ScholarGateAineisto
  1. v1
  2. 2 Lähteet
  3. PUBLISHED
  1. v1
  2. 2 Lähteet
  3. PUBLISHED
  1. v1
  2. 3 Lähteet
  3. PUBLISHED

Siirry hakuun Lataa diat

ScholarGateVertaile menetelmiä: Ensemble HDBSCAN · Ensemble K-means · HDBSCAN. Haettu 2026-06-19 osoitteesta https://scholargate.app/fi/compare