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.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
+6 more
Vyanzo
- 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.
- Ngeli ya Kiwango cha Juu (Hierarchical Clustering)Ujifunzaji wa Mashine↔ compare
- Uchambuzi wa Utenganishaji wa Mstari (LDATakwimu↔ compare
- Msitu NasibuUjifunzaji wa Mashine↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →