Please use this identifier to cite or link to this item:
|Title||Enhanced k-means Clustering Algorithm|
Data clustering is an unsupervised classification method aims at creating groups of objects, or clusters, in such a way that objects in the same cluster are very similar and objects in different clusters are quite distinct. Though k-means is very popular for general clustering, it suffers from some disadvantages such as (1) Its performance depends highly on initial cluster centers, (2) The number of clusters must be previously known and fixed, and (3) The algorithm contains the dead-unit problem which results in empty clusters. Random k-means initialization generally leads k-means to converge to local minima i.e. inacceptable clustering results are produced. In this thesis a method based on some rough set theory concepts and reverse nearest neighbor search is proposed to find the appropriate initial centers for the k-means clustering problem. The complexity of the proposed method is analyzed as well. Also, a method is described to determine the number of clusters in a dataset. Experimental results show the accuracy and effectiveness of the proposed methods.
|Publisher||the islamic university|
|Files in this item|