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...
Saved in:
| Published in: | Journal of the Institution of Engineers (India). Series B, Electrical Engineering, Electronics and telecommunication engineering, Computer engineering Vol. 95; no. 4; pp. 345 - 350 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
India
Springer India
01.12.2014
|
| Subjects: | |
| ISSN: | 2250-2106, 2250-2114 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!