Selection of 'K' in K-means clustering using GA and VMA

Sanjay Chakraborty, Subham Raj and Shreya Garg

International Journal of Data Science, 2019, vol. 4, issue 1, 63-81

Abstract: The K-means algorithm is the most widely used partitional clustering algorithms. In spite of several advances in K-means clustering algorithm, it suffers in some drawbacks like initial cluster centres, stuck in local optima etc. The initial guessing of cluster centres lead to the bad clustering results in K-means and this is one of the major drawbacks of K-means algorithm. In this paper, a new strategy is proposed where we have blended K-means algorithm with genetic algorithm (GA) and volume metric algorithm (VMA) to predict the best value of initial cluster centres, which is not in the case of only K-means algorithm. The paper concludes with the analysis of the results of using the proposed measure to determine the number of clusters for the K-means algorithm for different well-known datasets from UCI machine learning repository.

Keywords: clustering; initial cluster centres; K-means; GA; VMA; volume metric algorithm. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=98361 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdsci:v:4:y:2019:i:1:p:63-81

Access Statistics for this article

More articles in International Journal of Data Science from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().