IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i6p615740.html
   My bibliography  Save this article

An Enhanced k-Means Clustering Algorithm for Pattern Discovery in Healthcare Data

Author

Listed:
  • Ramzi A. Haraty
  • Mohamad Dimishkieh
  • Mehedi Masud

Abstract

The huge amounts of data generated by media sensors in health monitoring systems, by medical diagnosis that produce media (audio, video, image, and text) content, and from health service providers are too complex and voluminous to be processed and analyzed by traditional methods. Data mining approaches offer the methodology and technology to transform these heterogeneous data into meaningful information for decision making. This paper studies data mining applications in healthcare. Mainly, we study k -means clustering algorithms on large datasets and present an enhancement to k -means clustering, which requires k or a lesser number of passes to a dataset. The proposed algorithm, which we call G -means, utilizes a greedy approach to produce the preliminary centroids and then takes k or lesser passes over the dataset to adjust these center points. Our experimental results, which were used in an increasing manner on the same dataset, show that G -means outperforms k -means in terms of entropy and F -scores. The experiments also yield better results for G -means in terms of the coefficient of variance and the execution time.

Suggested Citation

  • Ramzi A. Haraty & Mohamad Dimishkieh & Mehedi Masud, 2015. "An Enhanced k-Means Clustering Algorithm for Pattern Discovery in Healthcare Data," International Journal of Distributed Sensor Networks, , vol. 11(6), pages 615740-6157, June.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:6:p:615740
    DOI: 10.1155/2015/615740
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/615740
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/615740?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
    ---><---

    More about this item

    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:sae:intdis:v:11:y:2015:i:6:p:615740. 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: SAGE Publications (email available below). General contact details of provider: .

    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.