<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CSSE</journal-id>
<journal-id journal-id-type="nlm-ta">CSSE</journal-id>
<journal-id journal-id-type="publisher-id">CSSE</journal-id>
<journal-title-group>
<journal-title>Computer Systems Science &#x0026; Engineering</journal-title>
</journal-title-group>
<issn pub-type="ppub">0267-6192</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">16754</article-id>
<article-id pub-id-type="doi">10.32604/csse.2022.016754</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Deep Learning Based Process Analytics Model for Predicting Type 2 Diabetes Mellitus</article-title>
<alt-title alt-title-type="left-running-head">Deep Learning Based Process Analytics Model for Predicting Type 2 Diabetes Mellitus</alt-title>
<alt-title alt-title-type="right-running-head">Deep Learning Based Process Analytics Model for Predicting Type 2 Diabetes Mellitus</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western">
<surname>Mohamed</surname>
<given-names>A. Thasil</given-names>
</name>
<xref ref-type="aff" rid="aff-1"/>
</contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western">
<surname>Santhoshkumar</surname>
<given-names>Sundar</given-names>
</name>
<xref ref-type="aff" rid="aff-1"/>
<email>santhoshkumars@alagappauniversity.ac.in</email>
</contrib>
<aff id="aff-1">
<institution>Department of Computer Science, Alagappa University</institution>, <addr-line>Karaikudi, 630003</addr-line>, <country>India</country></aff>
</contrib-group><author-notes><corresp id="cor1">&#x002A;Corresponding Author: Sundar Santhoshkumar. Email: <email>santhoshkumars@alagappauniversity.ac.in</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2021-08-12">
<day>12</day>
<month>8</month>
<year>2021</year>
</pub-date>
<volume>40</volume>
<issue>1</issue>
<fpage>191</fpage>
<lpage>205</lpage>
<history>
<date date-type="received">
<day>11</day>
<month>1</month>
<year>2021</year>
</date>
<date date-type="accepted">
<day>27</day>
<month>4</month>
<year>2021</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Mohamed and Santhoshkumar</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Mohamed and Santhoshkumar</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CSSE_16754.pdf"></self-uri>
<abstract>
<p>Process analytics is one of the popular research domains that advanced in the recent years. Process analytics encompasses identification, monitoring, and improvement of the processes through knowledge extraction from historical data. The evolution of Artificial Intelligence (AI)-enabled Electronic Health Records (EHRs) revolutionized the medical practice. Type 2 Diabetes Mellitus (T2DM) is a syndrome characterized by the lack of insulin secretion. If not diagnosed and managed at early stages, it may produce severe outcomes and at times, death too. Chronic Kidney Disease (CKD) and Coronary Heart Disease (CHD) are the most common, long-term and life-threatening diseases caused by T2DM. Therefore, it becomes inevitable to predict the risks of CKD and CHD in T2DM patients. The current research article presents automated Deep Learning (DL)-based Deep Neural Network (DNN) with Adagrad Optimization Algorithm i.e., DNN-AGOA model to predict CKD and CHD risks in T2DM patients. The paper proposes a risk prediction model for T2DM patients who may develop CKD or CHD. This model helps in alarming both T2DM patients and clinicians in advance. At first, the proposed DNN-AGOA model performs data preprocessing to improve the quality of data and make it compatible for further processing. Besides, a Deep Neural Network (DNN) is employed for feature extraction, after which sigmoid function is used for classification. Further, Adagrad optimizer is applied to improve the performance of DNN model. For experimental validation, benchmark medical datasets were used and the results were validated under several dimensions. The proposed model achieved a maximum precision of 93.99%, recall of 94.63%, specificity of 73.34%, accuracy of 92.58%, and F-score of 94.22%. The results attained through experimentation established that the proposed DNN-AGOA model has good prediction capability over other methods.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Process analytics</kwd>
<kwd>deep learning</kwd>
<kwd>disease diagnosis</kwd>
<kwd>Adagrad</kwd>
<kwd>T2DM</kwd>
<kwd>chronic illness</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Process analytics is commonly employed in identification, monitoring, and improvement of the processes through knowledge extraction from historical data. It can be employed in disease diagnosis process in healthcare domain too. It can analyze a dataset effectively and diagnose different kinds of diseases. Diabetes Mellitus (DM) is one of the incurable diseases characterized by the lack of insulin secretion, a result of irregular functioning of pancreatic beta-cells [<xref ref-type="bibr" rid="ref-1">1</xref>]. The prevalence and the magnitude of diabetic population since 1980 are increasing in an alarming manner. Recently, it has been identified as the top most disease with high mortality rate. International Diabetes Federation (IDF) reported that the number of diabetic patients is increasing on a daily basis across the globe. Diabetes is categorized into Type 1 (T1DM) Diabetes and Type 2 (T2DM) Diabetes with completely different therapy regimen. China leads the first position with most number of T2DM patients, due to its increasing population. T2DM leads to major complications such as macrovascular infection, for instance, Cardiovascular Disease (CVD), microvascular infection, etc. [<xref ref-type="bibr" rid="ref-2">2</xref>]. Further, T2DM results in dementia and cognitive impairment during when the sensitivity of diabetes gets reduced. The presence of CVD like Heart Failure (HF) and cardiac dysfunction in patients with T2DM is higher compared to people without T2DM.</p>
<p>Coronary Heart Disease (CHD) is a common and serious complication of diabetes and a lot of diabetic patients suffer from CHD too. CHD is characterized by insufficient supply of blood to heart muscles due to hyperlipidaemia, myocardial infarction, and angina pectoris. Most of the diabetic adults in US suffer from CHD that ends their life. It is apparent that the demographic factors like age, gender, and the health status of patients in terms of BP, smoking habit and diabetes decide the prognosis of CHD [<xref ref-type="bibr" rid="ref-3">3</xref>]. Hence, it becomes inevitable to predict CHD at very early stages in spite of the challenges associated with it. The techniques used in the prediction of CHD so far, followed mathematical approaches like COX regression and Machine Learning (ML) methodologies like Neural Network (NN). These approaches are developed for common people, while there is no model available to examine the risks of CHD in T2DM patients. Thus, the risks for a normal aged person to have diseases like HD and CHD are less, in comparison with diabetic patients. T2DM patients should be examined periodically to predict the risks of CHD.</p>
<p>Chronic Kidney Disease (CKD) is a major health issue with drastic increase in impact and prevalence in the recent years. Patients suffering from diabetes are diagnosed with CKD through negative deployment. It is essential to stratify CKD and evaluate its development, since diabetes is a major cause of end-stage renal diseases. CKD is a progressive infection that limits the functioning of kidneys for which dialysis and transplantation are better remedies to extend the life span of the patient [<xref ref-type="bibr" rid="ref-4">4</xref>]. Each country has a unique price slab for dialysis and transplantation depending on their clinical features [<xref ref-type="bibr" rid="ref-5">5</xref>]. With slow development of CKD, the consequences of End-Stage Renal Disease (ESRD) could be arrested. Regardless, the prediction of CKD is essential for both detection of ESRD and cost-cutting for healthcare system [<xref ref-type="bibr" rid="ref-6">6</xref>]. Stage 3 CKD is further classified into two stages namely, A and B. In literature, a variation in poor ratios represents stage 4 development like mortality and hospitalization [<xref ref-type="bibr" rid="ref-7">7</xref>]. The levels allocated are determined based on radioactivity. The above-discussed prediction strategies are costlier and time-consuming. So, there is a need to develop novel methodologies that are cost-effective and time-savvy.</p>
<sec id="s1_1">
<label>1.1</label>
<title>Previous Works</title>
<p>The application of temporal Electronic Health Record (EHR) data in prediction models remains a challenging task. This healthcare data consists of different sampling rates over various groups of patients with different data types. During inpatient encounters, possible symptoms are pointed out on an hourly basis, while the lab tests and vaccinations are recorded based on clinicians&#x2019; request. Further, the demographic data is considered to be highly responsive in this regard. So, maximum efforts are taken to balance the temporal data in different medical domains. Initially, time series is represented through medical features with a heuristic value (considering the advanced value [<xref ref-type="bibr" rid="ref-8">8</xref>] to weighted sum of measures with weights computed by timestamps [<xref ref-type="bibr" rid="ref-9">9</xref>]). Alternatively, basic sequential order is conserved by mapping time series with temporal patterns [<xref ref-type="bibr" rid="ref-10">10</xref>]. Furthermore, Deep Learning (DL) models like Recurrent Neural Network (RNN) especially Long Short Term Memory (LSTM) and Gated Recurrent Units (GRU) have been involved in modeling temporal functions. The issues discussed above have been addressed by different research works which inferred different conclusions like maximum data sparsity or data loss and lack of training information.</p>
<p>When it comes to detection of kidney-based functions, single-value abstraction is an established method which is known for its simplicity. However, the cost of limited temporal granularity is high [<xref ref-type="bibr" rid="ref-11">11</xref>]. A multivariate Cox proportional survival framework was deployed in the literature [<xref ref-type="bibr" rid="ref-12">12</xref>] to predict ESRD-relied mean- and variation-abstraction. These sophisticated applications make use of temporal EHRs and target severe or acute kidney-based events [<xref ref-type="bibr" rid="ref-13">13</xref>], while independent Markov operation is developed by frequent latent states to detect the transition from stage 3 to stage 4 in CKD.</p>
<p>Multitask linear method-based knowledge transfer that occurs from one time window to the other, is able to predict the short-term renal function loss [<xref ref-type="bibr" rid="ref-14">14</xref>]. A tree-based discrete survival-like Gradient Boosting Machine (GBM) was deployed with few features in the study conducted earlier to detect acute kidney disease among inpatients. The results were associated with time variance which implied a tremendous function [<xref ref-type="bibr" rid="ref-15">15</xref>]. Thus, the previously-presented models demand low-to-high manual effort for pre-selection and recovery of the features. This demand limits the reliability of prediction approaches. However, the moderate data in patient&#x2019;s records are reduced [<xref ref-type="bibr" rid="ref-16">16</xref>]. Several studies pointed out the importance of predicting CKD and CHD risks in T2DM patients. Though several models are available in the literature, there is a need still exists to improve the detection performance. In addition, the parameter tuning of DL models is yet to be explored in CKD diagnosis.</p>
</sec>
<sec id="s1_2">
<label>1.2</label>
<title>Contribution of the Paper</title>
<p>This paper presents an automated Deep Learning (DL)-based Deep Neural Network (DNN) with Adagrad Optimization Algorithm i.e., DNN-AGOA model to predict the risks of CKD and CHD in T2DM patients. The goal of this study is to design a risk prediction model for T2DM patients that can predict the occurrence of CKD or CHD in future. This model helps in alarming both T2DM patients and clinicians. At first, the DNN-AGOA model performs data preprocessing to increase the quality of data and make it compatible for further processing. After this, Deep Neural Network (DNN) is employed for feature extraction, whereas sigmoid function is used for classification. In order to optimize the results of DNN model, hyperparameter tuning is performed in DNN using Adagrad optimizer. The novelty of current research work is the application of Adagrad to fine tune the hyperparameters of DNN. For experimental validation, benchmark medical datasets were used and the results were validated under diverse dimensions.</p>
</sec>
</sec>
<sec id="s2">
<label>2</label>
<title>The Proposed DNN-AGOA Model</title>
<p>The overall operations involved in the presented DNN-AGOA model is shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. The input dataset is first verified to confirm the presence of T2DM. Subsequently, those T2DM positive data instances are considered to predict the significant risks of CKD and CHD. Sigmoid layer is responsible for the allocation of proper class labels to the applied test input data.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Functional diagram of DNN-AGOA model</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_16754-fig-1.png"/>
</fig>
<sec id="s2_1">
<label>2.1</label>
<title>Preprocessing</title>
<p>At first, input medical data is preprocessed through two stages namely, format conversion and missing value replacement. During format conversion, raw medical dataset is converted into a compatible .arff format. Then, the missing values that exist in the dataset are filled by following median method.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>DNN Model</title>
<p>Artificial Neural Network (ANN) model is a biology-based computational approach as it is influenced by biological neural network feature to implant the intelligence in projected technology. Feed Forward Neural Network (FFN), a class of ANN, is represented by a directed graph to pass the system data with edges from one node to another without any cycle formation. Here, Multilayer Perceptron (MLP) framework is applied as a class of FFN with maximum number of input, hidden and output layers. Here, a layer contains massive number of neurons. The number of hidden layers is selected by applying hyperparameter selection module. Then, the data is transferred in a layer-by-layer fashion in forward direction along with fully-connected neurons. MLP is represented numerically; <inline-formula id="ieqn-1">
<!--<alternatives><inline-graphic xlink:href="ieqn-1.tif"/><tex-math id="tex-ieqn-1"><![CDATA[${{\rm {\mathbb R}}^{\rm m}} \times {{\rm {\mathbb R}}^{\rm n}}$]]></tex-math>--><mml:math id="mml-ieqn-1"><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> where &#x2018;m&#x2019; implies the input vector size <inline-formula id="ieqn-2">
<!--<alternatives><inline-graphic xlink:href="ieqn-2.tif"/><tex-math id="tex-ieqn-2"><![CDATA[${\rm x} = {{\rm x}_1},{{\rm x}_2}, \cdots ,{{\rm x}_{{\rm m} - 1}},{{\rm x}_{\rm m}}$]]></tex-math>--><mml:math id="mml-ieqn-2"><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> and <inline-formula id="ieqn-3">
<!--<alternatives><inline-graphic xlink:href="ieqn-3.tif"/><tex-math id="tex-ieqn-3"><![CDATA[${\rm n}$]]></tex-math>--><mml:math id="mml-ieqn-3"><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> denotes the size of output vector<inline-formula id="ieqn-4">
<!--<alternatives><inline-graphic xlink:href="ieqn-4.tif"/><tex-math id="tex-ieqn-4"><![CDATA[$\; {\rm O}\left( {\rm x} \right)$]]></tex-math>--><mml:math id="mml-ieqn-4"><mml:mspace width="thickmathspace"></mml:mspace><mml:mrow><mml:mi mathvariant="normal">O</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula>. Thus, hidden layer processing <inline-formula id="ieqn-5">
<!--<alternatives><inline-graphic xlink:href="ieqn-5.tif"/><tex-math id="tex-ieqn-5"><![CDATA[${{\rm h}_{\rm i}}$]]></tex-math>--><mml:math id="mml-ieqn-5"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> is defined in arithmetical form as given below.</p>
<p><disp-formula id="eqn-1">
<label>(1)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-1.png"/><tex-math id="tex-eqn-1"><![CDATA[$${{\rm h}_{\rm i}}\left( {\rm x} \right) = {\rm f}\left( {{\rm w}_{\rm i}^{\rm T}{\rm x} + {{\rm b}_{\rm i}}} \right)$$]]></tex-math>--><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">w</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">T</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mo>&#x002B;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-6">
<!--<alternatives><inline-graphic xlink:href="ieqn-6.tif"/><tex-math id="tex-ieqn-6"><![CDATA[${{\rm h}_{\rm i}}$]]></tex-math>--><mml:math id="mml-ieqn-6"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula>: <inline-formula id="ieqn-7">
<!--<alternatives><inline-graphic xlink:href="ieqn-7.tif"/><tex-math id="tex-ieqn-7"><![CDATA[${{\rm {\mathbb R}}^{{{\rm d}_{\rm i}} - 1}} \to {{\rm {\mathbb R}}^{{{\rm d}_{\rm i}}}}$]]></tex-math>--><mml:math id="mml-ieqn-7"><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula>, <inline-formula id="ieqn-8">
<!--<alternatives><inline-graphic xlink:href="ieqn-8.tif"/><tex-math id="tex-ieqn-8"><![CDATA[${\rm f}\!\!:{\rm \; }{\rm {\mathbb R}} \to {\rm {\mathbb R}},{{\rm w}_{\rm i}} \in {{\rm {\mathbb R}}^{{\rm d} \times {{\rm d}_{{\rm i} - 1}}}},{\rm b} \in {{\rm {\mathbb R}}^{{{\rm d}_{\rm i}}}},{\rm \; }{{\rm d}_{\rm i}}$]]></tex-math>--><mml:math id="mml-ieqn-8"><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mo>:</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">w</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">d</mml:mi></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">d</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> refers to the size of input and <inline-formula id="ieqn-9">
<!--<alternatives><inline-graphic xlink:href="ieqn-9.tif"/><tex-math id="tex-ieqn-9"><![CDATA[${\rm f}$]]></tex-math>--><mml:math id="mml-ieqn-9"><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> indicates the non-linear activation function i.e., a sigmoid (values from <inline-formula id="ieqn-10">
<!--<alternatives><inline-graphic xlink:href="ieqn-10.tif"/><tex-math id="tex-ieqn-10"><![CDATA[$\left[ {0,1} \right]$]]></tex-math>--><mml:math id="mml-ieqn-10"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula>) or tangent function (values from [1, <inline-formula id="ieqn-11">
<!--<alternatives><inline-graphic xlink:href="ieqn-11.tif"/><tex-math id="tex-ieqn-11"><![CDATA[$- 1]$]]></tex-math>--><mml:math id="mml-ieqn-11"><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:math>
<!--</alternatives>--></inline-formula>). For multilabel classification problem, MLP method applies softmax function as a non-linear activation function. Softmax function results in the possibility of a class and decides the maximum value from the available probability values, implying a considerable value [<xref ref-type="bibr" rid="ref-17">17</xref>]. The numerical function for distinct activation functions is given herewith.</p>
<p><disp-formula id="eqn-2">
<label>(2)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-2.png"/><tex-math id="tex-eqn-2"><![CDATA[$${\rm sigmoid\; } = {\rm \; }\displaystyle{1 \over {1 + {{\rm e}^{ - {\rm x}}}}}$$]]></tex-math>--><mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">g</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x002B;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="normal">e</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
<!--</alternatives>--></disp-formula></p>
<p><disp-formula id="eqn-3">
<label>(3)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-3.png"/><tex-math id="tex-eqn-3"><![CDATA[$${\rm tangent} = {\rm \; }\displaystyle{{{{\rm e}^{2{\rm x}}} - 1} \over {{{\rm e}^{2{\rm x}}} + 1}}$$]]></tex-math>--><mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">g</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="normal">e</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="normal">e</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
<!--</alternatives>--></disp-formula></p>
<p><disp-formula id="eqn-4">
<label>(4)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-4.png"/><tex-math id="tex-eqn-4"><![CDATA[$${\rm softmax}\left( {{\rm xi}} \right) = {\rm \; }\displaystyle{{{{\rm e}^{{{\rm x}_{\rm i}}}}} \over {\mathop \sum \nolimits_{{\rm j} = 1}^{\rm n} {{\rm e}^{{{\rm x}_{\rm j}}}}}}$$]]></tex-math>--><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">f</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">x</mml:mi><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="normal">e</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="normal">e</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-12">
<!--<alternatives><inline-graphic xlink:href="ieqn-12.tif"/><tex-math id="tex-ieqn-12"><![CDATA[${\rm x}$]]></tex-math>--><mml:math id="mml-ieqn-12"><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> implies an input.</p>
<p>The three-layered MLP, along with Softmax function in the resultant layer, is similar to Multi-class Logistic Regression (LR) method. MLP is generally expressed for massive number of hidden layers and is given below.</p>
<p><disp-formula id="eqn-5">
<label>(5)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-5.png"/><tex-math id="tex-eqn-5"><![CDATA[$${\rm H}\left( {\rm x} \right) = {{\rm H}_{\rm l}}\left( {{{\rm H}_{{\rm l} - 1}}\left( {{{\rm H}_{{\rm l} - 2}}\left( { \cdots \left( {{{\rm H}_1}\left( {\rm x} \right)} \right)} \right)} \right)} \right)$$]]></tex-math>--><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:mi mathvariant="normal">H</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">H</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">H</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">H</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x22EF;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">H</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>The piling hidden layers are generally referred to as DNNs. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> shows the structure of DNN with a hidden layer. It considers the following values as input, <inline-formula id="ieqn-13">
<!--<alternatives><inline-graphic xlink:href="ieqn-13.tif"/><tex-math id="tex-ieqn-13"><![CDATA[${{\rm x}_1},{{\rm x}_2}, \cdots$]]></tex-math>--><mml:math id="mml-ieqn-13"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo></mml:math>
<!--</alternatives>--></inline-formula> , <inline-formula id="ieqn-14">
<!--<alternatives><inline-graphic xlink:href="ieqn-14.tif"/><tex-math id="tex-ieqn-14"><![CDATA[${{\rm x}_{{\rm m} - 1}},{{\rm x}_{\rm m}}$]]></tex-math>--><mml:math id="mml-ieqn-14"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> and output <inline-formula id="ieqn-15">
<!--<alternatives><inline-graphic xlink:href="ieqn-15.tif"/><tex-math id="tex-ieqn-15"><![CDATA[${\rm o} = {{\rm o}_1},{{\rm o}_2}, \cdots$]]></tex-math>--><mml:math id="mml-ieqn-15"><mml:mrow><mml:mi mathvariant="normal">o</mml:mi></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">o</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">o</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo></mml:math>
<!--</alternatives>--></inline-formula> , <inline-formula id="ieqn-16">
<!--<alternatives><inline-graphic xlink:href="ieqn-16.tif"/><tex-math id="tex-ieqn-16"><![CDATA[${{\rm o}_{{\rm c} - 1}},{{\rm o}_{\rm c}}$]]></tex-math>--><mml:math id="mml-ieqn-16"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">o</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">o</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula>. Here, DNN is applied as an extended version of conventional FFN with a hidden layer by applying non-linear activation function. <inline-formula id="ieqn-17">
<!--<alternatives><inline-graphic xlink:href="ieqn-17.tif"/><tex-math id="tex-ieqn-17"><![CDATA[${\rm ReLU}$]]></tex-math>--><mml:math id="mml-ieqn-17"><mml:mrow><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">L</mml:mi><mml:mi mathvariant="normal">U</mml:mi></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> is applied to reduce the diminishing conditions and error gradient problems. The advantage of <inline-formula id="ieqn-18">
<!--<alternatives><inline-graphic xlink:href="ieqn-18.tif"/><tex-math id="tex-ieqn-18"><![CDATA[${\rm ReLU}$]]></tex-math>--><mml:math id="mml-ieqn-18"><mml:mrow><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">L</mml:mi><mml:mi mathvariant="normal">U</mml:mi></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> is that it is robust in nature compared to non-linear activation function and acts as an MLP training model with a maximum number of hidden layers. The ubiquitous modeling of loss functions and <inline-formula id="ieqn-19">
<!--<alternatives><inline-graphic xlink:href="ieqn-19.tif"/><tex-math id="tex-ieqn-19"><![CDATA[${\rm ReLU}$]]></tex-math>--><mml:math id="mml-ieqn-19"><mml:mrow><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">L</mml:mi><mml:mi mathvariant="normal">U</mml:mi></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> is applied to enhance the performance of DL in an effective manner.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Structure of DNN model</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_16754-fig-2.png"/>
</fig>
<sec id="s2_2_1">
<label>2.2.1</label>
<title>Loss Functions</title>
<p>In MLP development, it is important to identify the best parameter to achieve the best function. This procedure includes loss function identification too as a basic procedure. A loss function is applied in the estimation of difference between the predicted and defined values as illustrated in the mathematical model.</p>
<p><disp-formula id="eqn-6">
<label>(6)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-6.png"/><tex-math id="tex-eqn-6"><![CDATA[$$d\left( {t,p} \right) = {\rm \Vert }t - p{\rm \Vert }_2^2$$]]></tex-math>--><mml:math id="mml-eqn-6" display="block"><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>p</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:mo stretchy="false" fence="false">&#x2016;</mml:mo></mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>p</mml:mi><mml:msubsup><mml:mrow><mml:mo stretchy="false" fence="false">&#x2016;</mml:mo></mml:mrow><mml:mn>2</mml:mn><mml:mn>2</mml:mn></mml:msubsup></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-20">
<!--<alternatives><inline-graphic xlink:href="ieqn-20.tif"/><tex-math id="tex-ieqn-20"><![CDATA[$t$]]></tex-math>--><mml:math id="mml-ieqn-20"><mml:mi>t</mml:mi></mml:math>
<!--</alternatives>--></inline-formula> signifies the target value and <inline-formula id="ieqn-21">
<!--<alternatives><inline-graphic xlink:href="ieqn-21.tif"/><tex-math id="tex-ieqn-21"><![CDATA[$p$]]></tex-math>--><mml:math id="mml-ieqn-21"><mml:mi>p</mml:mi></mml:math>
<!--</alternatives>--></inline-formula> implies the detected measure. Multi-class classifier applies negative <inline-formula id="ieqn-22">
<!--<alternatives><inline-graphic xlink:href="ieqn-22.tif"/><tex-math id="tex-ieqn-22"><![CDATA[${\rm log}$]]></tex-math>--><mml:math id="mml-ieqn-22"><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">g</mml:mi></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> probability with <inline-formula id="ieqn-23">
<!--<alternatives><inline-graphic xlink:href="ieqn-23.tif"/><tex-math id="tex-ieqn-23"><![CDATA[$t$]]></tex-math>--><mml:math id="mml-ieqn-23"><mml:mi>t</mml:mi></mml:math>
<!--</alternatives>--></inline-formula> as target class and <inline-formula id="ieqn-24">
<!--<alternatives><inline-graphic xlink:href="ieqn-24.tif"/><tex-math id="tex-ieqn-24"><![CDATA[$p\left( {pad} \right)$]]></tex-math>--><mml:math id="mml-ieqn-24"><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> as probability distribution, which are implied as given below.</p>
<p><disp-formula id="eqn-7">
<label>(7)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-7.png"/><tex-math id="tex-eqn-7"><![CDATA[$$d\left( {t,p\left( {pd} \right)} \right) = - {\rm \; log\; }p{\left( {pd} \right)_t}$$]]></tex-math>--><mml:math id="mml-eqn-7" display="block"><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>p</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">g</mml:mi><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>p</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>Thus, a corrected input-output set is received by <inline-formula id="ieqn-25">
<!--<alternatives><inline-graphic xlink:href="ieqn-25.tif"/><tex-math id="tex-ieqn-25"><![CDATA[${i_ - }o = \left( {{i_1},{\rm \; }{o_1}} \right),\left( {{i_2},{\rm \; }{o_2}} \right),{\rm \; } \cdots {\rm \; },\left( {in,on} \right)$]]></tex-math>--><mml:math id="mml-ieqn-25"><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msub></mml:mrow><mml:mi>o</mml:mi><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mrow><mml:msub><mml:mi>o</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mrow><mml:msub><mml:mi>o</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mo>&#x22EF;</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> from the training operation. Next, the reduction of mean is depicted as follows.</p>
<p><disp-formula id="eqn-8">
<label>(8)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-8.png"/><tex-math id="tex-eqn-8"><![CDATA[$$loss{\rm \; }\left( {in,{\rm \; }on} \right) = {\rm \; }\displaystyle{1 \over n}\mathop \sum \nolimits_{i = 1}^n d\left( {oil,{\rm \; }f{\rm \; }\left( {iris} \right)} \right)$$]]></tex-math>--><mml:math id="mml-eqn-8" display="block"><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac></mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x003D;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mstyle></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>The loss function should be reduced to gain the best results from NN. A loss function is demonstrated as follows.</p>
<p><disp-formula id="eqn-9">
<label>(9)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-9.png"/><tex-math id="tex-eqn-9"><![CDATA[$$Trai{n_{{i_o}}}\left( \theta \right) \equiv {\rm \; }L{i_{o\left( \theta \right)}} = \displaystyle{1 \over n}\mathop \sum \nolimits_{i = 1}^n d\left( {{o_i},{f_\theta }\left( {{i_i}} \right)} \right)$$]]></tex-math>--><mml:math id="mml-eqn-9" display="block"><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mi>o</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mi>L</mml:mi><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac></mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x003D;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>o</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>&#x03B8;</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mstyle></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-26">
<!--<alternatives><inline-graphic xlink:href="ieqn-26.tif"/><tex-math id="tex-ieqn-26"><![CDATA[$\theta = \left( {w1,{\rm \; }{b_1},{\rm \; } \cdots {\rm \; },{\rm \; }{w_n},{\rm \; }{b_n}} \right)$]]></tex-math>--><mml:math id="mml-ieqn-26"><mml:mi>&#x03B8;</mml:mi><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mo>&#x22EF;</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula></p>
<p>Loss function minimization <inline-formula id="ieqn-27">
<!--<alternatives><inline-graphic xlink:href="ieqn-27.tif"/><tex-math id="tex-ieqn-27"><![CDATA[$Li\_o\left( \theta \right)$]]></tex-math>--><mml:math id="mml-ieqn-27"><mml:mi>L</mml:mi><mml:mi>i</mml:mi><mml:mi mathvariant="normal">_</mml:mi><mml:mi>o</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> is performed using an accurate choice of value <inline-formula id="ieqn-28">
<!--<alternatives><inline-graphic xlink:href="ieqn-28.tif"/><tex-math id="tex-ieqn-28"><![CDATA[$\theta \in {{\rm {\mathbb R}}^d}$]]></tex-math>--><mml:math id="mml-ieqn-28"><mml:mi>&#x03B8;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mi>d</mml:mi></mml:msup></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> and is inherently composed of <inline-formula id="ieqn-29">
<!--<alternatives><inline-graphic xlink:href="ieqn-29.tif"/><tex-math id="tex-ieqn-29"><![CDATA[$f\theta {\rm \; }\left( {{p_i}} \right)$]]></tex-math>--><mml:math id="mml-ieqn-29"><mml:mi>f</mml:mi><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> and <inline-formula id="ieqn-30">
<!--<alternatives><inline-graphic xlink:href="ieqn-30.tif"/><tex-math id="tex-ieqn-30"><![CDATA[$\nabla {f_\theta }\left( {{i_i}} \right)$]]></tex-math>--><mml:math id="mml-ieqn-30"><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>&#x03B8;</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> calculation at cost <inline-formula id="ieqn-31">
<!--<alternatives><inline-graphic xlink:href="ieqn-31.tif"/><tex-math id="tex-ieqn-31"><![CDATA[$\left| {{i_ - }o} \right|$]]></tex-math>--><mml:math id="mml-ieqn-31"><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msub></mml:mrow><mml:mi>o</mml:mi></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula>,</p>
<p><disp-formula id="eqn-10">
<label>(10)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-10.png"/><tex-math id="tex-eqn-10"><![CDATA[$$Mi{n_\theta }L\left( \theta \right)$$]]></tex-math>--><mml:math id="mml-eqn-10" display="block"><mml:mi>M</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>&#x03B8;</mml:mi></mml:msub></mml:mrow><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>Different types of optimization models have been developed so far in Gradient Descent (GD) as it is frequently applied in the computation of sequential parameters.</p>
<p><disp-formula id="eqn-11">
<label>(11)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-11.png"/><tex-math id="tex-eqn-11"><![CDATA[$${\theta ^{new}} = {\theta _{old}}-\alpha {\nabla _\theta }L\left( \theta \right)$$]]></tex-math>--><mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:msup><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mi>&#x03B8;</mml:mi></mml:msub></mml:mrow><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where &#x03B1; defines the learning rate which is elected on the basis of hyperparameter selection method. In order to identify a derivative of<inline-formula id="ieqn-32">
<!--<alternatives><inline-graphic xlink:href="ieqn-32.tif"/><tex-math id="tex-ieqn-32"><![CDATA[${\rm \; }L$]]></tex-math>--><mml:math id="mml-ieqn-32"><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mi>L</mml:mi></mml:math>
<!--</alternatives>--></inline-formula>, backpropagation (BP) of errors module is applied in current research work. BP module applies chain rule to calculate the function i.e., &#x03B8; <inline-formula id="ieqn-33">
<!--<alternatives><inline-graphic xlink:href="ieqn-33.tif"/><tex-math id="tex-ieqn-33"><![CDATA[$\in {{\rm {\mathbb R}}^d}$]]></tex-math>--><mml:math id="mml-ieqn-33"><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mi>d</mml:mi></mml:msup></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> to reduce the loss function i.e., <inline-formula id="ieqn-34">
<!--<alternatives><inline-graphic xlink:href="ieqn-34.tif"/><tex-math id="tex-ieqn-34"><![CDATA[${L_{i\_o}}\left( \theta \right)$]]></tex-math>--><mml:math id="mml-ieqn-34"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi mathvariant="normal">_</mml:mi><mml:mi>o</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula>. Thus, NN applies the maximization of BP named as Stochastic Gradient Descent (SGD) to identify the minimum &#x03B8;. SGD employs a mini batch of training samples, <inline-formula id="ieqn-35">
<!--<alternatives><inline-graphic xlink:href="ieqn-35.tif"/><tex-math id="tex-ieqn-35"><![CDATA[$i{m_ - }om$]]></tex-math>--><mml:math id="mml-ieqn-35"><mml:mi>i</mml:mi><mml:mrow><mml:msub><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msub></mml:mrow><mml:mi>o</mml:mi><mml:mi>m</mml:mi></mml:math>
<!--</alternatives>--></inline-formula>, where the training instances <inline-formula id="ieqn-36">
<!--<alternatives><inline-graphic xlink:href="ieqn-36.tif"/><tex-math id="tex-ieqn-36"><![CDATA[${i_ - }o$]]></tex-math>--><mml:math id="mml-ieqn-36"><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msub></mml:mrow><mml:mi>o</mml:mi></mml:math>
<!--</alternatives>--></inline-formula> are randomly selected instead of selection based on a training set <inline-formula id="ieqn-37">
<!--<alternatives><inline-graphic xlink:href="ieqn-37.tif"/><tex-math id="tex-ieqn-37"><![CDATA[$i{m_ - }om \subseteq {i_ - }o$]]></tex-math>--><mml:math id="mml-ieqn-37"><mml:mi>i</mml:mi><mml:mrow><mml:msub><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msub></mml:mrow><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msub></mml:mrow><mml:mi>o</mml:mi></mml:math>
<!--</alternatives>--></inline-formula>. SGD update rule is given herewith.</p>
<p><disp-formula id="eqn-12">
<label>(12)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-12.png"/><tex-math id="tex-eqn-12"><![CDATA[$${\theta ^{new}} = {\theta _{old}}{\rm -}\alpha {\nabla _\theta }J{\rm \; }\left( {\theta ;i{m^{\left( i \right)}},{\rm \; }o{m^{\left( i \right)}}} \right)$$]]></tex-math>--><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:msup><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mi>&#x03B8;</mml:mi></mml:msub></mml:mrow><mml:mi>J</mml:mi><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03B8;</mml:mi><mml:mo>;</mml:mo><mml:mi>i</mml:mi><mml:mrow><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mi>o</mml:mi><mml:mrow><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-38">
<!--<alternatives><inline-graphic xlink:href="ieqn-38.tif"/><tex-math id="tex-ieqn-38"><![CDATA[$i{m^{\left( i \right)}}{\rm \; and\; }o{m^{\left( i \right)}}$]]></tex-math>--><mml:math id="mml-ieqn-38"><mml:mi>i</mml:mi><mml:mrow><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mi>o</mml:mi><mml:mrow><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math>
<!--</alternatives>--></inline-formula> denote the input-output pair training instances.</p>
</sec>
<sec id="s2_2_2">
<label>2.2.2</label>
<title>ReLU Layer</title>
<p>ReLU layer is highly effective and applied in the simulation of training speed. <inline-formula id="ieqn-39">
<!--<alternatives><inline-graphic xlink:href="ieqn-39.tif"/><tex-math id="tex-ieqn-39"><![CDATA[$ReLU$]]></tex-math>--><mml:math id="mml-ieqn-39"><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>L</mml:mi><mml:mi>U</mml:mi></mml:math>
<!--</alternatives>--></inline-formula> is a breakthrough in NN history that arrests the diminishing of gradient problems. It is identified as an effective model by means of training, duration and cost for large scale datasets, compared to conventional non-linear activation functions like sigmoid and tangent functions. The numerical function for <inline-formula id="ieqn-40">
<!--<alternatives><inline-graphic xlink:href="ieqn-40.tif"/><tex-math id="tex-ieqn-40"><![CDATA[$ReLU$]]></tex-math>--><mml:math id="mml-ieqn-40"><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>L</mml:mi><mml:mi>U</mml:mi></mml:math>
<!--</alternatives>--></inline-formula> is given below.</p>
<p><disp-formula id="eqn-13">
<label>(13)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-13.png"/><tex-math id="tex-eqn-13"><![CDATA[$$f\left( x \right) = {\rm \; max\; }\left( {0,{\rm \; }x} \right)$$]]></tex-math>--><mml:math id="mml-eqn-13" display="block"><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">x</mml:mi><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-41">
<!--<alternatives><inline-graphic xlink:href="ieqn-41.tif"/><tex-math id="tex-ieqn-41"><![CDATA[$x$]]></tex-math>--><mml:math id="mml-ieqn-41"><mml:mi>x</mml:mi></mml:math>
<!--</alternatives>--></inline-formula> implies the input. In this study, DNN is comprised of different layers as defined below.</p>
</sec>
<sec id="s2_2_3">
<label>2.2.3</label>
<title>Fully Connected (FC) Layer</title>
<p>FC layer has a link to all the units in subsequent layers. Normally, FC layer performs the mapping of data to a higher dimension. The output layer is highly precise for high dimension data. It makes use of ReLU, a non-linear activation function. In addition, a dropout of 0.01 and batch normalization are applied in FC layers to avoid overfitting and to increase the training speed of DNN model. The dropout removes the neurons with links in a random manner. DNN may go overfitting into training data with no regularization, even if it is trained under large number of sample instances.</p>
</sec>
<sec id="s2_2_4">
<label>2.2.4</label>
<title>Classification</title>
<p>FC layer is the final layer that utilizes a sigmoid activation function for classification. A predictive loss function for sigmoid is represented by binary cross-entropy and the predictive loss is represented by categorical cross-entropy as given below. The prediction loss can be defined as follows.</p>
<p><disp-formula id="eqn-14">
<label>(14)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-14.png"/><tex-math id="tex-eqn-14"><![CDATA[$$loss\left( {pd,ed} \right) = - \displaystyle{1 \over N}\mathop \sum \limits_{i = 1}^N \left[ {e{d_i}logp{d_i} + \left( {1 - e{d_i}} \right){\rm log}\left( {1 - p{d_i}} \right)} \right]$$]]></tex-math>--><mml:math id="mml-eqn-14" display="block"><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>p</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x003D;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mi>p</mml:mi><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x002B;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>e</mml:mi><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">g</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>p</mml:mi><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mstyle></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>Here, &#x2018;pd&#x2019; is a vector of predicted probability for every sample in testing dataset and &#x2018;ed&#x2019; is a vector of predictable classes, 0 or 1.</p>
</sec>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Adagrad Optimizer</title>
<p>ADO (Adagrad Optimizer) is employed to fine tune the parameters of DNN model. The existing adaptive gradient models offer element-wise scaling term on learning rate, which ensures no manual intervention to tune the learning rate. It utilizes the past data to estimate the curvature of loss function and implements diverse learning rates for all parameters. Therefore, learning rate is a vector and every element in a parameter is diverse from conventional learning rate methodologies. In this study, ADO is employed which adopts a small learning rate parameter equivalent to recurrent features and a large learning rate parameter equivalent to rare features. Consequently, ADO is highly appropriate to train the sparse data as it enhances the robust nature of SGD model. ADO can be updated using the <xref ref-type="disp-formula" rid="eqn-15">Eqs. (15)</xref> and <xref ref-type="disp-formula" rid="eqn-16">(16)</xref>.</p>
<p><disp-formula id="eqn-15">
<label>(15)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-15.png"/><tex-math id="tex-eqn-15"><![CDATA[$${w_k} = {w_{k - 1}} - \eta \displaystyle{{\nabla f\left( {{w_{k - 1}}} \right)} \over {\sqrt {{v_k}} + \varepsilon }},{\rm \; }$$]]></tex-math>--><mml:math id="mml-eqn-15" display="block"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B7;</mml:mi><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msqrt><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:msqrt><mml:mo>&#x002B;</mml:mo><mml:mi>&#x03B5;</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow></mml:mstyle></mml:math>
<!--</alternatives>--></disp-formula></p>
<p><disp-formula id="eqn-16">
<label>(16)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-16.png"/><tex-math id="tex-eqn-16"><![CDATA[$${v_k} = \mathop \sum \limits_{j = 0}^{k - 1} \nabla f{\left( {{w_j}} \right)^2},$$]]></tex-math>--><mml:math id="mml-eqn-16" display="block"><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x003D;</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mi>f</mml:mi><mml:mrow><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>,</mml:mo></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-42">
<!--<alternatives><inline-graphic xlink:href="ieqn-42.tif"/><tex-math id="tex-ieqn-42"><![CDATA[$e$]]></tex-math>--><mml:math id="mml-ieqn-42"><mml:mi>e</mml:mi></mml:math>
<!--</alternatives>--></inline-formula> denotes a smoothing term which avoids to be divided by 0 and &#x03B7; is the learning rate [<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Experimental Validation</title>
<p>In this section, the researchers validated the performance of NN-AGOA model on the applied dataset [<xref ref-type="bibr" rid="ref-19">19</xref>]. DNN-AGOA model was simulated in a PC loaded with Python 3.6.5 and its specifications were as follows; Processor&#x2014;i5-8600k, MSI Z370 A-Pro, GeForce 1050Ti 4 GB, 16 GB RAM, 250 GB SSD, and 1TB HDD. To train the DNN model, 10-fold cross-validation was performed and the dataset was split into training and testing datasets. The additional packages used for simulation were TensorFlow-gpu &#x003D;&#x003D; 1.14.0, pyqt5 &#x003D;&#x003D; 5.14, pandas, scikit-learn, matplotlib, prettytable, seaborn, tqdm, numpy &#x003D;&#x003D; 1.16.0, and h5py &#x003D;&#x003D; 2.7.0. <xref ref-type="table" rid="table-1">Tab. 1</xref> shows the details of the dataset used in the study. Different processes, involved in the simulation of the proposed model, are shown in Appendix. As shown in the table, the test dataset includes a set of 400 instances with 24 attributes. In addition, the dataset includes a set of two classes. A total of 137 instances is grouped under DM presence whereas 263 instances are placed under DM absence. Besides, a total of 34 samples belongs to the presence of Coronary Artery Disease and 366 instances with the presence of artery class. Moreover, a total of 250 and 150 samples come under the presence and absence of CKD respectively.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Dataset description</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Description</th>
<th>Values</th>
</tr>
</thead>
<tbody>
<tr>
<td>No. of Samples</td>
<td>400</td>
</tr>
<tr>
<td>No. of features</td>
<td>24</td>
</tr>
<tr>
<td>No. of class labels</td>
<td>2</td>
</tr>
<tr>
<td>Number of Positive Diabetes Mellitus Sample Instances</td>
<td>137</td>
</tr>
<tr>
<td>Number of Negative Diabetes Mellitus Sample Instances</td>
<td>263</td>
</tr>
<tr>
<td>Number of Positive Coronary Artery Sample Instances</td>
<td>34</td>
</tr>
<tr>
<td>Number of Negative Diabetes Artery Sample Instances</td>
<td>366</td>
</tr>
<tr>
<td>Number of Positive CKD Sample Instances</td>
<td>250</td>
</tr>
<tr>
<td>Number of Negative CKD Sample Instances</td>
<td>150</td>
</tr>
<tr>
<td>Data source</td>
<td>[<xref ref-type="bibr" rid="ref-19">19</xref>]</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-3">Fig. 3</xref> shows the sets of confusion matrices generated by DNN-AGOA model on the applied dataset. <xref ref-type="fig" rid="fig-3">Fig. 3a</xref> is the confusion matrix produced by DNN-AGOA model during DM classification. The figure portrays that the DNN-AGOA model classified 227 instances as DM absent and 121 instances as DM present. Similarly, <xref ref-type="fig" rid="fig-3">Fig. 3b</xref> portrays the confusion matrix produced by DNN-AGOA model in the classification of Coronary Artery Disease. The figure infers that the DNN-AGOA model classified a total of 362 instances as Coronary Artery Disease absent and 12 instances as Coronary Artery Disease present. Likewise, <xref ref-type="fig" rid="fig-3">Fig. 3c</xref> reveals the confusion matrix generated by DNN-AGOA model on the classification of Coronary Artery Disease. The figure represents that the DNN-AGOA model classified a total of 148 instances as CKD absent and 241 instances as CKD present.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Confusion matrix (a) DM (b) Coronary artery disease (c) CKD</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_16754-fig-3.png"/>
</fig>
<p><xref ref-type="table" rid="table-2">Tab. 2</xref> and <xref ref-type="fig" rid="fig-4">Figs. 4</xref> and <xref ref-type="fig" rid="fig-5">5</xref> demonstrate the classification results attained by DNN-AGOA model in different diseases. The results infer that the DNN-AGOA model attained a proficient diagnostic outcome on the classification of different diseases. For instance, the DNN-AGOA model categorized DM disease at a high precision of 93.42%, recall of 86.31%, specificity of 88.32%, accuracy of 87%, and F-score of 89.72%. Concurrently, the DNN-AGOA model categorized Coronary Artery Disease with a superior precision of 94.27%, recall of 98.91%, specificity of 35.29%, accuracy of 93.50%, and F-score of 96.53%. Likewise, the DNN-AGOA model categorized CKD disease with a maximum precision of 94.27%, recall of 98.67%, specificity of 96.40%, accuracy of 97.25%, and F-score of 96.42%.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Result of DNN-AGOA model with different measures</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_16754-fig-4.png"/>
</fig>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Results of DNN-AGOA model in terms of accuracy and F-score</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_16754-fig-5.png"/>
</fig>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Results of DNN-AGOA model in terms of different measures</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Dataset</th>
<th>Precision</th>
<th>Recall</th>
<th>Specificity</th>
<th>Accuracy</th>
<th>F-score</th>
</tr>
</thead>
<tbody>
<tr>
<td>Diabetes Mellitus</td>
<td>93.42</td>
<td>86.31</td>
<td>88.32</td>
<td>87.00</td>
<td>89.72</td>
</tr>
<tr>
<td>Coronary Artery Disease</td>
<td>94.27</td>
<td>98.91</td>
<td>35.29</td>
<td>93.50</td>
<td>96.53</td>
</tr>
<tr>
<td>Chronic Kidney Disease</td>
<td>94.27</td>
<td>98.67</td>
<td>96.40</td>
<td>97.25</td>
<td>96.42</td>
</tr>
<tr>
<td>Average</td>
<td>93.99</td>
<td>94.63</td>
<td>73.34</td>
<td>92.58</td>
<td>94.22</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> shows the results attained by DNN-AGOA model for the classification of diverse diseases. The figure reveals that the DNN-AGOA model achieved a maximum precision of 93.99%, recall of 94.63%, specificity of 73.34%, accuracy of 92.58%, and F-score of 94.22%.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Average analysis of DNN-AGOA model with different measures</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_16754-fig-6.png"/>
</fig>
<p><xref ref-type="table" rid="table-3">Tab. 3</xref> and <xref ref-type="fig" rid="fig-7">Figs. 7</xref> and <xref ref-type="fig" rid="fig-8">8</xref> show a comparison of classification results achieved by DNN-AGOA model, when analyzing the applied dataset [<xref ref-type="bibr" rid="ref-20">20</xref>&#x2013;<xref ref-type="bibr" rid="ref-23">23</xref>]. The resultant values demonstrate that the DNN-AGOA model achieved effective results in diagnosing different diseases. When comparing the results of DNN-AGOA model in terms of precision, the figure reveals that both AI-CHD and DT models failed in achieving an effective outcome, since it yielded minimal precision values such as 80% and 81.40% respectively. Besides, the LogitBoost model attempted to show slightly better precision of 84.60%. Along with that, ACO, PSO, LR, and SVM models yielded moderately close precision values such as 87.34%, 86.24%, 88%, and 86.86% correspondingly. In line with these, MRODC and Voted Perceptron models reached near-optimal precision values of 91.80% and 92.40% respectively. But the presented DNN-AGOA model outperformed all the models compared and exhibited the maximum precision of 93.99%.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Comparative analysis of DNN-AGOA model in terms of precision and recall</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_16754-fig-7.png"/>
</fig>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Comparative analysis of DNN-AGOA model in terms of accuracy and F-score</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_16754-fig-8.png"/>
</fig>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Comparative analysis of DNN-AGOA model in different measures</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Precision</th>
<th>Recall</th>
<th>Accuracy</th>
<th>F-score</th>
</tr>
</thead>
<tbody>
<tr>
<td>DNN-AGOA</td>
<td>93.99</td>
<td>94.63</td>
<td>92.58</td>
<td>94.22</td>
</tr>
<tr>
<td>AI-CHD</td>
<td>80.00</td>
<td>20.41</td>
<td>80.88</td>
<td>56.18</td>
</tr>
<tr>
<td>ACO</td>
<td>87.34</td>
<td>88.88</td>
<td>87.50</td>
<td>90.56</td>
</tr>
<tr>
<td>PSO</td>
<td>86.24</td>
<td>88.00</td>
<td>85.00</td>
<td>88.00</td>
</tr>
<tr>
<td>MRODC</td>
<td>91.80</td>
<td>90.89</td>
<td>88.67</td>
<td>91.34</td>
</tr>
<tr>
<td>Logistic Regression</td>
<td>88.00</td>
<td>79.27</td>
<td>77.21</td>
<td>83.41</td>
</tr>
<tr>
<td>Voted Perceptron</td>
<td>92.40</td>
<td>68.04</td>
<td>66.79</td>
<td>78.37</td>
</tr>
<tr>
<td>LogitBoost</td>
<td>84.60</td>
<td>77.61</td>
<td>74.08</td>
<td>80.95</td>
</tr>
<tr>
<td>Decision Tree</td>
<td>81.40</td>
<td>79.02</td>
<td>73.82</td>
<td>80.19</td>
</tr>
<tr>
<td>SVM Model</td>
<td>86.86</td>
<td>87.10</td>
<td>86.87</td>
<td>88.22</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>When comparing the results achieved by DNN-AGOA model in terms of recall, the figure portrays that both AI-CHD and Voted Perceptron methods failed in gaining efficient results since it achieved the least recall values of 20.41% and 68.04% respectively. Followed by, the LogitBoost approach attempted to exhibit a moderate recall of 77.61%. Similarly, the DT, LR, PSO, and ACO schemes implied considerable recall values such as 79.02%, 79.27%, 88%, and 88.88% correspondingly. In line with these, both SVM and MRODC models attained near-optimal recall values of 87.1% and 90.89% respectively. However, the projected DNN-AGOA model surpassed all the compared models and exhibited a higher recall of 94.63%. Besides, when comparing the results of DNN-AGOA model with respect to accuracy, the figure depicts that both Voted Perceptron and DT models failed in achieving effective outcomes since it achieved the least accuracy values such as 66.79% and 73.82% respectively. Besides, the LogitBoost model tried to achieve a reasonably better accuracy of 74.08%.</p>
<p>Likewise, the LR, AI-CHD, PSO, and SVM models accomplished moderately closer accuracy values such as 77.21%, 80.88%, 85%, and 86.87% respectively. In line with these, both ACO and MRODC models reached closer optimal accuracy values such as 87.5% and 88.67% respectively. But the presented DNN-AGOA scheme performed well compared to other methods and showcased a high accuracy of 92.58%. Followed by, when comparing the results of DNN-AGOA model in terms of F-score, the figure demonstrates that both AI-CHD and Voted Perceptron models failed in gaining better outcomes since it attained the minimum F-scores of 56.18% and 78.37% respectively. Besides, the DT model managed to display a reasonable F-score of 80.19% Along with that, the LogitBoost, LR, PSO, and SVM models accomplished acceptable closer F-score values such as 80.95%, 83.41%, 88%, and 88.22% correspondingly. In line with these, both ACO and MRODC models reached near-optimal F-score values such as 90.56% and 91.34% correspondingly. But the presented DNN-AGOA model outperformed all other traditional models and attained a supreme F-score of 94.22%.</p>
<p>From the above-mentioned tables and figures, it is apparent that the DNN-AGOA model is an effective model for disease diagnosis. During experimentation, the DNN-AGOA model attained a maximum precision of 93.99%, recall of 94.63%, specificity of 73.34%, accuracy of 92.58%, and F-score of 94.22%. This is attributed to the inclusion of AGO in the process which fine-tuned the parameters in DNN model.</p>
</sec>
<sec id="s4">
<label>4</label>
<title>Conclusion</title>
<p>The current research work presented an automated DNN with Adagrad optimizer i.e., DNN-AGOA model for CKD and CHD risk prediction in T2DM patients. The aim of this study is to design a risk prediction model for T2DM patients who may develop CKD or CHD. This model can provide early warning to both T2DM patients and their clinicians. In this study, the input dataset was initially verified for the presence of T2DM. Subsequently, data instances with T2DM presence were processed significantly to predict the risks of CKD and CHD. Here, the sigmoid layer was held responsible for the allocation of proper class labels in applied test input. To enhance the efficiency of DNN model, the hyperparameters were tuned using Adagrad optimizer. In order to validate the effectiveness of DNN-AGOA model, benchmark medical datasets were used and the results were determined under several aspects. DNN-AGOA model achieved better performance with a maximum precision of 93.99%, recall of 94.63%, specificity of 73.34%, accuracy of 92.58%, and F-score of 94.22%. The results established the supremacy of the proposed model compared to existing models. In future, the performance can further be enhanced using advanced DL models.</p>
</sec>
</body>
<back>
<ack>
<p>This article has been published under RUSA Phase 2.0 grant sanctioned vide letter No. F. 24-51/2014-U, Policy (TN Multi-Gen), Dept. of Edn. Govt. of India, Date: 09.10.2018.</p>
</ack><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> The authors received no specific funding for this study.</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1">
<label>[1]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>G.</given-names> 
<surname>Sebastiani</surname></string-name>, <string-name>
<given-names>L.</given-names> 
<surname>Nigi</surname></string-name>, <string-name>
<given-names>G. E.</given-names> 
<surname>Grieco</surname></string-name>, <string-name>
<given-names>F.</given-names> 
<surname>Mancarella</surname></string-name>, <string-name>
<given-names>C.</given-names> 
<surname>Ventriglia</surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>Circulating microRNAs and diabetes mellitus: A novel tool for disease prediction, diagnosis, and staging?</article-title>,&#x201D; 
<source>Journal of Endocrinological Investigation</source>, vol. 
<volume>40</volume>, pp. 
<fpage>591</fpage>&#x2013;
<lpage>610</lpage>, 
<year>2017</year>.</mixed-citation>
</ref>
<ref id="ref-2">
<label>[2]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>Y.</given-names> 
<surname>Zheng</surname></string-name>, <string-name>
<given-names>S. H.</given-names> 
<surname>Ley</surname></string-name> and <string-name>
<given-names>F. B.</given-names> 
<surname>Hu</surname></string-name>
</person-group>, &#x201C;
<article-title>Global aetiology and epidemiology of type 2 diabetes mellitus and its complications</article-title>,&#x201D; 
<source>Nature Reviews Endocrinology</source>, vol. 
<volume>14</volume>, pp. 
<fpage>88</fpage>&#x2013;
<lpage>98</lpage>, 
<year>2018</year>.</mixed-citation>
</ref>
<ref id="ref-3">
<label>[3]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>P. W. F.</given-names> 
<surname>Wilson</surname></string-name>, <string-name>
<given-names>R. B.</given-names> 
<surname>D&#x2019;Agostino</surname></string-name>, <string-name>
<given-names>D.</given-names> 
<surname>Levy</surname></string-name>, <string-name>
<given-names>A. M.</given-names> 
<surname>Belanger</surname></string-name>, <string-name>
<given-names>H.</given-names> 
<surname>Silbershatz</surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>Prediction of coronary heart disease using risk factor categories</article-title>,&#x201D; 
<source>Circulation</source>, vol. 
<volume>97</volume>, no. 
<issue>18</issue>, pp. 
<fpage>1837</fpage>&#x2013;
<lpage>1847</lpage>, 
<year>1998</year>.</mixed-citation>
</ref>
<ref id="ref-4">
<label>[4]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>M.</given-names> 
<surname>Haller</surname></string-name>, <string-name>
<given-names>G.</given-names> 
<surname>Gutjahr</surname></string-name>, <string-name>
<given-names>R.</given-names> 
<surname>Kramar</surname></string-name>, <string-name>
<given-names>F.</given-names> 
<surname>Harnoncourt</surname></string-name> and <string-name>
<given-names>R.</given-names> 
<surname>Oberbauer</surname></string-name>
</person-group>, &#x201C;
<article-title>Cost-effectiveness analysis of renal replacement therapy in Austria</article-title>,&#x201D; 
<source>Nephrology Dialysis Transplantation</source>, vol. 
<volume>26</volume>, no. 
<issue>9</issue>, pp. 
<fpage>2988</fpage>&#x2013;
<lpage>2995</lpage>, 
<year>2011</year>.</mixed-citation>
</ref>
<ref id="ref-5">
<label>[5]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>P. O.</given-names> 
<surname>Bloti&#x00E8;re</surname></string-name>, <string-name>
<given-names>P.</given-names> 
<surname>Tuppin</surname></string-name>, <string-name>
<given-names>A.</given-names> 
<surname>Weill</surname></string-name>, <string-name>
<given-names>P.</given-names> 
<surname>Ricordeau</surname></string-name> and <string-name>
<given-names>H.</given-names> 
<surname>Allemand</surname></string-name>
</person-group>, &#x201C;
<article-title>The cost of dialysis and kidney transplantation in France in 2007, impact of an increase of peritoneal dialysis and transplantation</article-title>,&#x201D; 
<source>N&#x00E9;phrologie &#x0026; Th&#x00E9;rapeutique</source>, vol. 
<volume>6</volume>, no. 
<issue>4</issue>, pp. 
<fpage>240</fpage>&#x2013;
<lpage>247</lpage>, 
<year>2010</year>.</mixed-citation>
</ref>
<ref id="ref-6">
<label>[6]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>A. S.</given-names> 
<surname>Levey</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Coresh</surname></string-name>, <string-name>
<given-names>K.</given-names> 
<surname>Bolton</surname></string-name>, <string-name>
<given-names>B.</given-names> 
<surname>Culleton</surname></string-name> and <string-name>
<given-names>K. S.</given-names> 
<surname>Harvey</surname></string-name>
</person-group>, &#x201C;
<article-title>K/DOQI clinical practice guidelines for chronic kidney disease: Evaluation, classification, and stratification</article-title>,&#x201D; 
<source>American Journal of Kidney Diseases</source>, vol. 
<volume>39</volume>, no. 
<issue>2</issue>, pp. 
<fpage>S1</fpage>&#x2013;
<lpage>S266</lpage>, 
<year>2002</year>.</mixed-citation>
</ref>
<ref id="ref-7">
<label>[7]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>A. S.</given-names> 
<surname>Go</surname></string-name>, <string-name>
<given-names>G. M.</given-names> 
<surname>Chertow</surname></string-name>, <string-name>
<given-names>D.</given-names> 
<surname>Fan</surname></string-name>, <string-name>
<given-names>C. E.</given-names> 
<surname>McCulloch</surname></string-name> and <string-name>
<given-names>C.</given-names> 
<surname>Hsu</surname></string-name>
</person-group>, &#x201C;
<article-title>Chronic kidney disease and the risks of death, cardiovascular events, and hospitalization</article-title>,&#x201D; 
<source>New England Journal of Medicine</source>, vol. 
<volume>351</volume>, no. 
<issue>13</issue>, pp. 
<fpage>1296</fpage>&#x2013;
<lpage>1305</lpage>, 
<year>2004</year>.</mixed-citation>
</ref>
<ref id="ref-8">
<label>[8]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>K.</given-names> 
<surname>Orphanou</surname></string-name>, <string-name>
<given-names>A.</given-names> 
<surname>Stassopoulou</surname></string-name> and <string-name>
<given-names>E.</given-names> 
<surname>Keravnou</surname></string-name>
</person-group>, &#x201C;
<article-title>Temporal abstraction and temporal Bayesian networks in clinical domains: A survey</article-title>,&#x201D; 
<source>Artificial Intelligence in Medicine</source>, vol. 
<volume>60</volume>, no. 
<issue>3</issue>, pp. 
<fpage>133</fpage>&#x2013;
<lpage>149</lpage>, 
<year>2014</year>.</mixed-citation>
</ref>
<ref id="ref-9">
<label>[9]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>J.</given-names> 
<surname>Zhao</surname></string-name> and <string-name>
<given-names>A.</given-names> 
<surname>Henriksson</surname></string-name>
</person-group>, &#x201C;
<article-title>Learning temporal weights of clinical events using variable importance</article-title>,&#x201D; 
<source>BMC Medical Informatics and Decision Making</source>, vol. 
<volume>16</volume>, pp. 
<fpage>111</fpage>&#x2013;
<lpage>121</lpage>, 
<year>2016</year>.</mixed-citation>
</ref>
<ref id="ref-10">
<label>[10]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>J.</given-names> 
<surname>Lin</surname></string-name>, <string-name>
<given-names>E.</given-names> 
<surname>Keogh</surname></string-name>, <string-name>
<given-names>L.</given-names> 
<surname>Wei</surname></string-name> and <string-name>
<given-names>S.</given-names> 
<surname>Lonardi</surname></string-name>
</person-group>, &#x201C;
<article-title>Experiencing SAX: A novel symbolic representation of time series</article-title>,&#x201D; 
<source>Data Mining and Knowledge Discovery</source>, vol. 
<volume>15</volume>, pp. 
<fpage>107</fpage>&#x2013;
<lpage>144</lpage>, 
<year>2007</year>.</mixed-citation>
</ref>
<ref id="ref-11">
<label>[11]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>M. J.</given-names> 
<surname>Jardine</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Hata</surname></string-name>, <string-name>
<given-names>M.</given-names> 
<surname>Woodward</surname></string-name>, <string-name>
<given-names>V.</given-names> 
<surname>Perkovic</surname></string-name>, <string-name>
<given-names>T.</given-names> 
<surname>Ninomiya</surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>Prediction of kidney-related outcomes in patients with type 2 diabetes</article-title>,&#x201D; 
<source>American Journal of Kidney Diseases</source>, vol. 
<volume>60</volume>, no. 
<issue>5</issue>, pp. 
<fpage>770</fpage>&#x2013;
<lpage>778</lpage>, 
<year>2012</year>.</mixed-citation>
</ref>
<ref id="ref-12">
<label>[12]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>C.</given-names> 
<surname>Lin</surname></string-name>, <string-name>
<given-names>C.</given-names> 
<surname>Li</surname></string-name>, <string-name>
<given-names>C.</given-names> 
<surname>Liu</surname></string-name>, <string-name>
<given-names>W.</given-names> 
<surname>Lin</surname></string-name>, <string-name>
<given-names>C.</given-names> 
<surname>Lin</surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>Development and validation of a risk prediction model for end-stage renal disease in patients with type 2 diabetes</article-title>,&#x201D; 
<source>Scientific Reports</source>, vol. 
<volume>7</volume>, pp. 
<fpage>1</fpage>&#x2013;
<lpage>13</lpage>, 
<year>2017</year>.</mixed-citation>
</ref>
<ref id="ref-13">
<label>[13]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>Y.</given-names> 
<surname>Hagar</surname></string-name>, <string-name>
<given-names>D.</given-names> 
<surname>Albers</surname></string-name>, <string-name>
<given-names>R.</given-names> 
<surname>Pivovarov</surname></string-name>, <string-name>
<given-names>H.</given-names> 
<surname>Chase</surname></string-name>, <string-name>
<given-names>V.</given-names> 
<surname>Dukic </surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>Survival analysis with electronic health record data: Experiments with chronic kidney disease</article-title>,&#x201D; 
<source>Statistical Analysis and Data Mining</source>, vol. 
<volume>7</volume>, no. 
<issue>5</issue>, pp. 
<fpage>385</fpage>&#x2013;
<lpage>403</lpage>, 
<year>2014</year>.</mixed-citation>
</ref>
<ref id="ref-14">
<label>[14]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>A.</given-names> 
<surname>Singh</surname></string-name>, <string-name>
<given-names>G.</given-names> 
<surname>Nadkarni</surname></string-name>, <string-name>
<given-names>O.</given-names> 
<surname>Gottesman</surname></string-name>, <string-name>
<given-names>S. B.</given-names> 
<surname>Ellis</surname></string-name>, <string-name>
<given-names>E. P.</given-names> 
<surname>Bottinger </surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>Incorporating temporal EHR data in predictive models for risk stratification of renal function deterioration</article-title>,&#x201D; 
<source>Journal of Biomedical Informatics</source>, vol. 
<volume>53</volume>, pp. 
<fpage>220</fpage>&#x2013;
<lpage>228</lpage>, 
<year>2015</year>.</mixed-citation>
</ref>
<ref id="ref-15">
<label>[15]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>L. J.</given-names> 
<surname>Koyner</surname></string-name>, <string-name>
<given-names>A. K.</given-names> 
<surname>Carey</surname></string-name>, <string-name>
<given-names>P. D.</given-names> 
<surname>Edelson</surname></string-name> and <string-name>
<given-names>M. M.</given-names> 
<surname>Churpek</surname></string-name>
</person-group>, &#x201C;
<article-title>The development of a machine learning inpatient acute kidney injury prediction model</article-title>,&#x201D; 
<source>Critical Care Medicine</source>, vol. 
<volume>46</volume>, no. 
<issue>7</issue>, pp. 
<fpage>1070</fpage>&#x2013;
<lpage>1077</lpage>, 
<year>2018</year>.</mixed-citation>
</ref>
<ref id="ref-16">
<label>[16]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>A.</given-names> 
<surname>Rajkomar</surname></string-name>, <string-name>
<given-names>E.</given-names> 
<surname>Oren</surname></string-name>, <string-name>
<given-names>K.</given-names> 
<surname>Chen</surname></string-name>, <string-name>
<given-names>A. M.</given-names> 
<surname>Dai</surname></string-name>, <string-name>
<given-names>N.</given-names> 
<surname>Hajaj</surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>Scalable and accurate deep learning with electronic health records</article-title>,&#x201D; 
<source>NPJ Digital Medicine</source>, vol. 
<volume>1</volume>, pp. 
<fpage>18</fpage>, 
<year>2018</year>.</mixed-citation>
</ref>
<ref id="ref-17">
<label>[17]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>R.</given-names> 
<surname>Vinayakumar</surname></string-name>, <string-name>
<given-names>M.</given-names> 
<surname>Alazab</surname></string-name>, <string-name>
<given-names>K. P.</given-names> 
<surname>Soman</surname></string-name>, <string-name>
<given-names>P.</given-names> 
<surname>Poornachandran</surname></string-name>, <string-name>
<given-names>A.</given-names> 
<surname>Al-Nemrat</surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>Deep learning approach for intelligent intrusion detection system</article-title>,&#x201D; 
<source>IEEE Access</source>, vol. 
<volume>7</volume>, pp. 
<fpage>41525</fpage>&#x2013;
<lpage>41550</lpage>, 
<year>2019</year>.</mixed-citation>
</ref>
<ref id="ref-18">
<label>[18]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>M.</given-names> 
<surname>Tang</surname></string-name>, <string-name>
<given-names>Z.</given-names> 
<surname>Huang</surname></string-name>, <string-name>
<given-names>Y.</given-names> 
<surname>Yuan</surname></string-name>, <string-name>
<given-names>C.</given-names> 
<surname>Wang</surname></string-name> and <string-name>
<given-names>Y.</given-names> 
<surname>Peng</surname></string-name>
</person-group>, &#x201C;
<article-title>A bounded scheduling method for adaptive gradient methods</article-title>,&#x201D; 
<source>Applied Sciences</source>, vol. 
<volume>9</volume>, no. 
<issue>17</issue>, pp. 
<fpage>1</fpage>&#x2013;
<lpage>16</lpage>, 
<year>2019</year>.</mixed-citation>
</ref>
<ref id="ref-19">
<label>[19]</label><mixed-citation publication-type="other">
<person-group person-group-type="author">
<collab>Dataset</collab>
</person-group>. <year>2020</year>. 
[Online] Available: <uri>https://archive.ics.uci.edu/ml/datasets/Chronic_Kidney_Disease</uri>. <comment>Accessed on October 16, 2020</comment>.</mixed-citation>
</ref>
<ref id="ref-20">
<label>[20]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>R.</given-names> 
<surname>Fan</surname></string-name>, <string-name>
<given-names>N.</given-names> 
<surname>Zhang</surname></string-name>, <string-name>
<given-names>L.</given-names> 
<surname>Yang</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Ke</surname></string-name>, <string-name>
<given-names>D.</given-names> 
<surname>Zhao </surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>AI-based prediction for the risk of coronary heart disease among patients with type 2 diabetes mellitus</article-title>,&#x201D; 
<source>Scientific Reports</source>, vol. 
<volume>10</volume>, pp. 
<fpage>14457</fpage>, 
<year>2020</year>.</mixed-citation>
</ref>
<ref id="ref-21">
<label>[21]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>M.</given-names> 
<surname>Elhoseny</surname></string-name>, <string-name>
<given-names>K.</given-names> 
<surname>Shankar</surname></string-name> and <string-name>
<given-names>J.</given-names> 
<surname>Uthayakumar</surname></string-name>
</person-group>, &#x201C;
<article-title>Intelligent diagnostic prediction and classification system for chronic kidney disease</article-title>,&#x201D; 
<source>Scientific Reports</source>, vol. 
<volume>9</volume>, no. 
<issue>1</issue>, pp. 
<fpage>1</fpage>&#x2013;
<lpage>14</lpage>, 
<year>2019</year>.</mixed-citation>
</ref>
<ref id="ref-22">
<label>[22]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>R. T.</given-names> 
<surname>Selvi</surname></string-name> and <string-name>
<given-names>I.</given-names> 
<surname>Muthulakshmi</surname></string-name>
</person-group>, &#x201C;
<article-title>Modelling the map reduce based optimal gradient boosted tree classification algorithm for diabetes mellitus diagnosis system</article-title>,&#x201D; 
<source>Journal of Ambient Intelligence and Humanized Computing</source>, vol. <volume>12</volume>, no. <issue>2</issue>, pp. <fpage>1717</fpage>&#x2013;<lpage>1730</lpage>.</mixed-citation>
</ref>
<ref id="ref-23">
<label>[23]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>M. S.</given-names> 
<surname>Amin</surname></string-name>, <string-name>
<given-names>Y. K.</given-names> 
<surname>Chiam</surname></string-name> and <string-name>
<given-names>K. D.</given-names> 
<surname>Varathan</surname></string-name>
</person-group>, &#x201C;
<article-title>Identification of significant features and data mining techniques in predicting heart disease</article-title>,&#x201D; 
<source>Telematics and Informatics</source>, vol. 
<volume>36</volume>, no. 
<issue>1</issue>, pp. 
<fpage>82</fpage>&#x2013;
<lpage>93</lpage>, 
<year>2019</year>.</mixed-citation>
</ref>
</ref-list>
<app-group>
<app id="app-1">
<title></title>
<sec id="s5">
<title>Appendix A.</title>
<p>Training Results of Diabetes Mellitus</p>
<p><inline-graphic xlink:href="CSSE_16754-fig-9.png"/></p>
</sec>
</app>
<app id="app-2">
<title></title>
<sec id="s6">
<title>Appendix B.</title>
<p>Training Results of Coronary Artery Disease Chronic Kidney Disease</p>
<p><inline-graphic xlink:href="CSSE_16754-fig-10.png"/></p>
</sec>
</app>
<app id="app-3">
<title></title>
<sec id="s7">
<title>Appendix C.</title>
<p>Training Results of Chronic Kidney Disease</p>
<p><inline-graphic xlink:href="CSSE_16754-fig-11.png"/></p>
</sec>
</app>
<app id="app-4">
<title></title>
<sec id="s8">
<title>Appendix D.</title>
<p>Testing of Medical Record</p>
<p><inline-graphic xlink:href="CSSE_16754-fig-12.png"/></p>
</sec>
</app>
</app-group>
</back>
</article>