ScholarGate
Msaidizi
Machine learning

K-Means Clustering

K-Means Clustering ni algorithmu ya kugawanya data katika makundi kulingana na vituo (centroid-based partitional clustering algorithm), iliyoanzia kwa J. MacQueen mwaka 1967, ambayo hugawanya data katika makundi k kwa kuweka kila kipimo kwa kituo cha kundi kilicho karibu zaidi. Inatumika sana kwa ajili ya kugawanya wateja sokoni, kuweka wateja katika vikundi, na uchambuzi wa uchunguzi.

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.

+6 more

Vyanzo

  1. MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297. link

Jinsi ya kunukuu ukurasa huu

ScholarGate. (2026, June 1). K-Means Clustering (Lloyd–MacQueen Algorithm). ScholarGate. https://scholargate.app/sw/machine-learning/k-means-clustering

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

Imerejelewa na

ScholarGateK-Means Clustering (K-Means Clustering (Lloyd–MacQueen Algorithm)). Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/machine-learning/k-means-clustering · Seti ya data: https://doi.org/10.5281/zenodo.20539026