ScholarGate
어시스턴트

방법 비교

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

앙상블 K-평균×준지도 HDBSCAN×
분야머신러닝머신러닝
계열Machine learningMachine learning
기원 연도20022017–present
창시자Strehl, A. & Ghosh, J.McInnes, L.; Healy, J. (base HDBSCAN); semi-supervised extensions by various authors
유형Ensemble clustering (consensus aggregation of K-means partitions)Semi-supervised density-based clustering
원전Strehl, A. & Ghosh, J. (2002). Cluster ensembles — a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583–617. link ↗McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI ↗
별칭consensus K-means, K-means ensemble clustering, cluster ensemble with K-means, EKMConstrained HDBSCAN, Semi-supervised hierarchical density clustering, HDBSCAN with partial labels, SS-HDBSCAN
관련36
요약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.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.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

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

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