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

Volume 11, Issue 4, pp 277-290 http://dx.doi.org/10.22436/jmcs.011.04.03

Download PDF

Download XML

• Export citations
  • CITATIONS & REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • ARTICLE CITATION
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)

• 2848 Downloads
• 3858 Views

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

Keywords

• Data mining
• clustering
• k-means
• Initial cluster centers

MSC

•  68T10
•  68T05

References

• [1] P. S. Bradley, U. M. Fayyad, Refining initial points for k-means clustering, In Proceedings of the Fifteenth International Conference on Machine learning (ICML‘98) , (1998), 91–99.
  • Google Scholar


• [2] A. Likas, N. A. Vlassis, J. J. Verbeek, The global k-means clustering algorithm, Pattern Recognition , 36, 2 (2003), 451–461.
  • View Article
  • Google Scholar


• [3] S. S. Khan, A. Ahmad, Cluster center initialization algorithm for k-means clustering, Pattern Recognition Letters 25, 11 (2004), 1293–1302.
  • View Article
  • Google Scholar


• [4] S. Deelers, S. Auwatanamongkol, k-means algorithm with initial cluster centers derived from data partitioning along the data axis with the highest variance, International Journal of Computer Science , 2 (2007), 247–252.
  • Google Scholar


• [5] K. Arai, A. R. Barakbah, Hierarchical k-means: an algorithm for centroids initialization for k-means, Reports of the Faculty of Science and Engineering Saga University , 36, 1 (2007), 25–31.
  • Google Scholar


• [6] F. Cao, J. Liang, G. Jiang, An initialization method for the k-means algorithm using neighborhood model, Computers & Mathematics with Applications, 58, 3 (2009), 474–483.
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [7] Z. Pawlak, Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Norwell, MA, USA (1992)
  • Google Scholar


• [8] A. H. Ahmed, W. Ashour, An initialization method for the k-means algorithm using rnn and coupling degree, International Journal of Computer Applications, Published by Foundation of Computer Science, New York, USA. , 25, 1 (2011), 1–6.
  • Google Scholar


• [9] M. F. Eltibi, W. M. Ashour, Initializing k-means clustering algorithm using statistical information, International Journal of Computer Applications, Published by Foundation of Computer Science,New York, USA. , 29, 7 (2011), 51–55.
  • Google Scholar


• [10] M. E. Celebi, H. A. Kingravi, P. A. Vela, A comparative study of efficient initialization methods for the k-means clustering algorithm, Expert Systems with Applications , 40, 1 (2013), 200 – 210.
  • View Article
  • Google Scholar


• [11] Liang Bai, Jiye Liang, Chao Sui, Chuangyin Dang , Fast global k-means clustering based on local geometrical information , Information Sciences , 245 (2013), 168 – 180.
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [12] M. Erisoglu, N. Calis, S. Sakallioglu, A new algorithm for initial cluster centers in k-means algorithm, Pattern Recogn. Lett., 32, 14 (2011), 1701–1705.
  • View Article
  • Google Scholar


• [13] , , http://repository.seasr.org/Datasets/UCI/arff/ , ()
  • Google Scholar


• [14] R. Maghsoudi, A. Ghorbannia Delavar, S. Hoseyny, R. Asgari, Y. Heidari, Representing the New Model for Improving K-Means Clustering Algorithm based on Genetic Algorithm, The Journal of Mathematics and Computer Science , 2 (2011), 329-336.
  • Google Scholar