A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Abstract 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 rather than randomly. Though many researchers have already been carried out for the enhancement of k-means algorithm, they have their own limitations. In this paper a new method to formulate the initial centroids is proposed which results in better clusters equally for uniform and non-uniform data sets.
Abstract 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 rather than randomly. Though many researchers have already been carried out for the enhancement of k-means algorithm, they have their own limitations. In this paper a new method to formulate the initial centroids is proposed which results in better clusters equally for uniform and non-uniform data sets.
Improving the Initial Centroids of k-means Clustering Algorithm to Generalize its Applicability
Journal of The Institution of Engineers (India): Series B ; 95 ; 345-350
2014-07-08
6 pages
Article (Journal)
Electronic Resource
English
An Approach to Centroids of Fuzzy Numbers
| British Library Online Contents | 2007
How can we simplify and generalize wind loads?
| British Library Conference Proceedings | 1995
How can we simplify and generalize wind loads?
| Online Contents | 1995
Approximating Centroids for the Maximum Intersection of Spherical Polygons
| British Library Conference Proceedings | 2004