IDEAS home Printed from https://ideas.repec.org/a/ids/ijdsci/v4y2019i1p63-81.html
   My bibliography  Save this article

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

Author

Listed:
  • Sanjay Chakraborty
  • Subham Raj
  • Shreya Garg

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.

Suggested Citation

  • Sanjay Chakraborty & Subham Raj & Shreya Garg, 2019. "Selection of 'K' in K-means clustering using GA and VMA," International Journal of Data Science, Inderscience Enterprises Ltd, vol. 4(1), pages 63-81.
  • Handle: RePEc:ids:ijdsci:v:4:y:2019:i:1:p:63-81
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=98361
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijdsci:v:4:y:2019:i:1:p:63-81. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=429 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.