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

Ramzi A. Haraty, Mohamad Dimishkieh and Mehedi Masud

International Journal of Distributed Sensor Networks, 2015, vol. 11, issue 6, 615740

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.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2015/615740 (text/html)

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:sae:intdis:v:11:y:2015:i:6:p:615740

DOI: 10.1155/2015/615740

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().