An Optimal Approach of Initial Centroid Selection for Effective Clustering
T. Haribabu1, I. Raju2

1T.Haribabu, Department of Computer Science and Engineering, VIEW College, Visakhapatnam (Andhra Pradesh), India.
2I.Raju, Department of Computer Science and Engineering, VIEW College, Visakhapatnam (Andhra Pradesh), India.
Manuscript received on 07 March 2019 | Revised Manuscript received on 20 March 2019 | Manuscript published on 30 March 2019 | PP: 923-925 | Volume-8 Issue-5, March 2019 | Retrieval Number: D2769028419/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: Data is grouped together based on similarity this technique is called clustering which very well known in datamining. For extracting use full data from cluster most of the people are using the algorithm K-Means. In K-Means approach selecting initial centroids is the problem & these centroids are selected randomly. Because of random centroids this algorithm re-iterate a many number of times. The K-Means algorithm Correctness depends much on the chosen central values. To enhance the performance of the K-Means one should not select the original centroids randomly these must be selected carefully. A new tactic to formulate the original centroids is proposed which improves the rapidity of clustering and cuts the computational complexity by reducing the number of iterations.
Keyword: Clustering, K- Means, Euclidean Distance.
Scope of the Article: Clustering