Improving the Initial Centroids of k-means Clustering Algorithm to Generalize its Applicability
k-means is one of the most widely used partition based clustering algorithm. But the initial centroids generated randomly by the k-means algorithm cause the algorithm to converge at the local optimum. So to make k-means algorithm globally optimum, the initial centroids must be selected carefully rat...
Uložené v:
| Vydané v: | Journal of the Institution of Engineers (India). Series B, Electrical Engineering, Electronics and telecommunication engineering, Computer engineering Ročník 95; číslo 4; s. 345 - 350 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
India
Springer India
01.12.2014
|
| Predmet: | |
| ISSN: | 2250-2106, 2250-2114 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!