IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v7y2016i1d10.1007_s13198-015-0365-3.html
   My bibliography  Save this article

An improved K means clustering with Atkinson index to classify liver patient dataset

Author

Listed:
  • Surya Kant

    (Indian Institute of Technology Roorkee)

  • Irshad Ahmad Ansari

    (Indian Institute of Technology Roorkee)

Abstract

In data mining or machine learning clustering is very broad area. Clustering is a technique which decomposes the data set into different cluster. There are many clustering algorithms but k-mean algorithm is most popular and widely used in many fields such as image processing, machine learning, pattern reorganization etc.; but it has a major drawback that is; its output is really sensitive to the random selection of initial centroids or its final output is totally depends on initial selection of centroids. Because of this drawback many techniques were introduced for K-mean algorithm. This paper introduces an initial centroid selection method for K-mean algorithm by using Atkinson Index. Atkinson index is a technique for measuring the inequality here. It is used for initial seed selection; experimental result shows that the proposed technique, which we applying on liver patient data set gives more accurate result than the original K-mean algorithm.

Suggested Citation

  • Surya Kant & Irshad Ahmad Ansari, 2016. "An improved K means clustering with Atkinson index to classify liver patient dataset," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 7(1), pages 222-228, December.
    • Handle: RePEc:spr:ijsaem:v:7:y:2016:i:1:d:10.1007_s13198-015-0365-3
    DOI: 10.1007/s13198-015-0365-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-015-0365-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-015-0365-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:spr:ijsaem:v:7:y:2016:i:1:d:10.1007_s13198-015-0365-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.