방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 자기 지도 K-평균× | 앙상블 K-평균× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2018 | 2002 |
| 창시자≠ | Caron, M. et al. (DeepCluster framework) | Strehl, A. & Ghosh, J. |
| 유형≠ | Self-supervised clustering | Ensemble clustering (consensus aggregation of K-means partitions) |
| 원전≠ | Caron, M., Bojanowski, P., Joulin, A., & Douze, M. (2018). Deep Clustering for Unsupervised Learning of Visual Features. In Proceedings of the European Conference on Computer Vision (ECCV), 132–149. link ↗ | Strehl, A. & Ghosh, J. (2002). Cluster ensembles — a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583–617. link ↗ |
| 별칭 | self-supervised clustering with K-means, deep clustering with K-means, unsupervised K-means with pseudo-labels, SSL K-means | consensus K-means, K-means ensemble clustering, cluster ensemble with K-means, EKM |
| 관련≠ | 5 | 3 |
| 요약≠ | Self-supervised K-means is a clustering technique that combines K-means assignment with self-supervised representation learning. The model alternates between clustering unlabeled data points into K groups and using those cluster assignments as pseudo-labels to refine an underlying feature representation, yielding increasingly coherent clusters without any human-annotated ground truth. | 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. |
| ScholarGate데이터셋 ↗ |
|
|