This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
Survey on Exiting Method for Selecting Initial Centroids in K-Means Clustering
Authors
  Trupti M. Kodinariya,  Dr. Prashant R. Makwana
Abstract
Clustering is one of the Data Mining tasks that can be used to cluster or group objects on the basis of their nearness to the central value. K-means clustering algorithm is a one of the major cluster analysis method that is commonly used in practical applications for extracting useful information in terms of grouping data. But the standard K-means algorithm is computationally expensive by getting centroids that provide the quality of the clusters in results. This paper presents the various methods evolved by researchers for finding initial clusters for K Means.
Keywords- Binary Splitting, Clustering, Cluster Centre Initialization Method, Forgy’s Approach, Kaufman Approach, K-means Clustering, Kernel Principle Component Analysis based Method Macqueen Method, Simple Cluster Seeking method
Publication Details
Unique Identification Number - IJEDR1402251Page Number(s) - 2865-2868Pubished in - Volume 2 | Issue 2 | June 2014DOI (Digital Object Identifier) -    Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
  Trupti M. Kodinariya,  Dr. Prashant R. Makwana,   "Survey on Exiting Method for Selecting Initial Centroids in K-Means Clustering ", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.2, Issue 2, pp.2865-2868, June 2014, Available at :http://www.ijedr.org/papers/IJEDR1402251.pdf
Article Preview
|
|
||||||
|