The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Insulin DNA Sequence Classification Using Levy Flight Bat With Back Propagation Algorithm
|
|
Author(s): Siyab Khan (The University of Agriculture, Peshawar, Pakistan), Abdullah Khan (The University of Agriculture, Peshawar, Pakistan), Rehan Ullah (The University of Agriculture, Peshawar, Pakistan), Maria Ali (The University of Agriculture, Peshawar, Pakistan)and Rahat Ullah (University of Malakand, Pakistan)
Copyright: 2020
Pages: 21
Source title:
Mobile Devices and Smart Gadgets in Medical Sciences
Source Author(s)/Editor(s): Sajid Umair (The University of Agriculture, Peshawar, Pakistan)
DOI: 10.4018/978-1-7998-2521-0.ch011
Purchase
|
Abstract
Various nature-inspired algorithms are used for optimization problems. Recently, one of the nature-inspired algorithms became famous because of its optimality. In order to solve the problem of low accuracy, famous computational methods like machine learning used levy flight Bat algorithm for the problematic classification of an insulin DNA sequence of a healthy human, one variant of the insulin DNA sequence is used. The DNA sequence is collected from NCBI. Preprocessing alignment is performed in order to obtain the finest optimal DNA sequence with a greater number of matches between base pairs of DNA sequences. Further, binaries of the DNA sequence are made for the aim of machine readability. Six hybrid algorithms are used for the classification to check the performance of these proposed hybrid models. The performance of the proposed models is compared with the other algorithms like BatANN, BatBP, BatGDANN, and BatGDBP in term of MSE and accuracy. From the simulations results it is shown that the proposed LFBatANN and LFBatBP algorithms perform better compared to other hybrid models.
Related Content
|
.
© 2021.
31 pages.
|
|
.
© 2021.
19 pages.
|
|
.
© 2021.
38 pages.
|
|
.
© 2021.
25 pages.
|
|
.
© 2021.
21 pages.
|
|
.
© 2021.
34 pages.
|
|
.
© 2021.
59 pages.
|
|
|