z-logo
open-access-imgOpen Access
PREDICTION OF DIABETES SCREENING BY USING DATA MINING ALGORITHMS
Author(s) -
Aberham Tadesse Zemedkun
Publication year - 2021
Publication title -
international journal of engineering science technologies
Language(s) - English
Resource type - Journals
ISSN - 2456-8651
DOI - 10.29121/ijoest.v5.i6.2021.253
Subject(s) - c4.5 algorithm , confusion matrix , decision tree , diabetes mellitus , algorithm , medicine , decision tree learning , naive bayes classifier , receiver operating characteristic , medical record , statistical classification , machine learning , data mining , computer science , artificial intelligence , support vector machine , endocrinology
Diabetes is one of the most common non-communicable diseases in the world. Diabetes affects the ability to produce the hormone insulin. Thus, complications may occur if diabetes remains untreated and unidentified. That features a significant contribution to increased morbidity, mortality, and admission rates of patients in both developed and developing countries. When disease is not detected early, it leads to complications. Medical records of the cases were retrospective. Anthropometric and biochemical information was collected. From this data, four ML classification algorithms, including Decision Tree (J48), Naive-Bayes, PART rule induction, and JRIP, were used to prognosticate diabetes. Precision, recall, F-Measure, Receiver Operating Characteristics (ROC) scores, and the confusion matrix were calculated to determine the performance of the various algorithms. The performance was also measured by sensitivity and specificity. They have high classification accuracy and are generally comparable in predicting diabetes and free diabetes patients. Among the selected algorithms tested, the Decision Tree Classifier (J48) algorithm scored the highest accuracy and was the best predictor, with a classification accuracy of 92.74%.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here