πŸ“ž +91-7667918914 | βœ‰οΈ ijarcce@gmail.com
International Journal of Advanced Research in Computer and Communication Engineering
International Journal of Advanced Research in Computer and Communication Engineering A monthly Peer-reviewed & Refereed journal
ISSN Online 2278-1021ISSN Print 2319-5940Since 2012
IJARCCE adheres to the suggestive parameters outlined by the University Grants Commission (UGC) for peer-reviewed journals, upholding high standards of research quality, ethical publishing, and academic excellence.
← Back to VOLUME 6, ISSUE 11, NOVEMBER 2017

An Efficient K-Means Clustering Algorithm Using Euclidean Distance Techniques

N.Suresh, Dr.K.Arulanandam

DOI: 10.17148/IJARCCE.2017.61141

Abstract: The quality of the healthcare and treatment outcome relies heavily on Data Mining field to exchange information for accurate detection of the life threatening causes. The quality of health care system can be improved by employing an intelligent system via the Data Mining Techniques. Data Mining Techniques are used to reveal the hidden patterns from the vast collection of patientοΏ½s data. Analysis of the data uses techniques and statistical measures to get insight into vast patientοΏ½s information and predict the possible causes for the health issues and its impact on individual patients. Earlier analysis of the health related issues will reduce psychological stress and gives enormous time to identify the specialist in the respective field to acquire pre-determined treatment.



Keywords: Data Mining, Agglomerative, Clustering, K-Means, K-Medoids, Dataset in Excel.

πŸ‘ 28 views
Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite:

[1] N.Suresh, Dr.K.Arulanandam, β€œAn Efficient K-Means Clustering Algorithm Using Euclidean Distance Techniques,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE), DOI: 10.17148/IJARCCE.2017.61141

Share this Paper