ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Samonadzorovani K-means×Ensemble K-means×
PodručjeStrojno učenjeStrojno učenje
ObiteljMachine learningMachine learning
Godina nastanka20182002
TvoracCaron, M. et al. (DeepCluster framework)Strehl, A. & Ghosh, J.
VrstaSelf-supervised clusteringEnsemble clustering (consensus aggregation of K-means partitions)
Temeljni izvorCaron, 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 ↗
Drugi naziviself-supervised clustering with K-means, deep clustering with K-means, unsupervised K-means with pseudo-labels, SSL K-meansconsensus K-means, K-means ensemble clustering, cluster ensemble with K-means, EKM
Srodne53
SažetakSelf-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.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Self-supervised K-means · Ensemble K-means. Preuzeto 2026-06-18 s https://scholargate.app/hr/compare