পদ্ধতির তুলনা করুন

	Ensemble HDBSCAN	এনসেম্বল কে-মিনস	HDBSCAN
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning	Machine learning
উদ্ভবের বছর	2011–2017	2002	2013
প্রবর্তক	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.
ধরন	Consensus clustering ensemble	Ensemble clustering (consensus aggregation of K-means partitions)	Hierarchical density-based clustering
মৌলিক উৎস	McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205.	Strehl, A. & Ghosh, J. (2002). Cluster ensembles — a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583–617.	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.
অপর নাম	HDBSCAN ensemble clustering, consensus HDBSCAN, multi-run HDBSCAN, cluster ensemble HDBSCAN	consensus K-means, K-means ensemble clustering, cluster ensemble with K-means, EKM	HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*
সম্পর্কিত	4	3	3
সারসংক্ষেপ	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.