ScholarGate
Msaidizi
Machine learningMachine learning

K-means chenye kujisomesha

K-means chenye kujisomesha ni mbinu ya kuunganisha ambayo inachanganya mgawo wa K-means na ujifunzaji wa uwakilishi chenye kujisomesha. Kifani huchagua kati ya kuunganisha vipengele vya data visivyo na lebo katika vikundi K na kutumia mgawo huo wa kuunganisha kama lebo bandia ili kuboresha uwakilishi wa kipengele cha msingi, na kuzalisha vikundi vinavyozidi kuwa vya umoja bila ukweli wowote uliowekwa na binadamu.

Fungua katika MethodMindHivi karibuniVideoHivi karibuniDownload slides

Soma mbinu kamili

Kwa wanachama pekee

Ingia kwa akaunti ya bure ili kusoma sehemu hii.

Ingia

Method map

The neighbourhood of related methods — select a node to explore.

Vyanzo

  1. 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
  2. Self-supervised learning. Wikipedia. link

Jinsi ya kunukuu ukurasa huu

ScholarGate. (2026, June 3). Self-supervised K-means Clustering. ScholarGate. https://scholargate.app/sw/machine-learning/self-supervised-k-means

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side
ScholarGateSelf-supervised K-means (Self-supervised K-means Clustering). Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/machine-learning/self-supervised-k-means · Seti ya data: https://doi.org/10.5281/zenodo.20539026