IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v3y2018i3idhcseit18333.html

Review on Various Enhancements in K means Clustering Algorithm

Author

Listed:
  • Gurpreet Virdi
  • Neena Madan

Abstract

Data Mining is the technique used to mine the data that is finding the useful information from the raw data. As day-by-day data is increasing it becomes difficult for us to analyzing such a huge amount of data. For analyzing such data, we have various clustering techniques in data mining. Clustering is the technique used to divide the data into the various clusters. Clustering is done based on similarities within the elements that are to be clustered. K means is one of the clustering algorithm that is widely used because of its efficiency and simplicity. In this paper, we will review various enhancements in k means clustering algorithm.

Suggested Citation

  • Gurpreet Virdi & Neena Madan, 2018. "Review on Various Enhancements in K means Clustering Algorithm," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 3(3), pages 01-07, April.
  • Handle: RePEc:jbh:ijsrcs:v3:y2018:i3:id:hcseit18333
    Note: Article URL: https://ijsrcseit.com/CSEIT18333
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT18333
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT18333.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:jbh:ijsrcs:v3:y2018:i3:id:hcseit18333. 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: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    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.