An efficient healthcare framework for kidney disease using hybrid harmony search algorithm
by Prasad Koti; P. Dhavachelvan; T. Kalaipriyan; Sariga Arjunan; J. Uthayakumar; Pothula Sujatha
Electronic Government, an International Journal (EG), Vol. 16, No. 1/2, 2020

Abstract: Prediction of kidney disease (KD) gains more importance in the medical decision support systems. As the medical dataset are massive in size, effective techniques are required to produce accurate results. This paper proposes a hybrid harmony search (HM-L) algorithm with Levi distribution to properly predict KD at appropriate time. In this research work, correlation-based feature selection (CFS) is used as a feature selection technique. The effectiveness of hybrid harmony search (HS) algorithm is validated by employing it against a set of dataset. The obtained results of applied datasets without and with feature selection are compared to one another. The experimental results imply that the HM-L algorithm attains significant results than existing methods such as HS algorithm, biogeography optimisation algorithm (BBO), grey wolf optimisation (GWO), AL particle swarm optimisation algorithm (ALPSO) and artificial bee colony (ABC) algorithm. The presented HM-L model attains a sensitivity of 96, specificity of 93.33, accuracy of 95, F-score of 96 and kappa value of 0.89.

Online publication date: Sat, 22-Feb-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the Electronic Government, an International Journal (EG):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com