An Efficient Algorithm to fix Initial Centroid for Clustering High Dimensional data
Main Article Content
Abstract
Clustering is one of the primary data analysis methods and K-Means clustering is one of the most well known popular clustering algorithm. The K-Means algorithm is one of the most frequently used clustering method in data mining, due to its performance in clustering massive data sets. The final clustering result of the K-Means clustering algorithm greatly depends upon the correctness of the initial centroids, which are selected randomly. Because of the initial cluster centers produced arbitrarily, K-Means algorithm does not promise to produce the consistent clustering results. Efficiency of the original K-Means algorithm heavily rely on the initial centroids. The number of distance calculations increases exponentially with the increase of the dimensionality of the data. An algorithm is proposed which uses the Principal Component Analysis (PCA) in the first phase that simplifies the analysis and visualization of multi dimensional data set and in the second phase, a method is proposed to find the initial centroids to make the algorithm more effective and efficient. The proposed algorithm is implemented using MATLAB 7.10. This method provides more accurate results with less computational time compared to the existing algorithm.
Â
Â
Keywords: Clustering, K-Means, PCA.
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.