ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

التجميع الهرمي الكثافي شبه المُشرف عليه (Semi-supervised HDBSCAN)×DBSCAN×HDBSCAN×تجميع K-means×
المجالتعلم الآلةتعلم الآلةتعلم الآلةتعلم الآلة
العائلةMachine learningMachine learningMachine learningMachine learning
سنة النشأة2017–present199620131967 (formalized 1982)
صاحب الطريقةMcInnes, L.; Healy, J. (base HDBSCAN); semi-supervised extensions by various authorsEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Campello, R. J. G. B.; Moulavi, D.; Sander, J.MacQueen, J. B.; Lloyd, S. P.
النوعSemi-supervised density-based clusteringDensity-based clustering algorithmHierarchical density-based clusteringPartitional clustering
المصدر التأسيسي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 ↗Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗
الأسماء البديلةConstrained HDBSCAN, Semi-supervised hierarchical density clustering, HDBSCAN with partial labels, SS-HDBSCANDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringHDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
ذات صلة6334
الملخص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.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.
ScholarGateمجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 1 المصادر
  3. PUBLISHED
  1. v1
  2. 3 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Semi-supervised HDBSCAN · DBSCAN · HDBSCAN · K-means. استُرجع بتاريخ 2026-06-18 من https://scholargate.app/ar/compare