<?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" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</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">55906</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2024.055906</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>A Modified Deep Residual-Convolutional Neural Network for Accurate Imputation of Missing Data</article-title>
<alt-title alt-title-type="left-running-head">A Modified Deep Residual-Convolutional Neural Network for Accurate Imputation of Missing Data</alt-title>
<alt-title alt-title-type="right-running-head">A Modified Deep Residual-Convolutional Neural Network for Accurate Imputation of Missing Data</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Firdaus</surname><given-names>Firdaus</given-names></name></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Nurmaini</surname><given-names>Siti</given-names></name><email>siti_nurmaini@unsri.ac.id</email></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Islami</surname><given-names>Anggun</given-names></name></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Darmawahyuni</surname><given-names>Annisa</given-names></name></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Sapitri</surname><given-names>Ade Iriani</given-names></name></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Rachmatullah</surname><given-names>Muhammad Naufal</given-names></name></contrib>
<contrib id="author-7" contrib-type="author">
<name name-style="western"><surname>Tutuko</surname><given-names>Bambang</given-names></name></contrib>
<contrib id="author-8" contrib-type="author">
<name name-style="western"><surname>Arum</surname><given-names>Akhiar Wista</given-names></name></contrib>
<contrib id="author-9" contrib-type="author">
<name name-style="western"><surname>Karim</surname><given-names>Muhammad Irfan</given-names></name></contrib>
<contrib id="author-10" contrib-type="author">
<name name-style="western"><surname>Yultrien</surname><given-names>Yultrien</given-names></name></contrib>
<contrib id="author-11" contrib-type="author">
<name name-style="western"><surname>Wandya</surname><given-names>Ramadhana Noor Salassa</given-names></name></contrib>
<aff><institution>Intelligent System Research Group, Faculty of Computer Science, Universitas Sriwijaya</institution>, <addr-line>Palembang, 30139</addr-line>, <country>Indonesia</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Siti Nurmaini. Email: <email>siti_nurmaini@unsri.ac.id</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>17</day><month>02</month><year>2025</year>
</pub-date>
<volume>82</volume>
<issue>2</issue>
<fpage>3419</fpage>
<lpage>3441</lpage>
<history>
<date date-type="received">
<day>10</day>
<month>7</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>21</day>
<month>10</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</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_CMC_55906.pdf"></self-uri>
<abstract>
<p>Handling missing data accurately is critical in clinical research, where data quality directly impacts decision-making and patient outcomes. While deep learning (DL) techniques for data imputation have gained attention, challenges remain, especially when dealing with diverse data types. In this study, we introduce a novel data imputation method based on a modified convolutional neural network, specifically, a Deep Residual-Convolutional Neural Network (DRes-CNN) architecture designed to handle missing values across various datasets. Our approach demonstrates substantial improvements over existing imputation techniques by leveraging residual connections and optimized convolutional layers to capture complex data patterns. We evaluated the model on publicly available datasets, including Medical Information Mart for Intensive Care (MIMIC-III and MIMIC-IV), which contain critical care patient data, and the Beijing Multi-Site Air Quality dataset, which measures environmental air quality. The proposed DRes-CNN method achieved a root mean square error (RMSE) of 0.00006, highlighting its high accuracy and robustness. We also compared with Low Light-Convolutional Neural Network (LL-CNN) and U-Net methods, which had RMSE values of 0.00075 and 0.00073, respectively. This represented an improvement of approximately 92% over LL-CNN and 91% over U-Net. The results showed that this DRes-CNN-based imputation method outperforms current state-of-the-art models. These results established DRes-CNN as a reliable solution for addressing missing data.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Data imputation</kwd>
<kwd>missing data</kwd>
<kwd>deep learning</kwd>
<kwd>deep residual convolutional neural network</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>Universitas Sriwijaya funded by the Competitive Research 2024</funding-source>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>An electronic health record (EHR) is a digital file containing medical details, such as lab results, of an individual, and it&#x2019;s stored online [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]. Primarily, EHRs serve the purpose of establishing goals, devising patient care plans, recording care delivery, and evaluating the resulting outcomes [<xref ref-type="bibr" rid="ref-2">2</xref>]. Thus, it can be shared among various facilities and accessed swiftly by either patients or medical personnel. These records offer opportunities to improve patient care, integrate performance metrics into clinical practice, and streamline clinical research [<xref ref-type="bibr" rid="ref-2">2</xref>,<xref ref-type="bibr" rid="ref-3">3</xref>]. For instance, one research utilizing EHRs involves using machine learning regression techniques to forecast cardiovascular risk [<xref ref-type="bibr" rid="ref-4">4</xref>]. Such predictive models can function as decision-support tools aiding doctors and healthcare providers in patient management and proactive interventions [<xref ref-type="bibr" rid="ref-5">5</xref>]. However, EHR datasets often exhibit a certain degree of incompleteness, with missing data affecting the quality of results and potentially introducing bias [<xref ref-type="bibr" rid="ref-6">6</xref>]. Missing data occurs when values for variables of interest are not recorded or measured for all subjects in the sample. There are several reasons for missing data, including patient refusal to complete certain questions, data acquisition equipment errors, and measurements with different sampling periods [<xref ref-type="bibr" rid="ref-7">7</xref>].</p>
<p>The most commonly used methods for estimating missing data generally fall into three categories [<xref ref-type="bibr" rid="ref-3">3</xref>]: deletion methods, methods for linear imputation based on statistics, and methods for non-linear imputation based on machine learning. Deletion approaches entail the direct removal of missing data, which, as prior research has demonstrated, can cause considerable changes in the analysis results due to the absence of critical information [<xref ref-type="bibr" rid="ref-8">8</xref>]. In contrast, statistically-based linear imputation methods involve replacing missing values with statistical measures such as the mean [<xref ref-type="bibr" rid="ref-9">9</xref>], or the most common value within a global or local range of the time series data [<xref ref-type="bibr" rid="ref-10">10</xref>]. While they use correlations between measurements across multiple data streams simultaneously, they ignore correlations within individual data streams [<xref ref-type="bibr" rid="ref-11">11</xref>]. As a result, these approaches may overlook important information. Furthermore, the advantages of these methods are the ease of implementation and interpretation, and the availability of various tools and techniques to support their use [<xref ref-type="bibr" rid="ref-12">12</xref>]. However, they often do not consider complex structures in the data and may produce biased or inaccurate results depending on the case at hand [<xref ref-type="bibr" rid="ref-13">13</xref>]. Alternatively, machine learning-based non-linear imputation methods can handle more complex correlations in the data, but they require greater computational resources and more difficult interpretation [<xref ref-type="bibr" rid="ref-14">14</xref>]. In practical use, method selection should consider the balance between practicality, accuracy, and interpretation of results. In the field of imputation missing data analysis, different strategies, such as deep learning (DL) algorithms have become more popular recently [<xref ref-type="bibr" rid="ref-15">15</xref>,<xref ref-type="bibr" rid="ref-16">16</xref>].</p>
<p>Alternative approaches such as deep learning (DL) methods are increasingly attracting attention in missing data imputation analysis [<xref ref-type="bibr" rid="ref-16">16</xref>]. This is because DL methods have proven to be able to take advantage of and manage large data sets with remarkable capabilities [<xref ref-type="bibr" rid="ref-17">17</xref>]. The Convolutional Neural Network (CNN) excels in capturing complex patterns and relationships within structured data [<xref ref-type="bibr" rid="ref-18">18</xref>]. In [<xref ref-type="bibr" rid="ref-19">19</xref>&#x2013;<xref ref-type="bibr" rid="ref-21">21</xref>], several works have demonstrated the ability of CNNs to effectively process structured data, such as high-dimensional data, through the application of convolutional layers that focus on local features and hierarchical pattern recognition. However, CNN may struggle with imputing missing values if the data lacks spatial relationships, as the learning of kernel weights relies heavily on identifying spatial features. On the other hand, U-Net is specifically designed for spatial relationships that are essential for effective imputation [<xref ref-type="bibr" rid="ref-22">22</xref>]. However, if there isn&#x2019;t any discernible spatial relationship in the data, the kernel&#x2019;s learning process can go off course and provide inefficient imputation. The U-Net architecture was found to be less effective in managing missing data when the complex data structure did not align with the patterns that the U-Net is designed to recognize [<xref ref-type="bibr" rid="ref-22">22</xref>].</p>
<p>Current imputation methods, including traditional statistical methods and machine learning approaches like CNN and U-Net, have limitations in handling complex data structures and correlations within individual data streams. These methods either oversimplify the imputation process or require substantial computational resources without guaranteeing accurate results [<xref ref-type="bibr" rid="ref-18">18</xref>]. CNN and U-Net struggle to handle complex data structures and correlations within individual data streams effectively [<xref ref-type="bibr" rid="ref-18">18</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>]. This gap underscores the need for a more advanced imputation method that can address these challenges by maintaining computational efficiency while improving accuracy, particularly in the context of medical datasets.</p>
<p>To address these limitations, we propose a novel neural network architecture called Deep Residual-Convolutional Neural Network (DRes-CNN). The DRes-CNN model modifies the foundation of the original Residual Neural Network (ResNet) architecture [<xref ref-type="bibr" rid="ref-22">22</xref>]. DRes-CNN integrates advanced techniques to enhance both feature extraction and learning capabilities. One key aspect of DRes-CNN is the incorporation of residual connections not only within individual layers but also across different network modules. This facilitates the flow of gradients during training, alleviating the vanishing gradient problem and enabling more efficient optimization. Additionally, by promoting information flow across the network, these connections enable better preservation of useful information throughout the deep layers, ultimately improving the network&#x2019;s ability to learn intricate patterns [<xref ref-type="bibr" rid="ref-23">23</xref>]. We also explore two different neural network architectures, including Low Light-Convolutional Neural Network (LL-CNN) and U-Net to illustrate how the imputation process&#x2019;s use of time information inclusion has improved.</p>
<p>The purpose of this study is to evaluate the robustness of our imputation method and fill in the missing information. The main conclusions of our research demonstrate how well DRes-CNN imputes missing values in medical information datasets with remarkable accuracy. The research presents novel findings in four areas:
<list list-type="bullet">
<list-item>
<p><bold>Development of a novel DRes-CNN architecture:</bold> We propose an advanced Deep Residual-Convolutional Neural Network (DRes-CNN) specifically designed to improve data imputation accuracy, addressing the limitations of existing methods.</p></list-item>
<list-item>
<p><bold>Comprehensive evaluation of diverse datasets:</bold> Our approach is tested on three publicly available datasets (MIMIC-III, MIMIC-IV, and the Beijing Multi-Site Air Quality dataset) with various types of missingness, ensuring robustness across different scenarios.</p></list-item>
<list-item>
<p><bold>Application to real-world healthcare data:</bold> The proposed DRes-CNN model is implemented for multivariate data imputation in medical applications, demonstrating its practical relevance in clinical settings.</p></list-item>
<list-item>
<p><bold>Superior performance in imputation and prediction tasks:</bold> Quantitative comparisons show significant improvements in RMSE over existing state-of-the-art methods, confirming the effectiveness of our approach in both imputation and downstream prediction tasks</p></list-item>
</list></p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Works</title>
<p>Missing data imputation has been a longstanding challenge in various domains. Traditional approaches often rely on statistical methods or simple imputation techniques, which can introduce bias if assumptions about the data distribution are incorrect. In recent years, deep learning-based methods have emerged as promising alternatives, offering more flexible and powerful approaches.</p>
<p>Previous studies have explored a range of techniques for handling missing data. For instance, autoencoder models [<xref ref-type="bibr" rid="ref-24">24</xref>] aim to learn representations that can reconstruct the original data, minimizing reconstruction errors. This study used clinical data to train the power of the model. However, for large and complex datasets this model cannot yield promising effectiveness. Similarity-aware diffusion Model-Based Imputation (SADI) [<xref ref-type="bibr" rid="ref-25">25</xref>] leverages diffusion models and self-attention to effectively impute missing values in EHRs. Current models typically rely on correlations between time points and features, which is effective for data with strong correlations, such as Intensive Care Unit (ICU) data. However, this method is less effective for non-ICU data with weak correlations. This study uses the Critical Path for Alzheimer&#x2019;s Disease (CPAD) and PhysioNet Challenge 2012 datasets. The Similarity-Aware Diffusion Model-Based Imputation (SADI) method demonstrates superior performance compared to current state-of-the-art models. SADI, which leverages diffusion models and a self-attention mechanism, is effective in imputing missing data under various missingness mechanisms, including Missing Completely At Random (MCAR), Missing At Random (MAR), and Missing Not At Random (MNAR), and is better at improving accuracy and reducing bias Applying the clustering process to big datasets with many of patients can be computationally expensive, which is one of SADI&#x2019;s limitations. In [<xref ref-type="bibr" rid="ref-26">26</xref>,<xref ref-type="bibr" rid="ref-27">27</xref>], using the method of multiple imputation by chained equations (MICE), a chained approach is used to mine all relevant evidence of missing values and to further estimate those missing values. The datasets used in this study include the Longitudinal Anthropometric Data [<xref ref-type="bibr" rid="ref-26">26</xref>] and the PFA-Datasets in Clinic from [<xref ref-type="bibr" rid="ref-27">27</xref>]. However, in the case of very large datasets, machine learning-based imputation approaches require significant computation time, making these approaches less practical for the task of imputing a large amount of missing data.</p>
<p>In Generative Adversarial Networks (GANs) [<xref ref-type="bibr" rid="ref-28">28</xref>,<xref ref-type="bibr" rid="ref-29">29</xref>] have also been applied to missing data imputation, generating realistic samples to fill in missing values. GANs can suffer from mode collapse, where the generator produces limited diversity in the imputed data. In clinical settings, where variability and accuracy are crucial, mode collapse can lead to biased or incomplete imputations that do not adequately represent the range of possible values These weaknesses make GANs less suitable for clinical data imputation compared to other methods that might offer more stability, transparency, and accuracy. CNNs have also been studied in [<xref ref-type="bibr" rid="ref-30">30</xref>] for the imputation of missing data, utilizing their ability to find spatial correlations and nonlinearities within the data. CNNs have the ability to use techniques such as fuzzy c-means clustering to group data into clusters according to membership values. As a result, it is possible to arrange the data in a way that captures robust attribute relationships. Multiple modalities&#x2019; worth of data can be handled and imputed simultaneously by CNNs. However, because the training process is complex and precise hyperparameter tweaking is necessary, imputation tasks may be challenging to comprehend. Due to its complexity, the model may be less useful for real-world applications, particularly in situations where computing resources are scarce or when access to professionals with the necessary experience to fine-tune such models is difficult.</p>
<p>In contrast to existing methods, our proposed approach, DRes-CNN, leverages deep residual-based CNNs to extract deep features from structured data and impute missing values using a learned kernel. This novel approach offers promising results, outperforming existing methods in key performance metrics. This novel approach offers promising results, outperforming existing methods in key performance metrics. <xref ref-type="table" rid="table-1">Table 1</xref> for details of the conclusions of several approaches to methods used for handling missing data.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Summary of related works</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Method</th>
<th>Problem handled</th>
<th>Dataset used</th>
<th>Methodology</th>
<th>Results</th>
<th>Limitations</th>
</tr>
</thead>
<tbody>
<tr>
<td>Autoencoder</td>
<td>Missing value imputation</td>
<td>Incomplete Datasets in Clinical Information</td>
<td>Reconstruction-based</td>
<td>Minimizes reconstruction errors</td>
<td>Can be complex for large datasets</td>
</tr>
<tr>
<td>SADI</td>
<td>Missing data imputation in EHR</td>
<td>CPAD, PhysioNet Challenge 2012</td>
<td>Diffusion models, self-attention</td>
<td>Superior performance, effective under various missingness mechanisms</td>
<td>Can be computationally expensive for large datasets</td>
</tr>
<tr>
<td>MICE</td>
<td>Missing data imputation</td>
<td>Longitudinal Anthropometric Data, PFA-Datasets</td>
<td>Chained equations</td>
<td>Estimates missing values</td>
<td>Can be computationally expensive for large datasets</td>
</tr>
<tr>
<td>GANs</td>
<td>Missing data imputation</td>
<td>Traffic Dataset, EHR dataset</td>
<td>Generative adversarial networks</td>
<td>Learns to reconstruct original input values</td>
<td>Can be computationally expensive due to training requirements</td>
</tr>
<tr>
<td>CNNs</td>
<td>Missing data imputation</td>
<td>EHR Dataset</td>
<td>Spatial correlations, nonlinearities</td>
<td>Effective for handling multiple modalities</td>
<td>Complex training process, hyperparameter tuning</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3">
<label>3</label>
<title>Material and Method</title>
<p>We provide a brief overview of the datasets utilized in the study in this section, the benchmarking exercise, and the method for assessing the quality of imputation illustrated in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>The research methodology</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_55906-fig-1.tif"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Data Preparation</title>
<p>Vital signs and pertinent data taken from the MIMIC-IV database were used in our investigation [<xref ref-type="bibr" rid="ref-31">31</xref>,<xref ref-type="bibr" rid="ref-32">32</xref>]. We received permission to extract data from the MIMIC-IV for research purposes (Certification Number: 50640755) and completed the web-based training course offered by the National Institutes of Health to ensure the safety of human study participants before gaining access to the database. High-quality data from 2008 to 2019 is included in the publicly accessible MIMIC-IV database, which was created by the review boards of Beth Israel Deaconess Medical Center and Massachusetts Institute of Technology (MIT), both located in Cambridge, Massachusetts. MIMIC-IV contains extensive patient data, including demographics, hospitalization records, diagnoses made under the International Classification of Diseases, Ninth Revision (ICD-9), laboratory tests, prescription drugs, procedures, fluid balance, discharge summaries, bedside vital sign measurements, treatment notes, radiology reports, and survival data. The MIMIC-IV database consists of numerous linked tables that use standardized ICD-9 numbers to describe the data of each ICU patient.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Data Preprocessing</title>
<p>Data preprocessing in this study entails some procedures and techniques meant to handle missing or insufficient data, as depicted in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. The primary procedures for Preprocessing data for imputation usually entail: Missing Data Detecting: Identifying that attributes or variables within the dataset contain missing values. To approximate missing values, one can do the following: remove rows or columns containing missing values; replace missing values with the mean of the available values within the corresponding attribute; create predictive models to estimate missing values based on relationships with other variables, and utilize statistical distributions to create random values that roughly match the distribution of the available data. Use a large query based on a specific value from the chart events table of the MIMIC-IV database in the itemid column to obtain the vital signs dataset of ICU patients.
<list list-type="bullet">
<list-item>
<p>The total raw data from the ICU patient vital signs dataset is 7.786.008 with missing data (<xref ref-type="table" rid="table-2">Table 2</xref>), has a unique id or stay_id for each patient from 38675535 to 37145532, and the duration of each patient&#x2019;s stay in the ICU from 2182-01-25 07:00:00&#x002B;00:00 to 2146-04-27 09:33:00&#x002B;00:00.</p></list-item>
</list></p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Total information from the MIMIC-IV vital sign dataset for each column before removing missing data</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left" />
<col align="left" />
<col align="left" />
<col align="left" />
<col align="left" />
</colgroup>
<thead>
<tr>
<th>Column</th>
<th>Number of data</th>
<th>Missing data</th>
<th>Min</th>
<th>Max</th>
</tr>
</thead>
<tbody>
<tr>
<td>Heart rate</td>
<td>6,458,181</td>
<td>1,327,827</td>
<td>1</td>
<td>295</td>
</tr>
<tr>
<td>sbp</td>
<td>2,263,830</td>
<td>5,522,178</td>
<td>1</td>
<td>357</td>
</tr>
<tr>
<td>dbp</td>
<td>2,263,308</td>
<td>5,522,700</td>
<td>1</td>
<td>299</td>
</tr>
<tr>
<td>mbp</td>
<td>2,434,351</td>
<td>5,351,657</td>
<td>1</td>
<td>299</td>
</tr>
<tr>
<td>Resprate</td>
<td>6,455,503</td>
<td>1,330,505</td>
<td>0.13</td>
<td>69</td>
</tr>
<tr>
<td>Temperature</td>
<td>1,776,877</td>
<td>6,009,131</td>
<td>15</td>
<td>43.11</td>
</tr>
<tr>
<td>spo2</td>
<td>6,323,768</td>
<td>1,462,240</td>
<td>0.01</td>
<td>100</td>
</tr>
<tr>
<td>Glucose</td>
<td>1,325,699</td>
<td>6,460,309</td>
<td>0.12</td>
<td>1,276,100</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Our proposed model analyzes eight vital sign features: heart rate, systolic blood pressure, diastolic blood pressure, mean blood pressure, respiratory rate, body temperature, oxygen saturation, and glucose level. We used an inner join to get a more extensive dataset. Consequently, our final dataset contained 119,948 unique ICU patients (vital signs) as a result (<xref ref-type="table" rid="table-3">Table 3</xref>). This entire dataset includes the min and max data of vital signs recorded during a patient&#x2019;s ICU stay.</p>
<p><list list-type="bullet">
<list-item>
<p>Standardization, after imputation of the missing data the dataset was normalized using the Min-Max Scaler [<xref ref-type="bibr" rid="ref-33">33</xref>,<xref ref-type="bibr" rid="ref-34">34</xref>], this procedure is vital to guarantee uniformity or standardization among the features. The following <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref> illustrates the data normalization:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math></disp-formula>where <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the normalized data; <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the input value; <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the minimum value of the feature; and <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the maximum value of the feature.</p></list-item>
<list-item>
<p>In this step, concerning MIMIC-IV datasets, a data adjustment process ensues, aiming to extract the minimum volume of data from each icustay_id. The meticulous step serves as the foundation for generating multiple data segments from every icustay_id, which is pivotal for subsequent analysis or modeling endeavors. The segmentation strategy employed entails categorizing the data into various subsets, comprising 8, 16, 32, and 64 groups based on the <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref> as follows:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>N</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mi>d</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>y</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></disp-formula></p></list-item>
</list></p>

<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>The number of data for the column from vital sign MIMIC-IV dataset after removing missing data</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left" />
<col align="left" />
<col align="left" />
<col align="left" />
</colgroup>
<thead>
<tr>
<th>Column</th>
<th>Number of data</th>
<th>Min</th>
<th>Max</th>
</tr>
</thead>
<tbody>
<tr>
<td>Heart_rate</td>
<td>119,948</td>
<td>23</td>
<td>204</td>
</tr>
<tr>
<td>sbp</td>
<td>119,948</td>
<td>19</td>
<td>304</td>
</tr>
<tr>
<td>dbp</td>
<td>119,948</td>
<td>3</td>
<td>234</td>
</tr>
<tr>
<td>mbp</td>
<td>119,948</td>
<td>6</td>
<td>238</td>
</tr>
<tr>
<td>Resp_rate</td>
<td>119,948</td>
<td>1</td>
<td>69</td>
</tr>
<tr>
<td>Temperature</td>
<td>119,948</td>
<td>29.3</td>
<td>41.5</td>
</tr>
<tr>
<td>spo2</td>
<td>119,948</td>
<td>10</td>
<td>100</td>
</tr>
<tr>
<td>Glucose</td>
<td>119,948</td>
<td>1</td>
<td>500036</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Create Artificial Missing Data</title>
<p>We have a dataset structured as <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>m</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:math></inline-formula> matrix, where n stands for features and m for cases. The training data <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and the testing data <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msubsup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> are two halves of the original data set. We intentionally manufactured the missing data in <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msubsup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, where duplicate data was initially provided with these missing values (<xref ref-type="fig" rid="fig-2">Fig. 2</xref>). This was done following the division of data to produce training and test sets. New versions of the training and testing data <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msubsup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, respectively, are obtained when the missingness value is created. To add missing values to the clean test data during the testing phase, <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msubsup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, we repeat the same training process, resulting in the corrupted test data <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msubsup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. Subsequently, after training the DRes-CNN (refer to Algorithm 1), we assess its performance on <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msubsup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> to impute the missing data, as depicted in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. Similarly, after the completion of the imputation process in our scenario, artificial data emerges wherein all values have been altered due to the convolution operation. Therefore, as shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, we use masking on the newly created data matrix to recover the imputed values.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Proposed DRes-CNN architecture</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_55906-fig-2.tif"/>
</fig>
<fig id="fig-6">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_55906-fig-6.tif"/>
</fig>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>The Proposed Model DRes-CNN</title>
<p>The proposed method utilizes a specific type of neural network architecture known as Convolutional Neural Networks (CNN). Our network architecture, which is a dense convolutional neural network with residual connections (DRes-CNN), is depicted in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. This DRes-CNN network structure resembles the original CNN architecture for image super-resolution [<xref ref-type="bibr" rid="ref-20">20</xref>], but is modified to fit tabular or time-series data in capturing complex patterns and relationships within structured data [<xref ref-type="bibr" rid="ref-18">18</xref>]. This architecture is made to maximize the information flow between network levels using a straightforward connecting scheme. All other levels are directly connected. Every layer passes its feature map to all the following levels and receives extra input from all prior layers to preserve the feed-forward character of the system. Dense networks are one type of CNN that connects each layer layer in a feed-forward way. These dense networks increase feature propagation, stimulate feature reuse, and solve the vanishing-gradient problem in contrast to typical convolutional networks, where each layer is merely connected to the next layer.</p>

<p>The convolutional layers in our proposed DRes-CNN architecture are specifically designed to detect dependencies between features in the EHR dataset, both temporally and contextually. By employing dense and residual connections, the model enhances feature propagation, reuses information from earlier layers, and improves the learning process for long-range feature dependencies. Dense and residual connections function differently. While feature maps in residual connections are combined by summation before being transmitted to a specific layer, feature maps in dense connections are merged based on all prior feature maps. The benefit of having both kinds of connections is that, in a dense connection, all of the features from the prior convolution block may be used, whereas, in a residual connection, we are limited to using one historical feature map.</p>
<p>As can be seen in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, the suggested DRes-CNN architecture consists of two residual connections and ten convolutional layers with progressively more filters. The residual connection in <xref ref-type="fig" rid="fig-2">Fig. 2</xref> is the solid line that carries the input layer to the summing operator. In ideal circumstances, a deep neural network with more layers can outperform shallower networks and drastically minimize error rates. To outperform a straightforward deep neural network, we incorporate residual blocks.</p>

<p>The architecture in our model has 64 filters with multiple kernel sizes of 3 &#x00D7; 3, followed by the LeakyReLU activation function. After multiple convolution layers, there is residual linking which is done by adding the output of the first layer to the output of the last layer before the next convolution layer. This architectural design helps in learning more detailed features and retains the original information of the input. This study, provided detailed descriptions of our architecture, specifying that it consists of ten convolutional layers with both dense and 2 residual connections. We explained the advantages of using both connection types, as dense connections facilitate the utilization of features from previous convolutional blocks, while residual connections enhance the flow of information by summing the outputs of earlier layers with later ones. We also justified the choice of architecture by noting that deeper networks tend to outperform shallower counterparts, especially when incorporating residual blocks that minimize error rates. The total parameters in the model amount to 8.545, which also includes the weights and biases in each convolution layer. To offer transparency, we included <xref ref-type="table" rid="table-3">Table 3</xref>, which outlines the architecture modification information, detailing output shapes and the number of parameters for each layer. The architecture in our model has modification information shown in <xref ref-type="table" rid="table-4">Table 4</xref>.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Architecture modification information</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Convolution</th>
<th>Layer (type)</th>
<th>Output shape</th>
<th>Parameters number</th>
<th>Connected to</th>
</tr>
</thead>
<tbody>
<tr>
<td>Input data</td>
<td>Input_1 (InputLayer)</td>
<td>[(None, 64, 64, 1)]</td>
<td>0</td>
<td>[]</td>
</tr>
<tr>
<td>Conv 1</td>
<td>conv2d (Conv2D)</td>
<td>[(None, 64, 64, 64)]</td>
<td>128</td>
<td>[&#x2018;input_1 [0][0]&#x2019;]</td>
</tr>
<tr>
<td>Head</td>
<td>leaky_re_lu (LeakyReLU)</td>
<td>[(None, 64, 64, 64)]</td>
<td>0</td>
<td>[&#x2018;conv2d [0][0]&#x2019;]</td>
</tr>
<tr>
<td>Conv 2</td>
<td>conv2d_1 (Conv2D)</td>
<td>[(None, 64, 64, 64)]</td>
<td>4160</td>
<td>[&#x2018;leaky_re_lu [0][0]&#x2019;]</td>
</tr>
<tr>
<td></td>
<td>leaky_re_lu_1 (LeakyReLU)</td>
<td>[(None, 64, 64, 64)]</td>
<td>0</td>
<td>[&#x2018;conv2d_1 [0][0]&#x2019;]</td>
</tr>
<tr>
<td>Conv 3</td>
<td>conv2d_2 (Conv2D)</td>
<td>[(None, 64, 64, 64)]</td>
<td>4160</td>
<td>[&#x2018;leaky_re_lu_1 [0][0]&#x2019;]</td>
</tr>
<tr>
<td></td>
<td>leaky_re_lu_2 (LeakyReLU)</td>
<td>[(None, 64, 64, 64)]</td>
<td>0</td>
<td>[&#x2018;conv2d_2 [0][0]&#x2019;]</td>
</tr>
<tr>
<td>Conv 4</td>
<td>conv2d_3 (Conv2D)</td>
<td>[(None, 64, 64, 64)]</td>
<td>4160</td>
<td>[&#x2018;leaky_re_lu_2 [0][0]&#x2019;]</td>
</tr>
<tr>
<td></td>
<td>leaky_re_lu_3 (LeakyReLU)</td>
<td>[(None, 64, 64, 64)]</td>
<td>0</td>
<td>[&#x2018;conv2d_3 [0][0]&#x2019;]</td>
</tr>
<tr>
<td>Conv 5</td>
<td>conv2d_4 (Conv2D)</td>
<td>[(None, 64, 64, 64)]</td>
<td>4160</td>
<td>[&#x2018;leaky_re_lu_3 [0][0]&#x2019;]</td>
</tr>
<tr>
<td></td>
<td>leaky_re_lu_4 (LeakyReLU)</td>
<td>[(None, 64, 64, 64)]</td>
<td>0</td>
<td>[&#x2018;conv2d_4 [0][0]&#x2019;]</td>
</tr>
<tr>
<td><bold>Residual</bold></td>
<td><bold>add</bold> (<bold>Add</bold>)</td>
<td><bold>[</bold>(<bold>None, 64, 64, 64</bold>)<bold>]</bold></td>
<td><bold>0</bold></td>
<td><bold>[&#x2018;leaky_re_lu [0,0]&#x2019;,&#x2019;leaky_re_lu_4 [0][0]&#x2019;]</bold></td>
</tr>
<tr>
<td>Conv 6</td>
<td>conv2d_5 (Conv2D)</td>
<td>[(None, 64, 64, 64)]</td>
<td>4160</td>
<td>[&#x2018;add [0][0]&#x2019;]</td>
</tr>
<tr>
<td></td>
<td>leaky_re_lu_5 (LeakyReLU)</td>
<td>[(None, 64, 64, 64)]</td>
<td>0</td>
<td>[&#x2018;conv2d_4 [0][0]&#x2019;]</td>
</tr>
<tr>
<td>Conv 7</td>
<td>conv2d_6 (Conv2D)</td>
<td>[(None, 64, 64, 64)]</td>
<td>4160</td>
<td>[&#x2018;leaky_re_lu_4 [0][0]&#x2019;]</td>
</tr>
<tr>
<td></td>
<td>leaky_re_lu_6 (LeakyReLU)</td>
<td>[(None, 64, 64, 64)]</td>
<td>0</td>
<td>[&#x2018;conv2d_5 [0][0]&#x2019;]</td>
</tr>
<tr>
<td>Conv 8</td>
<td>conv2d_7 (Conv2D)</td>
<td>[(None, 64, 64, 64)]</td>
<td>4160</td>
<td>[&#x2018;leaky_re_lu_5 [0][0]&#x2019;]</td>
</tr>
<tr>
<td></td>
<td>leaky_re_lu_7 (LeakyReLU)</td>
<td>[(None, 64, 64, 64)]</td>
<td>0</td>
<td>[&#x2018;conv2d_6 [0][0]&#x2019;]</td>
</tr>
<tr>
<td>Conv 9</td>
<td>conv2d_8 (Conv2D)</td>
<td>[(None, 64, 64, 64)]</td>
<td>4160</td>
<td>[&#x2018;leaky_re_lu_6 [0][0]&#x2019;]</td>
</tr>
<tr>
<td></td>
<td>leaky_re_lu_8 (LeakyReLU)</td>
<td>[(None, 64, 64, 64)]</td>
<td>0</td>
<td>[&#x2018;conv2d_7 [0][0]&#x2019;]</td>
</tr>
<tr>
<td>Conv 10</td>
<td>conv2d_9 (Conv2D)</td>
<td>[(None, 64, 64, 64)]</td>
<td>4160</td>
<td>[&#x2018;leaky_re_lu_8 [0][0]&#x2019;]</td>
</tr>
<tr>
<td><bold>Residual</bold></td>
<td><bold>add_1</bold>(<bold>Add</bold>)</td>
<td><bold>[</bold>(<bold>None, 64, 64, 64</bold>)<bold>]</bold></td>
<td><bold>0</bold></td>
<td><bold>[&#x2018;leaky_re_lu_6 [0][0]&#x2019;,&#x2019;leaky_re_lu_10 [0][0]&#x2019;]</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Residual connections are introduced after Conv 5 and Conv 10, which are created by adding a convolutional layer&#x2019;s output to a preceding layer&#x2019;s output before the layer&#x2019;s activation function is sent through (<xref ref-type="table" rid="table-3">Table 3</xref>). A situation with randomly generated missing data in the input data matrix and the same whole data matrix produced at the output is shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. Assume that we have a kernel with dimensions M &#x00D7; N (where M represents the number of rows and N denotes the number of columns), and there&#x2019;s a missing value for a unit <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> within the feature map. An input-weighted total within a given patch size <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>M</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>N</mml:mi></mml:math></inline-formula> is computed to find the value of <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. These kernel weights are adjustable parameters that are learned by utilizing the linear characteristics present in the given data. Once optimized during the training phase, these weights can then be employed for imputing missing data during the testing phase. <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref> illustrates the process by which a filter convolves over the data and imputes the missing data <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>.</p>
<p><disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>+</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the weight (kernel) at position (m,n) used for convolution. <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>b</mml:mi></mml:math></inline-formula> representing the bias term. <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>f</mml:mi></mml:math></inline-formula> represents a residual function. This process involves the summation of the dot product of each position in the input data between the input and the kernel weights, which is then added with a bias. The mathematical function for LeakyReLU as shown in <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>.
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" 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>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mi>x</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>j</mml:mi><mml:mi>i</mml:mi><mml:mi>k</mml:mi><mml:mi>a</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>x</mml:mi></mml:mtd><mml:mtd><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x221D;</mml:mo><mml:mi>x</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>j</mml:mi><mml:mi>i</mml:mi><mml:mi>k</mml:mi><mml:mi>a</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>x</mml:mi></mml:mtd><mml:mtd><mml:mo>&#x003C;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mo>&#x221D;</mml:mo></mml:math></inline-formula> is a small positive value Thus, when <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mi>x</mml:mi></mml:math></inline-formula> is less than 0, the output is <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mo>&#x221D;</mml:mo><mml:mi>x</mml:mi></mml:math></inline-formula>, while when <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>x</mml:mi></mml:math></inline-formula> is greater than or equal to 0, the output is <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mi>x</mml:mi></mml:math></inline-formula>. LeakyReLU is chosen as the activation function due to its effectiveness and widespread use in practical applications. Additionally, LeakyReLU can help neural networks learn patterns and relationships between features in the dataset. Usually in ReLU, negative input values become zero, while positive values do not change. However, in LeakyReLU, when the input is negative, it does not become zero but is scaled by a small positive value <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>. This can help overcome the &#x201C;dead neuron&#x201D; problem that can occur in ReLU, where the neuron saturates at negative values and does not update its weights during training. After several layers of convolution, there is a residual linking which is done by adding the output of the first layer to the output of the last layer before the next convolution layer. The imputation of a randomly missing value in a data sample that goes through a trained model is further demonstrated in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. Once the model undergoes training, it gains the capability to impute missing values through the learned kernels.</p>

<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>The performance analysis of RMSE (MIMIC-IV) with U-Net, LL-CNN and DRes-CNN. The <italic>x</italic>-axis shows the missing ratio datasets and the <italic>y</italic>-axis shows the RMSE</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_55906-fig-3.tif"/>
</fig>
<p>The evaluation process entails using the available data to train the network to predict missing data, with the model being adaptable for tabular or time series data. Important features are preserved across levels by using jump connections. Several hyperparameters, such as the Adam optimizer, 200 epochs, batch sizes of 16 and 32, and a learning rate of 0.001, are used to maximize the model&#x2019;s performance. The model&#x2019;s activation function is linear, and the loss function is a mean squared error. By partitioning the dataset into multiple subsets, we were able to validate the model&#x2019;s performance across different data segments, thereby enhancing the generalizability of the results. Additionally, a learning rate schedule based on exponential decay is employed to enhance the training. Algorithm 2 presents the pseudocode for the DRes-CNN algorithm.</p>
<fig id="fig-7">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_55906-fig-7.tif"/>
</fig>
<p>During training, the learning rate of the model can be adjusted to facilitate a more efficient convergence to the optimal solution. Combining optimization methods with hyperparameters improves the performance of the DRes-CNN algorithm. The Intel<sup>&#x00AE;</sup> CoreTM i9-9920X CPU running at 3.50 GHz, 490,191 MB of RAM, and GeForce 2080 RTX Ti from NVIDIA Corporation GV102 (rev a1) were the characteristics of the personal computer (PC) used to train the network. Pytorch 1.7.1 package together with Python were used to create the network.</p>
</sec>
<sec id="s3_5">
<label>3.5</label>
<title>Model Evaluation</title>
<p>Model evaluation in filling data with DRes-CNN involves evaluating how the trained deep learning model is used to predict missing values in the dataset. Model performance evaluation uses the root mean squared error (RMSE) metric to assess the average error produced by the model [<xref ref-type="bibr" rid="ref-9">9</xref>]. The smaller the value of mean absolute error (MAE) and RMSE, the better the performance of our imputation method. MAE and RMSE are used as model evaluation metrics [<xref ref-type="bibr" rid="ref-9">9</xref>] and are described in <xref ref-type="disp-formula" rid="eqn-5">Eqs. (5)</xref> and <xref ref-type="disp-formula" rid="eqn-6">(6)</xref>.
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>M</mml:mi><mml:mi>A</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mi>R</mml:mi><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt></mml:math></disp-formula>where <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the actual value, <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mrow><mml:mover><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> is the predicted values by the regression model, and <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>n</mml:mi></mml:math></inline-formula> number of observations/rows [<xref ref-type="bibr" rid="ref-9">9</xref>].</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental Results and Discussions</title>
<sec id="s4_1">
<label>4.1</label>
<title>Experimental Research</title>
<p>This section presents the study results of our suggested approach and evaluates the significant improvement in handling missing data performance compared to other methods. We use the MIMIC-IV dataset described in <xref ref-type="sec" rid="s3_2">Section 3.2</xref>. At first, data cleaning for missing data are randomly added, replacing the missing values with zero. Next, our proposed DRes-CNN approach is used to impute those missing values, and other imputation techniques, such as U-Net and LL-CNN, are selected for comparison purposes. Moreover, the robustness of the DRes-CNN approach is tested with various missing ratios (10%, 20%, 30%, 40%, 50%, 60%, and 70%) on the MIMIC-IV dataset. We also evaluated the imputation performance of DRes-CNN by using three supervised learning algorithms to train classifiers on the imputed data. Experiments were conducted three times with random data partitioning (90% for training and 10% for testing), and the average classification accuracy along with the standard deviation was calculated as the final performance score. Initially, 10% of attribute values from all clean data were artificially removed to generate a dataset with missing values.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Result</title>
<p>This section provides a thorough examination of comparing the proposed technique with alternative imputation methods. <xref ref-type="table" rid="table-4">Table 4</xref> illustrates the assessment outcomes (RMSE) acquired through various approaches when dealing with randomly generated missing values, alongside other advanced imputation methods like U-Net, LL-CNN, and DRes-CNN. Experimental results were obtained through various missing ratios (i.e., 10%&#x2013;70%). It can be seen in <xref ref-type="table" rid="table-5">Table 5</xref> that the a substantial difference in performance between the proposed method and the others. Notably, regardless of the missing ratio, the RMSE results remain relatively stable, indicating that the proposed approach maintains its efficacy even when the level of missing data increases. <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, a graphical depiction of <xref ref-type="table" rid="table-5">Table 5</xref>, makes this distinction easy to see. The best value for each dataset is displayed in a column of <xref ref-type="table" rid="table-4">Table 4</xref> in bold type. Particularly, the superiority of the DRes-CNN method is underscored, showcasing its adeptness in accurately imputing missing values within vital signs data, even under high missing data scenarios. Our results demonstrated that the Dres-CNN model consistently outperformed the other models, particularly when handling higher ratios of missing data. This performance can be attributed to key architectural enhancements, such as the use of skip and residual connections, which allow the model to retain both high-level and low-level features across layers. This retention is critical for capturing complex spatial relationships and non-linear dependencies, which are essential for accurate imputation.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>RMSE from U-Net, LL-CNN, and DRes-CNN with varying the ratio of missing value</title>
</caption>
<table frame="hsides">
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Method</th>
<th>Segment</th>
<th>Batch size</th>
<th>10%</th>
<th>20%</th>
<th>30%</th>
<th>40%</th>
<th>50%</th>
<th>60%</th>
<th>70%</th>
</tr>
</thead>
<tbody>
<tr>
<td>U-Net</td>
<td>8</td>
<td>16</td>
<td>0.02711</td>
<td>0.02730</td>
<td>0.02982</td>
<td>0.02691</td>
<td>0.02810</td>
<td>0.02785</td>
<td>0.02794</td>
</tr>
<tr>
<td></td>
<td></td>
<td>32</td>
<td>0.02745</td>
<td>0.02707</td>
<td>0.02794</td>
<td>0.02723</td>
<td>0.02707</td>
<td>0.02658</td>
<td>0.02666</td>
</tr>
<tr>
<td></td>
<td>16</td>
<td>16</td>
<td>0.03526</td>
<td>0.01922</td>
<td>0.01527</td>
<td>0.01686</td>
<td>0.01504</td>
<td>0.01202</td>
<td>0.01302</td>
</tr>
<tr>
<td></td>
<td></td>
<td>32</td>
<td>0.02266</td>
<td>0.01805</td>
<td>0.01551</td>
<td>0.01443</td>
<td>0.01286</td>
<td>0.01181</td>
<td>0.01088</td>
</tr>
<tr>
<td></td>
<td>32</td>
<td>16</td>
<td>0.03245</td>
<td>0.01846</td>
<td>0.01665</td>
<td>0.01288</td>
<td>0.01203</td>
<td>0.01290</td>
<td>0.01263</td>
</tr>
<tr>
<td></td>
<td></td>
<td>32</td>
<td>0.02048</td>
<td>0.01593</td>
<td>0.01441</td>
<td>0.01306</td>
<td>0.01148</td>
<td>0.01296</td>
<td>0.01048</td>
</tr>
<tr>
<td></td>
<td>64</td>
<td>16</td>
<td>0.02943</td>
<td>0.02095</td>
<td>0.01761</td>
<td>0.01618</td>
<td>0.01433</td>
<td>0.01418</td>
<td>0.01409</td>
</tr>
<tr>
<td></td>
<td></td>
<td>32</td>
<td>0.03453</td>
<td>0.02149</td>
<td>0.01667</td>
<td>0.01478</td>
<td>0.01408</td>
<td>0.01303</td>
<td>0.01346</td>
</tr>
<tr>
<td>LL-CNN</td>
<td>8</td>
<td>16</td>
<td>0.00073</td>
<td>0.00293</td>
<td>0.00119</td>
<td>0.00141</td>
<td>0.00763</td>
<td>0.00129</td>
<td>0.00643</td>
</tr>
<tr>
<td></td>
<td></td>
<td>32</td>
<td>0.00225</td>
<td>0.00505</td>
<td>0.00328</td>
<td>0.00239</td>
<td>0.00134</td>
<td>0.00284</td>
<td>0.00323</td>
</tr>
<tr>
<td></td>
<td>16</td>
<td>16</td>
<td>0.00236</td>
<td>0.00196</td>
<td>0.00605</td>
<td>0.00360</td>
<td>0.00524</td>
<td>0.00413</td>
<td>0.00268</td>
</tr>
<tr>
<td></td>
<td></td>
<td>32</td>
<td>0.00075</td>
<td>0.00184</td>
<td>0.00183</td>
<td>0.00244</td>
<td>0.00302</td>
<td>0.00135</td>
<td>0.00307</td>
</tr>
<tr>
<td></td>
<td>32</td>
<td>16</td>
<td>0.00469</td>
<td>0.00718</td>
<td>0.00169</td>
<td>0.00564</td>
<td>0.00928</td>
<td>0.00388</td>
<td>0.01052</td>
</tr>
<tr>
<td></td>
<td></td>
<td>32</td>
<td>0.00281</td>
<td>0.00300</td>
<td>0.00186</td>
<td>0.00192</td>
<td>0.00782</td>
<td>0.01108</td>
<td>0.00449</td>
</tr>
<tr>
<td></td>
<td>64</td>
<td>16</td>
<td>0.28100</td>
<td>0.07554</td>
<td>0.06900</td>
<td>0.05217</td>
<td>0.06351</td>
<td>0.06351</td>
<td>0.07555</td>
</tr>
<tr>
<td></td>
<td></td>
<td>32</td>
<td>0.31709</td>
<td>0.08878</td>
<td>0.38263</td>
<td>0.17603</td>
<td>0.03277</td>
<td>0.04808</td>
<td>0.04842</td>
</tr>
<tr>
<td>DRes-CNN</td>
<td>8</td>
<td>16</td>
<td>0.00075</td>
<td>0.00048</td>
<td>0.00124</td>
<td>0.00081</td>
<td>0.00189</td>
<td>0.00131</td>
<td>0.00031</td>
</tr>
<tr>
<td></td>
<td></td>
<td>32</td>
<td>0.00098</td>
<td>0.00024</td>
<td>0.00020</td>
<td>0.00064</td>
<td>0.00144</td>
<td>0.00035</td>
<td>0.00062</td>
</tr>
<tr>
<td></td>
<td>16</td>
<td>16</td>
<td>0.00011</td>
<td>0.00146</td>
<td>0.00022</td>
<td>0.00045</td>
<td>0.00065</td>
<td>0.00155</td>
<td>0.00167</td>
</tr>
<tr>
<td></td>
<td></td>
<td>32</td>
<td>0.00035</td>
<td>0.00045</td>
<td>0.00062</td>
<td>0.00029</td>
<td>0.00047</td>
<td>0.00173</td>
<td>0.00008</td>
</tr>
<tr>
<td></td>
<td>32</td>
<td>16</td>
<td>0.00017</td>
<td>0.00018</td>
<td>0.00148</td>
<td>0.00081</td>
<td>0.00436</td>
<td>0.00085</td>
<td>0.00153</td>
</tr>
<tr>
<td></td>
<td></td>
<td>32</td>
<td>0.00039</td>
<td>0.00128</td>
<td>0.00030</td>
<td>0.00156</td>
<td>0.00037</td>
<td>0.00128</td>
<td>0.00028</td>
</tr>
<tr>
<td></td>
<td>64</td>
<td>16</td>
<td>0.00057</td>
<td><bold>0.00006</bold></td>
<td>0.00018</td>
<td>0.00020</td>
<td>0.00039</td>
<td>0.00055</td>
<td>0.00007</td>
</tr>
<tr>
<td></td>
<td></td>
<td>32</td>
<td>0.00065</td>
<td>0.00053</td>
<td>0.00022</td>
<td>0.00042</td>
<td>0.00122</td>
<td>0.00722</td>
<td>0.00098</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The experimental findings showcased that the several models, trained used batch size of 16, 64 segments, a 20% missing ratio, and undergoing 200 epochs, attained an impressive on the MIMIC-IV dataset (as depicted in <xref ref-type="table" rid="table-6">Table 6</xref>). Through scrutinizing the model&#x2019;s efficacy across varied segment sizes and missing rates, we discern its capability to address an array of data patterns and handle missing data occurrences that mirror real-world scenarios, wherein data may manifest varying levels of incompleteness.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>The best model from U-Net, LL-CNN, and DRes-CNN</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left" />
<col align="left" />
<col align="left" />
<col align="left" />
</colgroup>
<thead>
<tr>
<th>Segment</th>
<th>U-Net</th>
<th>LL-CNN</th>
<th>DRes-CNN</th>
</tr>
</thead>
<tbody>
<tr>
<td>8</td>
<td>0.02658</td>
<td>0.00073</td>
<td>0.00020</td>
</tr>
<tr>
<td>16</td>
<td>0.01088</td>
<td>0.00075</td>
<td>0.00008</td>
</tr>
<tr>
<td>32</td>
<td>0.01048</td>
<td>0.00169</td>
<td>0.00017</td>
</tr>
<tr>
<td>64</td>
<td>0.01303</td>
<td>0.03277</td>
<td><bold>0.00006</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>From the data presented in <xref ref-type="table" rid="table-5">Tables 5</xref> and <xref ref-type="table" rid="table-6">6</xref>, it&#x2019;s evident that DRes-CNN surpasses both U-Net and LL-CNN in performance. The model&#x2019;s ability to generate low RMSE suggests that the imputed data closely aligns with the true values missing from the dataset. A primary factor contributing to DRes-CNN superiority in data imputation is its tailored design for data processing tasks, where missing or corrupted data is common. Also, we conduct a comparison of each attribute from U-Net, LL-CNN, and DRes-CNN (<xref ref-type="table" rid="table-7">Table 7</xref>).</p>
<table-wrap id="table-7">
<label>Table 7</label>
<caption>
<title>RMSE results of each attribute from U-Net, LL-CNN, and DRes-CNN</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left" />
<col align="left" />
<col align="left" />
<col align="left" />
<col align="left" />
<col align="left" />
<col align="left" />
</colgroup>
<thead>
<tr>
<th>Vital signs</th>
<th colspan="2" align="center">U-Net</th>
<th colspan="2" align="center">LL-CNN</th>
<th colspan="2" align="center">DRes-CNN</th>
</tr>
<tr>
<th/>
<th>MAE</th>
<th>RMSE</th>
<th>MAE</th>
<th>RMSE</th>
<th>MAE</th>
<th>RMSE</th>
</tr>
</thead>
<tbody>
<tr>
<td>Heartrate</td>
<td>0.009</td>
<td>0.0078</td>
<td>0.058525</td>
<td>0.070074</td>
<td>0.0009866300</td>
<td>0.0009865</td>
</tr>
<tr>
<td>Sysbp</td>
<td>0.008</td>
<td>0.0093</td>
<td>0.053339</td>
<td>0.066378</td>
<td>0.0009866411</td>
<td>0.0009866</td>
</tr>
<tr>
<td>Diasbp</td>
<td>0.007</td>
<td>0.0095</td>
<td>0.017790</td>
<td>0.025735</td>
<td>0.0009866883</td>
<td>0.0009866</td>
</tr>
<tr>
<td>Meanbp</td>
<td>0.006</td>
<td>0.0099</td>
<td>0.030178</td>
<td>0.045168</td>
<td>0.0009866659</td>
<td>0.0009866</td>
</tr>
<tr>
<td>Resprate</td>
<td>0.011</td>
<td>0.0101</td>
<td>0.047702</td>
<td>0.061603</td>
<td>0.0009866502</td>
<td>0.0009866</td>
</tr>
<tr>
<td>Temps</td>
<td>0.007</td>
<td>0.0091</td>
<td>0.021124</td>
<td>0.025127</td>
<td>0.0009864810</td>
<td>0.0009864</td>
</tr>
<tr>
<td>Spo2</td>
<td>0.010</td>
<td>0.0134</td>
<td>0.015266</td>
<td>0.015728</td>
<td>0.0009861991</td>
<td>0.0009861</td>
</tr>
<tr>
<td>Glucose</td>
<td>0.009</td>
<td>0.0146</td>
<td>0.045483</td>
<td>0.045484</td>
<td>0.0009868535</td>
<td>0.0009868</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="table" rid="table-6">Table 6</xref> presents a comparison of the RMSE values of three different models: U-Net, LL-CNN, and DRes-CNN, in predicting various vital signs attributes. The analysis results show that DRes-CNN consistently has a lower RMSE compared to U-Net and LL-CNN for each attribute. This indicates that DRes-CNN tends to perform better in predicting vital signs values. However, there were variations in model performance between attributes, where some attributes had smaller RMSE than others, such as &#x201C;spo2&#x201D; which had relatively low RMSE for all models. The lower the RMSE value, the closer the model prediction is to the true value, so models with lower RMSE tend to have more accurate predictions. A direct comparison between the models can provide insight Into the relative merits of each in predicting certain attributes, although overall DRes-CNN dominates. The best model to use for the vital sign prediction challenge can be chosen with the help of this analysis, as well as highlighting areas where improvements or adjustments may be needed.</p>

</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Discussions</title>
<p><bold><italic>The Ablation Study</italic></bold></p>
<p>In this study, we conducted an ablation study to evaluate the performance of our proposed Dres-CNN model for handling missing data in structured datasets. The study focused on assessing the impact of different hyperparameters, and missing data ratios. We tested the model with varying missing data percentages (10% to 70%) and systematically tuned hyperparameters such as segment size (8, 16, 32, 64), batch size (16, 32), and learning rate (0.001), as well as the optimizer (Adam) and the number of epochs (200). to determine their influence on imputation accuracy. A comprehensive experiment and a detailed comparison of the results are provided in the subsequent section with an in-depth analysis shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>The performance of Dres-CNN model based on hyperparameters</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_55906-fig-4.tif"/>
</fig>
<p>The performance of each model was assessed using the parameter RMSE. Our results demonstrate that the Dres-CNN model outperforms traditional methods, such as LL-CNN and U-Net, especially when dealing with higher missing data ratios. First, we evaluated the effect of different missing ratios, ranging from 10% to 70%. The results showed that the model performed best at lower missing ratios (around 10%), with performance gradually decreasing as the missing ratio increased. This indicates that the model is more efficient at handling datasets with fewer missing entries. Next, we examined segment sizes (8, 16, 32, 64) and found that larger segment sizes (32 and 64) provided better accuracy, as they allowed the model to capture a broader context, though they required more computational resources. We also set the number of training epochs to 200, which appeared to strike a balance between sufficient training time and avoiding overfitting. In terms of batch size, we tested sizes 16 and 32, with the larger batch size proving to be more effective due to its more stable gradient updates during training. The Adam optimizer was chosen for its adaptive learning rate, which allowed the model to converge efficiently. Finally, we found that a learning rate of 0.001 provided the best balance between speed and accuracy, ensuring the model did not converge too quickly or slowly.</p>
<p>Our proposed DRes-CNN approach shows superior performance compared to other state-of-the-art imputation methods, such as U-Net and LL-CNN. Our proposed validation technique involves splitting the data into 90% for training and validation and 10% for testing. This split allows the model to train on a significant portion of the data while using the separate test set to rigorously evaluate the model&#x2019;s performance on unseen data. Performance evaluation based on the RMSE value shows that the DRes-CNN architecture is more effective in learning features and estimating missing values accurately, even with a significant amount of missing data. <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, a graphical depiction of <xref ref-type="table" rid="table-4">Table 4</xref>, makes this distinction easy to see. The best value for each dataset is displayed in a column of <xref ref-type="table" rid="table-4">Table 4</xref> in bold type. As a result, the DRes-CNN architecture produces lower RMSE values compared to the U-Net and LL-CNN architectures. The experimental results also show that in most cases, the DRes-CNN approach outperforms other methods in various data imputations. Although the imputation of missing data with LL-CNN architecture gives better results on the original (clean) version compared to U-Net architecture, DRes-CNN architecture shows better performance on the MIMIC-IV dataset. The superior performance of these imputation methods is most likely due to the suitability of the particular learning algorithm to the data used. Residual connections facilitate deeper network training and utilize convolutional layers with the LeakyReLU activation function to extract features from the input data.</p>

<p>The architecture of DRes-CNN incorporates specialized features like convolutional layers with LeakyReLU activation functions to extract features from input data and have residual connections to facilitate the training of deeper networks. These characteristics render it well-equipped to handle missing or corrupted data within datasets. The ability of DRes-CNN to handle temporal and spatial dependencies within data is very useful <italic>in situ</italic>ations when missing data appears sequentially, like in time series data. By leveraging convolutional and pooling layers, DRes-CNN effectively captures these dependencies, enhancing predictive accuracy and enabling more effective imputation of missing data values.</p>
<p>Additionally, DRes-CNN considers spatial relationships among features by reorganizing data or applying convolution operations with larger windows to capture broader contexts, facilitating better data imputation. Non-linear information is utilized through non-linear activation functions and optimized training methods, allowing the network to adjust its weights and biases according to the complex data structure. Through optimized training and testing phases, the network is trained on incomplete data to optimize imputation performance and then tested on incomplete data to evaluate its ability to accurately impute missing values.</p>
<p>To see the robustness of the DRes-CNN model, we use box plots to illustrate the impact of handling data. Box plots show the median value, interquartile range, and outliers, giving a clear view of the distribution of the data. Initially, the box plot depicts the data distribution before imputation (<xref ref-type="fig" rid="fig-5">Fig. 5a</xref>), followed by a representation of the post-imputation process (<xref ref-type="fig" rid="fig-5">Fig. 5b</xref> to <xref ref-type="fig" rid="fig-5">d</xref>). The noticeable trend is that the proposed imputation method consistently handles missing data with values to the data mean. Comparing the box plots of the imputed data with the raw data shows a narrower interquartile range and a reduction in data dissemination (<xref ref-type="fig" rid="fig-5">Fig. 5d</xref>). These observations suggest that the imputation method, rooted in DRes-CNN, effectively minimizes data variability without introducing bias, confirming its suitability for the task at hand.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>The box plot is utilized for visualizing data representation both pre- and post-imputation using three distinct methods: U-Net, LL-CNN, DRes-CNN</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_55906-fig-5.tif"/>
</fig>
<p>To Validate the robustness of our proposed data imputation model, we conducted a comparative analysis against recent studies that use the existing architecture of the CNN method. However, the use of DRes-CNN architecture for data imputation is still not common. We also use some non-health datasets to test the robustness of our architecture (<xref ref-type="table" rid="table-8">Table 8</xref>). To the best of our knowledge, we are the pioneer in applying the DRes-CNN architecture for data imputation in medical records or other datasets. Our simple DRes-CNN model shows outstanding performance, as evidenced by <xref ref-type="table" rid="table-7">Table 7</xref>, in terms of RMSE beyond previous studies. In the research conducted by Yoon et al. [<xref ref-type="bibr" rid="ref-35">35</xref>], the imputation method used was multi-directional recurrent neural network (M-RNN), which was evaluated on the MIMIC-III database. The evaluation results showed that M-RNN had an RMSE of 0.0295, indicating a fairly good level of imputation accuracy in the context of such medical data.</p>
<table-wrap id="table-8">
<label>Table 8</label>
<caption>
<title>The benchmark of the proposed model with another DL</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left" />
<col align="left" />
<col align="left" />
<col align="left" />
<col align="left" />
</colgroup>
<thead>
<tr>
<th>Reference</th>
<th>Imputation method</th>
<th>Database</th>
<th>MAE</th>
<th>RMSE</th>
</tr>
</thead>
<tbody>
<tr>
<td>Yoon et al. [<xref ref-type="bibr" rid="ref-35">35</xref>]</td>
<td>M-RNN</td>
<td>MIMIC III</td>
<td>&#x2013;</td>
<td>0.0295</td>
</tr>
<tr>
<td>Proposed</td>
<td>U-Net</td>
<td>MIMIC III</td>
<td>0.037</td>
<td>0.0126</td>
</tr>
<tr>
<td></td>
<td></td>
<td>MIMIC-IV</td>
<td>0.007</td>
<td>0.0104</td>
</tr>
<tr>
<td></td>
<td></td>
<td>Beijing Multi-Site Air Quality</td>
<td>0.0087</td>
<td>0.0201</td>
</tr>
<tr>
<td></td>
<td>LL-CNN</td>
<td>MIMIC III</td>
<td>0.00003</td>
<td>0.00045</td>
</tr>
<tr>
<td></td>
<td></td>
<td>MIMIC-IV</td>
<td>0.0351</td>
<td>0.00073</td>
</tr>
<tr>
<td></td>
<td></td>
<td>Beijing Multi-Site Air Quality</td>
<td>0.000162</td>
<td>0.00342</td>
</tr>
<tr>
<td></td>
<td>DRes-CNNs</td>
<td>MIMIC III</td>
<td>0.00000026</td>
<td>0.00018</td>
</tr>
<tr>
<td></td>
<td></td>
<td>MIMIC-IV</td>
<td>0.00000097</td>
<td>0.00006</td>
</tr>
<tr>
<td></td>
<td></td>
<td>Beijing multi-site air quality</td>
<td>0.00000008</td>
<td>0.00002</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>When it comes to imputing missing data across different datasets, the DRes-CNNs model performs exceptionally well, beating other current techniques such as M-RNN and U-Net50. The DRes-CNNs continue to demonstrate greater accuracy in other databases, including Beijing Multi-Site Air Quality, MIMIC III, and IV, where this trend is also evident. The DRes-CNNs routinely yield the lowest errors even among the suite of suggested models, which includes U-Net and LL-CNN, demonstrating its efficacy in managing challenging data imputation jobs. The DRes-CNNs model&#x2019;s precision and resilience are highlighted by this comparative analysis, which makes it a highly useful tool for situations where exact imputation is crucial.</p>
<p>Despite the proposed DRes-CNN has a good performance. However, to capture the non-linear correlations in the data, for example, the DRes-CNN technique employs learnable weights that are updated iteratively. However, if there are no geographical links in the data, the learning process can proceed incorrectly and produce poor imputation. As is common with most healthcare datasets, our datasets comprised both numerical and categorical factors. It&#x2019;s important to keep in mind, though, that the results of our method could not be the same for data that just includes categorical variables. Imputation may be difficult with this kind of data since there may not be many learnable inter-variable correlations. But solving this problem was outside the purview of our work.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>In this research, we reviewed and evaluated deep learning (DL) methods for missing value imputation, particularly in healthcare datasets. Our proposed Deep Residual-Convolutional Neural Networks (DRes-CNN) architecture demonstrated significant improvements in imputing missing values over existing methods. The model&#x2019;s performance was assessed using multiple datasets (MIMIC-III, MIMIC-IV, and the Beijing Multi-Site Air Quality), and the results showed that DRes-CNN achieved superior RMSE values compared to other techniques. Despite the proposed DRes-CNN has a good performance. However, to capture the non-linear correlations in the data, for example, the DRes-CNN technique employs learnable weights that are updated iteratively. However, if there are no geographical links in the data, the learning process can proceed incorrectly and produce poor imputation. As is common with most healthcare datasets, our datasets comprised both numerical and categorical factors. It&#x2019;s important to keep in mind, though, that the results of our method could not be the same for data that just includes categorical variables. Imputation may be difficult with this kind of data since there may not be many learnable inter-variable correlations. However, solving this problem was outside the purview of our work. Future work could focus on addressing these limitations by optimizing the architecture for better scalability and reducing computational cost, while also exploring methods to improve the generalization of the DRes-CNN approach to a broader range of datasets, including those dominated by categorical variables. Additionally, expanding the method to handle multimodal data in more complex healthcare scenarios would be another valuable direction for further research.</p>
</sec>
</body>
<back>
<ack>
<p>The research infrastructure and financial support for this work was provided by the Intelligent System Research Group (ISysRG), Universitas Sriwijaya, Indonesia.</p>
</ack>
<sec><title>Funding Statement</title>
<p>This work was supported by the Intelligent System Research Group (ISysRG). This work was also supported by Universitas Sriwijaya funded by the Competitive Research 2024.</p>
</sec>
<sec><title>Author Contributions</title>
<p>Firdaus Firdaus and Siti Nurmaini: wrote the manuscript and funding acquisition. Anggun Islami and Annisa Darmawahyuni: formal analysis, methodology. Ade Iriani Sapitri and Muhammad Naufal Rachmatullah: designed computer programs, and curated the data. Bambang Tutuko and Akhiar Wista Arum: formal analysis and methodology. Muhammad Irfan Karim and Yultrien Yultrien: resources, analysis, formal analysis, and methodology. Ramadhana Noor Salassa Wandya: contributed data or analysis tools and formal analysis. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability"><title>Availability of Data and Materials</title>
<p>The datasets generated and analyzed in this study are available at <ext-link ext-link-type="uri" xlink:href="https://physionet.org/content/mimiciv/2.2/">https://physionet.org/content/mimiciv/2.2/</ext-link> (accessed on 23 January 2023).</p>
</sec>
<sec><title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<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>K.</given-names> <surname>Psychogyios</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Ilias</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Ntanos</surname></string-name>, and <string-name><given-names>D.</given-names> <surname>Askounis</surname></string-name></person-group>, &#x201C;<article-title>Missing value imputation methods for electronic health records</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>11</volume>, no. <issue>2</issue>, pp. <fpage>21562</fpage>&#x2013;<lpage>21574</lpage>, <year>2023</year>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2023.3251919</pub-id>.</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>M. Y.</given-names> <surname>Landolsi</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Hlaoua</surname></string-name>, and <string-name><given-names>L.</given-names> <surname>Ben Romdhane</surname></string-name></person-group>, &#x201C;<article-title>Information extraction from electronic medical documents: State of the art and future research directions</article-title>,&#x201D; <source>Knowl. Inf. Syst.</source>, vol. <volume>65</volume>, no. <issue>2</issue>, pp. <fpage>463</fpage>&#x2013;<lpage>516</lpage>, <year>2023</year>. doi: <pub-id pub-id-type="doi">10.1007/s10115-022-01779-1</pub-id>; <pub-id pub-id-type="pmid">36405956</pub-id></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>M. A. U.</given-names> <surname>Zaman</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Du</surname></string-name></person-group>, &#x201C;<article-title>A stochastic multivariate irregularly sampled time series imputation method for electronic health records</article-title>,&#x201D; <source>BioMedInformatics</source>, vol. <volume>1</volume>, no. <issue>3</issue>, pp. <fpage>166</fpage>&#x2013;<lpage>181</lpage>, <year>2021</year>. doi: <pub-id pub-id-type="doi">10.3390/biomedinformatics1030011</pub-id>.</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>C.</given-names> <surname>Li</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Improving cardiovascular risk prediction through machine learning modelling of irregularly repeated electronic health records</article-title>,&#x201D; <source>Eur. Hear. J.-Digit. Heal.</source>, vol. <volume>5</volume>, no. <issue>1</issue>, pp. <fpage>30</fpage>&#x2013;<lpage>40</lpage>, <year>2024</year>. doi: <pub-id pub-id-type="doi">10.1093/ehjdh/ztad058</pub-id>; <pub-id pub-id-type="pmid">38264696</pub-id></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>R. H. H.</given-names> <surname>Groenwold</surname></string-name></person-group>, &#x201C;<article-title>Informative missingness in electronic health record systems: The curse of knowing</article-title>,&#x201D; <source>Diagn. Progn. Res.</source>, vol. <volume>4</volume>, no. <issue>1</issue>, pp. <fpage>4</fpage>&#x2013;<lpage>9</lpage>, <year>2020</year>. doi: <pub-id pub-id-type="doi">10.1186/s41512-020-00077-0</pub-id>; <pub-id pub-id-type="pmid">32699824</pub-id></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>K.</given-names> <surname>Yin</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Qian</surname></string-name>, and <string-name><given-names>W. K.</given-names> <surname>Cheung</surname></string-name></person-group>, &#x201C;<article-title>PATNet: Propensity-adjusted temporal network for joint imputation and prediction using binary EHRs with observation bias</article-title>,&#x201D; <source>IEEE Trans. Knowl. Data Eng</source>, vol. <volume>36</volume>, no. <issue>6</issue>, pp. <fpage>2600</fpage>&#x2013;<lpage>2613</lpage>, <year>2024</year>. doi: <pub-id pub-id-type="doi">10.1109/TKDE.2023.3321738</pub-id>.</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>H.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name>, and <string-name><given-names>H.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Missing value imputation through shorter interval selection driven by Fuzzy C-Means clustering</article-title>,&#x201D; <source>Comput. Electr. Eng.</source>, vol. <volume>93</volume>, no. <issue>2</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>16</lpage>, <year>2021</year>. doi: <pub-id pub-id-type="doi">10.1016/j.compeleceng.2021.107230</pub-id>.</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>A. D.</given-names> <surname>Woods</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Best practices for addressing missing data through multiple imputation</article-title>,&#x201D; <source>Infant. Child Dev.</source>, vol. <volume>33</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>37</lpage>, <year>2024</year>. doi: <pub-id pub-id-type="doi">10.1002/icd.2407</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>L. O.</given-names> <surname>Joel</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Doorsamy</surname></string-name>, and <string-name><given-names>B. S.</given-names> <surname>Paul</surname></string-name></person-group>, &#x201C;<article-title>On the performance of imputation techniques for missing values on healthcare datasets</article-title>,&#x201D; <comment>2024, <italic>arXiv:2403.14687</italic></comment>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Q.</given-names> <surname>Suo</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Zhong</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Xun</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>GLIMA: Global and local time series imputation with multi-directional attention learning</article-title>,&#x201D; in <conf-name>Proc. 2020 IEEE Int. Conf. Big Data (Big Data)</conf-name>, <publisher-loc>Atlanta, GA, USA</publisher-loc>, <year>2020</year>, pp. <fpage>798</fpage>&#x2013;<lpage>807</lpage>. doi: <pub-id pub-id-type="doi">10.1109/BigData50022.2020.9378408</pub-id>.</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>P. C.</given-names> <surname>Austin</surname></string-name>, <string-name><given-names>I. R.</given-names> <surname>White</surname></string-name>, <string-name><given-names>D. S.</given-names> <surname>Lee</surname></string-name>, and <string-name><given-names>S.</given-names> <surname>van Buuren</surname> </string-name></person-group>, &#x201C;<article-title>Missing data in clinical research: A tutorial on multiple imputation</article-title>,&#x201D; <source>Can J. Cardiol.</source>, vol. <volume>37</volume>, no. <issue>9</issue>, pp. <fpage>1322</fpage>&#x2013;<lpage>1331</lpage>, <year>2021</year>. doi: <pub-id pub-id-type="doi">10.1016/j.cjca.2020.11.010</pub-id>; <pub-id pub-id-type="pmid">33276049</pub-id></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>X.</given-names> <surname>Weng</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>A joint learning method for incomplete and imbalanced data in electronic health record based on generative adversarial networks</article-title>,&#x201D; <source>Comput. Biol. Med.</source>, vol. <volume>168</volume>, <year>2024</year>, <comment>Art. no. 107687</comment>. doi: <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107687</pub-id>; <pub-id pub-id-type="pmid">38007974</pub-id></mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Wang</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Deep learning for multivariate time series imputation: A survey</article-title>,&#x201D; <comment>2024, <italic>arXiv:2402.04059</italic></comment>.</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>S.</given-names> <surname>Hong</surname></string-name> and <string-name><given-names>H. S.</given-names> <surname>Lynn</surname></string-name></person-group>, &#x201C;<article-title>Accuracy of random-forest-based imputation of missing data in the presence of non-normality, non-linearity, and interaction</article-title>,&#x201D; <source>BMC Med. Res. Methodol.</source>, vol. <volume>20</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>, <year>2020</year>. doi: <pub-id pub-id-type="doi">10.1186/s12874-020-01080-1</pub-id>; <pub-id pub-id-type="pmid">32711455</pub-id></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.</given-names> <surname>Cappelletti</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Fontana</surname></string-name>, <string-name><given-names>G. W.</given-names> <surname>Di Donato</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Di Tucci</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Casiraghi</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Valentini</surname></string-name></person-group>, &#x201C;<article-title>Complex data imputation by auto-encoders and convolutional neural networks&#x2014;A case study on genome gap-filling</article-title>,&#x201D; <source>Computers</source>, vol. <volume>9</volume>, no. <issue>2</issue>, pp. <fpage>37</fpage>, <year>2020</year>. doi: <pub-id pub-id-type="doi">10.3390/computers9020037</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>E.</given-names> <surname>Macias Toro</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Boquet</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Serrano</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Lopez Vicario</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Ibeas</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Morell</surname></string-name></person-group>, &#x201C;<article-title>Novel imputing method and deep learning techniques for early prediction of sepsis in intensive care units</article-title>,&#x201D; in <conf-name>2019 Comput. Cardiol. Conf. (CinC).</conf-name>, <publisher-loc>Singapore</publisher-loc>, <year>2019</year>, vol. <volume>45</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>4</lpage>. doi: <pub-id pub-id-type="doi">10.22489/cinc.2019.038</pub-id>.</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>D. A.</given-names> <surname>Neu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Lahann</surname></string-name>, and <string-name><given-names>P.</given-names> <surname>Fettke</surname></string-name></person-group>, &#x201C;<article-title>A systematic literature review on state-of-the-art deep learning methods for process prediction</article-title>,&#x201D; <source>Artif. Intell. Rev.</source>, vol. <volume>55</volume>, no. <issue>2</issue>, pp. <fpage>801</fpage>&#x2013;<lpage>827</lpage>, <year>2022</year>. doi: <pub-id pub-id-type="doi">10.1007/s10462-021-09960-8</pub-id>.</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>H.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name>, and <string-name><given-names>H.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Handling missing data through deep convolutional neural network</article-title>,&#x201D; <source>Inf. Sci.</source>, vol. <volume>595</volume>, no. <issue>5&#x2013;6</issue>, pp. <fpage>278</fpage>&#x2013;<lpage>293</lpage>, <year>2022</year>. doi: <pub-id pub-id-type="doi">10.1016/j.ins.2022.02.051</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. D.</given-names> <surname>Kulkarni</surname></string-name></person-group>, &#x201C;<article-title>Fuzzy convolution neural networks for tabular data classification</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>12</volume>, pp. <fpage>151846</fpage>&#x2013;<lpage>151855</lpage>, <year>2024</year>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2024.3479882</pub-id>.</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>M. I.</given-names> <surname>Iqbal</surname></string-name>, <string-name><given-names>M. S. H.</given-names> <surname>Mukta</surname></string-name>, <string-name><given-names>A. R.</given-names> <surname>Hasan</surname></string-name>, and <string-name><given-names>S.</given-names> <surname>Islam</surname></string-name></person-group>, &#x201C;<article-title>A dynamic weighted tabular method for convolutional neural networks</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>10</volume>, no. <issue>1</issue>, pp. <fpage>134183</fpage>&#x2013;<lpage>134198</lpage>, <year>2022</year>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2022.3231102</pub-id>.</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>Z.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Peng</surname></string-name>, and <string-name><given-names>J.</given-names> <surname>Zhou</surname></string-name></person-group>, &#x201C;<article-title>A survey of convolutional neural networks: Analysis, applications, and prospects</article-title>,&#x201D; <source>IEEE Trans. Neural Netw. Learn. Syst.</source>, vol. <volume>33</volume>, no. <issue>12</issue>, pp. <fpage>6999</fpage>&#x2013;<lpage>7019</lpage>, <year>2021</year>. doi: <pub-id pub-id-type="doi">10.1109/TNNLS.2021.3084827</pub-id>; <pub-id pub-id-type="pmid">34111009</pub-id></mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Wen</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Yi</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Ke</surname></string-name>, and <string-name><given-names>Y.</given-names> <surname>Shen</surname></string-name></person-group>, &#x201C;<article-title>DiffImpute: Tabular data imputation with denoising diffusion probabilistic model</article-title>,&#x201D; <comment>2024, <italic>arXiv:2403.13863</italic></comment>.</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>C. C.</given-names> <surname>Nguyen</surname></string-name></person-group>, &#x201C;<article-title>Deep learning for simultaneous imputation and classification of time series incomplete data</article-title>,&#x201D; <source>J. Sci. Tech.</source>, vol. <volume>12</volume>, no. <issue>1</issue>, pp. <fpage>110</fpage>&#x2013;<lpage>125</lpage>, <year>2023</year>. doi: <pub-id pub-id-type="doi">10.56651/lqdtu.jst.v12.n1.661.ict</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Lai</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Wu</surname></string-name>, and <string-name><given-names>L.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Autoencoder-based multi-task learning for imputation and classification of incomplete data</article-title>,&#x201D; <source>Appl. Soft Comput.</source>, vol. <volume>98</volume>, <year>2021</year>, <comment>Art. no. 106838</comment>. doi: <pub-id pub-id-type="doi">10.1016/j.asoc.2020.106838</pub-id>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Dai</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Getzen</surname></string-name>, and <string-name><given-names>Q.</given-names> <surname>Long</surname></string-name></person-group>, &#x201C;<article-title>SADI: Similarity-aware diffusion model-based imputation for incomplete temporal EHR data</article-title>,&#x201D; in <conf-name>Proc. 27th Int. Conf. Artif. Intell. Statist.</conf-name>, <publisher-loc>Val&#x00E8;ncia, Spain</publisher-loc>, <year>2024</year>, pp. <fpage>4195</fpage>&#x2013;<lpage>4203</lpage>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Varma</surname></string-name>, <string-name><given-names>C. S.</given-names> <surname>Yainik</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Thorave</surname></string-name>, and <string-name><given-names>N.</given-names> <surname>Sharma</surname></string-name></person-group>, &#x201C;<article-title>Handling missing data in longitudinal anthropometric data using multiple imputation method</article-title>,&#x201D; in <conf-name>Int. Conf. Data Manag., Analyt. Innov. (ICDMAI 2024). Lect. Not. Netw. Syst.</conf-name>, <publisher-loc>Vellore, India</publisher-loc>, <year>2024</year>, vol. <volume>997</volume>, pp. <fpage>273</fpage>&#x2013;<lpage>287</lpage>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Li</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Method for incomplete and imbalanced data based on multivariate imputation by chained equations and ensemble learning</article-title>,&#x201D; <source>IEEE J. Biomed. Health Inform.</source>, vol. <volume>28</volume>, no. <issue>5</issue>, pp. <fpage>3102</fpage>&#x2013;<lpage>3113</lpage>, <year>2024</year>. doi: <pub-id pub-id-type="doi">10.1109/JBHI.2024.3376428</pub-id>; <pub-id pub-id-type="pmid">38483807</pub-id></mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Brimos</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Seregkos</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Karamanou</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Kalampokis</surname></string-name>, and <string-name><given-names>K.</given-names> <surname>Tarabanis</surname></string-name></person-group>, &#x201C;<article-title>Deep learning missing value imputation on traffic data using self-attention and GAN-based methods</article-title>,&#x201D; in <conf-name>2024 Panhellenic Conf. Elect. Telecommun. (PACET)</conf-name>, <year>2024</year>, pp. <fpage>1</fpage>&#x2013;<lpage>4</lpage>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Yin</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Yuan</surname></string-name>, <string-name><given-names>I. M.</given-names> <surname>Tanvir</surname></string-name>, and <string-name><given-names>X.</given-names> <surname>Bao</surname></string-name></person-group>, &#x201C;<article-title>Electronic medical records imputation by temporal generative adversarial network</article-title>,&#x201D; <source>BioData Min.</source>, vol. <volume>17</volume>, no. <issue>1</issue>, p. <fpage>19</fpage>, <year>2024</year>. doi: <pub-id pub-id-type="doi">10.1186/s13040-024-00372-2</pub-id>; <pub-id pub-id-type="pmid">38926718</pub-id></mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M. T.</given-names> <surname>Rasheed</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Liu</surname></string-name>, and <string-name><given-names>S.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>High-order polynomial interpolation with CNN: A robust approach for missing data imputation</article-title>,&#x201D; <source>Comput. Electr. Eng.</source>, vol. <volume>119</volume>, <year>2024</year>, <comment>Art. no. 109524</comment>. doi: <pub-id pub-id-type="doi">10.1016/j.compeleceng.2024.109524</pub-id>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Johnson</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Bulgarelli</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Pollard</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Horng</surname></string-name>, <string-name><given-names>L. A.</given-names> <surname>Celi</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Mark</surname></string-name></person-group>, &#x201C;<article-title>MIMIC-IV</article-title>,&#x201D; <source>PhysioNet</source>. <comment>2020. Accessed: Jan. 23, 2023</comment>. [Online]. Available: <ext-link ext-link-type="uri" xlink:href="https://physionet.org/content/mimiciv/1.0/">https://physionet.org/content/mimiciv/1.0/</ext-link></mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. E. W.</given-names> <surname>Johnson</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>MIMIC-IV, a freely accessible electronic health record dataset</article-title>,&#x201D; <source>Sci. Data.</source>, vol. <volume>10</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>10</lpage>, <year>2023</year>. doi: <pub-id pub-id-type="doi">10.1038/s41597-022-01899-x</pub-id>; <pub-id pub-id-type="pmid">36596836</pub-id></mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Ghosh</surname></string-name></person-group>, &#x201C;<chapter-title>Data pre-processing</chapter-title>,&#x201D; in <source>Data Analysis with Machine Learning for Psychologists: Crash Course to Learn Python 3 and Machine Learning in 10 Hours</source>. <publisher-loc>Berlin, Heidelberg, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>, <year>2022</year>, pp. <fpage>55</fpage>&#x2013;<lpage>85</lpage>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>Izonin</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Tkachenko</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Shakhovska</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Ilchyshyn</surname></string-name>, and <string-name><given-names>K. K.</given-names> <surname>Singh</surname></string-name></person-group>, &#x201C;<article-title>A two-step data normalization approach for improving classification accuracy in the medical diagnosis domain</article-title>,&#x201D; <source>Mathematics</source>, vol. <volume>10</volume>, no. <issue>11</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>18</lpage>, <year>2022</year>. doi: <pub-id pub-id-type="doi">10.3390/math10111942</pub-id>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Yoon</surname></string-name>, <string-name><given-names>W. R.</given-names> <surname>Zame</surname></string-name>, and <string-name><given-names>M.</given-names> <surname>van der Schaar</surname></string-name></person-group>, &#x201C;<article-title>Estimating missing data in temporal data streams using multi-directional recurrent neural networks</article-title>,&#x201D; <source>IEEE Trans. Biomed. Eng.</source>, vol. <volume>66</volume>, no. <issue>5</issue>, pp. <fpage>1477</fpage>&#x2013;<lpage>1490</lpage>, <year>2019</year>. doi: <pub-id pub-id-type="doi">10.1109/TBME.2018.2874712</pub-id>; <pub-id pub-id-type="pmid">30296210</pub-id></mixed-citation></ref>
</ref-list>
</back></article>