ScholarGate
어시스턴트

방법 비교

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

준지도 HDBSCAN×준지도 학습 K-평균 (Semi-supervised K-means)×
분야머신러닝머신러닝
계열Machine learningMachine learning
기원 연도2017–present2001–2002
창시자McInnes, L.; Healy, J. (base HDBSCAN); semi-supervised extensions by various authorsWagstaff, K. et al. (constrained); Basu, S. et al. (seeded)
유형Semi-supervised density-based clusteringSemi-supervised clustering
원전McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI ↗Wagstaff, K., Cardie, C., Rogers, S., & Schroedl, S. (2001). Constrained K-means Clustering with Background Knowledge. In Proceedings of the 18th International Conference on Machine Learning (ICML 2001), pp. 577–584. link ↗
별칭Constrained HDBSCAN, Semi-supervised hierarchical density clustering, HDBSCAN with partial labels, SS-HDBSCANconstrained K-means, seeded K-means, partially supervised K-means, SS-K-means
관련65
요약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.Semi-supervised K-means extends standard K-means clustering by incorporating partial supervision — either a small set of labeled seed points or pairwise must-link and cannot-link constraints — to guide cluster formation. It bridges unsupervised clustering and fully supervised classification, enabling more meaningful clusters when labels are scarce but costly to obtain in full.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

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

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