ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

준지도 HDBSCAN×DBSCAN×K-means 군집화×
분야머신러닝머신러닝머신러닝
계열Machine learningMachine learningMachine learning
기원 연도2017–present19961967 (formalized 1982)
창시자McInnes, L.; Healy, J. (base HDBSCAN); semi-supervised extensions by various authorsEster, M., Kriegel, H.-P., Sander, J. & Xu, X.MacQueen, J. B.; Lloyd, S. P.
유형Semi-supervised density-based clusteringDensity-based clustering algorithmPartitional 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 ↗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 clusteringk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
관련634
요약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.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. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Semi-supervised HDBSCAN · DBSCAN · K-means. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare