পদ্ধতির তুলনা করুন

	স্ব-পর্যবেক্ষিত কে-মিনস (Self-supervised K-means)	অনলাইন কে-মিনস
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2018	1967 (online update rule); 2010 (mini-batch variant)
প্রবর্তক	Caron, M. et al. (DeepCluster framework)	MacQueen, J. (batch); Sculley, D. (mini-batch web-scale variant)
ধরন	Self-supervised clustering	Unsupervised clustering (online/streaming)
মৌলিক উৎস	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.	MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1, pp. 281–297. University of California Press.
অপর নাম	self-supervised clustering with K-means, deep clustering with K-means, unsupervised K-means with pseudo-labels, SSL K-means	sequential k-means, streaming k-means, incremental k-means, online clustering
সম্পর্কিত	5	4
সারসংক্ষেপ	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.	Online K-means is a streaming variant of the classical K-means algorithm that updates cluster centroids one observation at a time — or in small mini-batches — without storing the entire dataset in memory. It is particularly suited to large-scale, real-time, or continuously arriving data where batch recomputation would be too slow or impractical.