Uainishaji wa K-means
K-means ni algorithmu ya kawaida isiyo na msimamizi inayogawanya seti ya data katika vikundi K visivyoingiliana kwa kupeana kila uchunguzi kwa centroid yake iliyo karibu zaidi na kusasisha centroids kama wastani wa alama zao zilizopewa. Ni moja ya zana za uchunguzi zinazotumiwa sana katika akili bandia na uchambuzi wa data.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
+17 more
Vyanzo
- Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI: 10.1109/TIT.1982.1056489 ↗
- MacQueen, J. B. (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 3). K-means Clustering Algorithm. ScholarGate. https://scholargate.app/sw/machine-learning/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.
- DBSCANUjifunzaji wa Mashine↔ compare
- Ngeli ya Kiwango cha Juu (Hierarchical Clustering)Ujifunzaji wa Mashine↔ compare
- Uchanganuzi wa Vipengele VikuuUjifunzaji wa Mashine↔ compare
- t-SNEUjifunzaji wa Mashine↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →