Anr an Algorithm to Recommend Initial Cluster Centers for K-means Algorithm


Authors

Arash Ghorbannia Delavar - Department of Computer Science, Payame Noor University, PO BOX 19395-3697, Tehran, Iran. Gholam Hasan Mohebpour - Department of Computer Science, Payame Noor University, PO BOX 19395-3697, Tehran, Iran.


Abstract

Clustering is one of the widely used knowledge discovery techniques to detect structure of datasets and can be extremely useful to the analyst. In center based clustering algorithms such as k-means, choosing initial cluster centers is really important as it has an important impact on the clustering result. It is desirable to select initial centers which are well separated. In this paper, we have proposed an algorithm to find initial cluster centers based on choosing two attributes that can describe the data space better and using the number of neighbors in a specific radius in data space. The proposed Attribute and Neighborhood Radius based (ANR) initial cluster center computing algorithm is applied to several well-known datasets .experimental results shows that it prevents form choosing noise data points as cluster center and tries to choose data points from dense areas in data space.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

Arash Ghorbannia Delavar, Gholam Hasan Mohebpour, Anr an Algorithm to Recommend Initial Cluster Centers for K-means Algorithm, Journal of Mathematics and Computer Science, 11 (2014), no. 4, 277-290

AMA Style

Delavar Arash Ghorbannia, Mohebpour Gholam Hasan, Anr an Algorithm to Recommend Initial Cluster Centers for K-means Algorithm. J Math Comput SCI-JM. (2014); 11(4):277-290

Chicago/Turabian Style

Delavar, Arash Ghorbannia, Mohebpour, Gholam Hasan. "Anr an Algorithm to Recommend Initial Cluster Centers for K-means Algorithm." Journal of Mathematics and Computer Science, 11, no. 4 (2014): 277-290


Keywords


MSC


References