<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Class Imbalance in Electronic Health Records Data Imputation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Linglong Qian</string-name>
          <email>linglong.qian@kcl.ac.uk</email>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zina Ibrahim</string-name>
          <email>zina.ibrahim@kcl.ac.uk</email>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ao Zhang</string-name>
          <email>ao.zhang@kcl.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Richard JB Dobson</string-name>
          <email>richard.j.dobson@kcl.ac.uk</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Missingness, Imbalance, Imputation, Self-supervised learning</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Natural, Mathematical &amp; Engineering Sciences, King's College London</institution>
          ,
          <addr-line>London</addr-line>
          ,
          <country country="UK">United Kingdom</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Health Data Research UK London, University College London</institution>
          ,
          <addr-line>London</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Institute of Psychiatry, Psychology and Neuroscience, King's College London</institution>
          ,
          <addr-line>London</addr-line>
          ,
          <country country="UK">United Kingdom</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>South London and Maudsley NHS Foundation Trust</institution>
          ,
          <addr-line>London</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>University College London</institution>
          ,
          <addr-line>London</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff5">
          <label>5</label>
          <institution>Workshop Proce dings</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Imputing missing values in imbalanced datasets remains an open challenge. Most methods assume data are missing at random or follow a standard distribution, lacking robustness for complex real-world data. Electronic health records exhibit severe class imbalance with non-random missingness, hindering model performance. We propose  3-BRITS for greater scalability and flexibility, modeling temporal and cross-feature correlations to impute missing data, by optimizing sample similarity with deep metric learning for self-supervised learning. Evaluating imputation alone avoids reduced diversity and model bias from joint downstream tasks. Our model achieves superior performance to all baseline methods on four real-world datasets. This shows promise for increasing model scalability and flexibility to handle complex real-world data.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The development of successful machine learning models,
leveraging data procured from Electronic Health Records
(EHRs), necessitates confronting the prevalent issue of
data missingness inherent in this extensive information
repository. Nevertheless, the assorted data types
encapsulated within EHRs are gathered at variable time
intervals, mirroring both clinical and administrative decisions
enacted by healthcare practitioners to bolster patient
care. Consequently, the data amalgamates both static
and irregularly-sampled temporal data. For instance,
vital signs like heart rate are often subject to regular
monitoring, while the recording of white blood cell (WBC)
count is not universally consistent across patients. This
is primarily because it is infrequently ordered for
clinically stable patients who are minimally suspected of
harbouring an infection [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>The complex phenomenon of missingness in EHRs
poses significant challenges to imputation algorithms.</p>
      <p>
        Beyond the high rates of missing data, over 50% of EHR
information is missing non-randomly [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ], making the
THE 6TH INTERNATIONAL WORKSHOP ON KNOWLEDGE
DISCOVERY FROM HEALTHCARE DATA
∗Corresponding author.
nEvelop-O
(R. J. Dobson)
complexities
are
      </p>
      <p>welldocumented
in
retrospective
studies</p>
      <p>evaluating
long-term missingness patterns in multi-center medical</p>
      <p>
        In these analyses, significant variation was
observed across tasks, variables, and time [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Such ance, yet they inadequately handle uneven missingness
sophisticated attributes undoubtedly constrain the appli- distributions. This inadequacy leads us to consider deep
cability of traditional statistical and machine learning metric learning [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], which enables intrinsic distribution
imputation methods [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ]. These methods typically recalibration via sample distance learning.
make strong assumptions about the data’s originating Deep metric learning, necessitating indications of
simidistributions, markedly limiting the generalizability of larity or dissimilarity, has shown success in handling
comimputation algorithms. plex data types and structures, as demonstrated by
Me
      </p>
      <p>
        Deep learning (DL) models, encompassing convo- LIM [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] and DECADE [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. Unlike traditional deep
claslutional neural networks (CNN) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], recurrent neu- sification methods, this approach doesn’t require class
ral networks (RNN) [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], and multi-layer perceptions balance within a minibatch, ofering a promising solution
(MLP) [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], have demonstrated success in estimating to data imputation challenges.
non-randomly missing values in temporal medical data. Models such as GRUU [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ], V-RIN [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ], and BRITS
Notwithstanding, in all successful imputations, the net- illustrate the simultaneous execution of imputation and
work components (either recurrent or convolutional) downstream tasks within a single neural network,
alwere trained in tandem with the classification/regres- though the results are not consistently satisfactory. We
sion component [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Consequently, the imputation task argue that this integration might introduce model bias
has been intimately linked with the downstream task, due to potential divergence in classification and
impumaking it challenging to determine the imputer’s contri- tation focuses. Consequently, our study concentrates
bution to the predictor’s final performance. solely on the imputation process, aiming to minimize
      </p>
      <p>
        Our study aims to address these gaps in managing such biases and enhance data restoration eficiency.
missing data in Electronic Health Records (EHRs) by
extending the RNN model BRITS [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. BRITS captures
nonrandom missingness patterns both historically and across 3. Terminology and Background
features. We restructure imputation as a scalable,
selfsupervised learning task using multiple masking metric For a temporal interval observed over  discrete
timelearning. This approach helps overcome issues related to steps, we represent a multivariate time series as a matrix
skewed distributions while enabling scalability for com-  = { 1,  2, ...,   }, composed of  observations. Each
obplex EHR data imputation, accommodating non-random servation, denoted by   ∈ ℝ , is a vector of  features.
missingness, mixed data types, and uneven sampling. These features encapsulate various modalities, namely
      </p>
      <p>
        Our model,  3-BRITS, employs BRITS as a backbone numerical (  ), categorical (  ), static (  ), and
dyand adaptively learns properties intrinsic to clinical time- namic (  ) variables. It is crucial to note that ℝ is
series data through self-supervised deep metric learning. heterogeneous, encompassing structured data types that
 3-BRITS surpasses all existing imputation methods, extend beyond purely numerical features. This
configuincluding BRITS, in realistic complex scenarios. ration allows for a comprehensive representation of the
diverse data elements inherent in complex multivariate
time series.
2. Related Work Information related to missing values is encapsulated
within two derived matrices (see Fig. 1). The mask
matrix  ∈ ℝ × indicates whether each element of  is
observed or missing:
Eforts to impute multivariate time series data have
resulted in numerous strategies. Among these, the GRUD
model [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] incorporates temporal decay for missing
data imputation, and its extensions, MRNN [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] and 0, if   is missing
BRITS [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], capture temporal dynamics and missingness   = {1, otherwise (1)
patterns across multiple features utilizing bidirectional
RNNs. However, the MRNN model’s limitation lies in Additionally, given that the time elapsed between
contreating imputed values as constants without suficient secutive observations can vary across the interval, we
updates during iterations. In contrast, BRITS, free from denote the time gaps at each time step  as   . For features
specific data assumptions, has exhibited superior perfor- observed over time steps,   represents the gap between
mance across domains, indicating a need for enhanced the current time step (e.g.,   ) and the last observed value.
approaches such as ours. Given the potential for non-uniform sampling across
fea
      </p>
      <p>
        Existing temporal imputation methods struggle in tures in the data  , there is a corresponding variability
managing class imbalances and disparate missingness in   . The  ∈ ℝ  × encodes the time gap between two
distributions, often evident in clinical data [
        <xref ref-type="bibr" rid="ref16 ref17">16, 17</xref>
        ]. Strate- successive observed values for each feature  , providing
gies such as resampling [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], cost-sensitive [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], and en- an additional indicator of temporal context to the dataset.
semble learning [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] are deployed to address class
imbalvations in time steps  1, ...,  5 with corresponding time-stamps
 1−5 = 0, 4, 5, 7, 9. Feature  2 was missing during  2−4, the last
observation took place at  1. Hence,  52 =  5 −  1 = 9 − 0 = 9.
      </p>
      <p>The definition of this indicator follows:

  =
 −  −1

⎨
⎩0
⎧  −  −1 +  −1

if  &gt; 1,   = 0
if  &gt; 1,   = 1
if  = 1</p>
      <sec id="sec-1-1">
        <title>3.1. Overview of the BRITS Backbone</title>
        <p>Our work extends BRITS’s assumptions, emphasizing
temporal and feature correlations embodied in  . BRITS
architecture, combining a fully-connected regression
module and a recurrent component, applies temporal
decay (Eq. (3)) and a decay factor to handle temporal
correlations and adjust influence based on temporal distance.</p>
        <p>Missing values within an observation   are managed via
a historical representation  ̂ and a masking vector   ,
producing a complement vector  ℎ that accounts for
missingness patterns (Eq. (3)-(6)).</p>
        <p>ℎ = exp (− max(0,  ℎ   +   ℎ ))
ℎ̂ −1 = ℎ−1 ⊙  ℎ</p>
        <p>̂ =   ℎ̂ −1 +  
 ℎ =   ⊙   + (1 −   ) ⊙  ̂
(3)
(4)
(5)
(6)</p>
        <p>BRITS explores intra-observation correlations through
a fully-connected layer, generating  
approximation of missing values (Eq. (7)). The concept
of decay extends to feature space, resulting in a
learnable factor,  ̂ , considering both temporal decay and the
masking vector (Eq. (8)-(9)). This integration produces
the imputed matrix   , efectively combining observed</p>
        <p>, a feature-wise
and imputed data (Eq. (10)-(11)).</p>
        <p />
        <p>=    ℎ +  
  = exp (− max(0,     +    ))
 ̂ =  (   [  ∘   ] +   )
  =   ⊙</p>
        <p>
          + (1 −   ) ⊙  ℎ
  =   ⊙   + (1 −   ) ⊙  

(7)
(9)
(10)
underexplored [
          <xref ref-type="bibr" rid="ref28">28, 29</xref>
          ]. By employing repeated masking
ℎ =  (   ℎ̂ −1 +  ℎ[  ∘   ] +  ℎ)
 ∗ =
   +  


2
(13)
        </p>
        <p>The final step (Eq. (12)) updates the hidden state via
Recurrent Neural Networks (RNNs), leveraging various
indicators to learn functions of past observations. The
bidirectional recurrent dynamics approach integrates
backward information to tackle slow convergence, providing
paired outputs  

, ;   and ℎ  , ; ℎ (Eq. (13)).</p>
        <p />
        <p />
        <p>
          In essence, BRITS exploits temporal and feature
correlations in multivariate time series data, employing decay
factors, a regression module, and a bidirectional RNN for
imputing missing values. The final hidden states are
updated using imputations and corresponding masks, with
(2) the integrated processes visualized in Figure 2.
and flexible imputation through the use of  3-BRITS, as
illustrated in Figure 3. In real-world temporal data, the
degree of heterogeneity varies across diferent domains. For
instance, healthcare data often demonstrate significant
class imbalance. Furthermore, the time-varying statistics
of various types of data present substantial challenges
for interpretation within a single location, a complexity
that amplifies when extended to multiple locations. This
makes the incorporation of all relevant prior knowledge
into the analytical model impractical. Traditional metric
learning techniques [
          <xref ref-type="bibr" rid="ref26 ref27">26, 27</xref>
          ] are designed to construct
task-specific distance metrics from data automatically.
        </p>
        <p>To navigate this complexity, we extend the base model
by applying Self-Supervised Deep Metric Learning to
diminish task bias while facilitating the exploration of
individual properties.
and generating a diverse array of examples, the model can analogous to BERT [31]. We initially prepend a
learndiscern valuable features distributed throughout the en- able embedding, the [CLS] token, to the hidden states
tire data, inclusive of those from minority classes, thereby as delineated in Equation 14. Each transformer encoder
enhancing the overall representational richness. This layer comprises two sublayers: (a) a multi-headed
selfstrategy can yield considerable benefits, especially under attention mechanism (MSA, as defined in Equation 15),
conditions where labeled data is either scarce or imbal- and (b) a feed-forward network (FFN, as defined in
Equaanced. Furthermore, self-supervised learning can provide tion 16). Residual connections [32] are utilized around
assistance in alleviating issues associated with overfit- each of the sublayers in both the MSA and the FFN,
folting, which are frequently encountered when models lowed by layer normalization (LN). The [CLS] embedding
are trained on imbalanced datasets. Notwithstanding serves as   ,   ,   .
these advantages, challenges might emerge, including
the identification of suitable auxiliary tasks and the risk ℎ̂ = [CLS; ℎ0; ℎ1; ...; ℎ ] (14)
of learning non-discriminative features [30]. ℎ̂ ′ = LN(MSA(ℎ̂ ) + ℎ̂ ) (15)
Online Hard Triplets Mining The directionality of
representations, whether originating from single-layer   ,   ∈ [  (  (  )),   (  (  ))] (17)
BRITS or our  3-BRITS model, is employed to guide the   ∈ [  (  (  )),     (  ))],  ≠ 
construction of triplets. The dual directional indicators
double the mini-batch size. This strategy applies to both where the   represents the forward hidden states of
labeled and unlabeled data, ensuring each triplet is bal- sample  ,   for backward. Among the constructed
anced with one positive and one negative sample pair. triplets, we select all triplets that violate the following
However, this paper primarily focuses on labeled data in condition:
an efort to address the imbalance problem. Specifically, ∥   −   ∥2 + &lt; ∥   −   ∥2 (18)
one representation is assigned as the anchor (denoted as
  ), and another randomly chosen representation from  is a pre-set margin, meaning we only consider samples
the same group is defined as the positive sample (denoted that are easily confused with the anchor sample by a
as   ). Concurrently, representations from a diferent margin  .
group within the same mini-batch are classified as
negative samples (denoted as   ).</p>
        <p>Loss Function This study utilizes the
state-of-theart Multi-Similarity loss (MS loss) objective function, a
Incorporating Self-Attention for Optimal Represen- renowned metric learning objective [33]. The MS loss
tation Learning In order to optimally learn repre- function prioritizes the significance of the samples by
sentations in each direction, we employ a methodology exploring the similarities within positive pairs and
between negative pairs. The pairs that are most informative
ℎ̂ ∗ = LN(   (
ℎ̂ ′) + ℎ̂ ′)
(16)
are often indistinguishable and hence contribute more
substantially during the training process.</p>
        <p>ℒ =
1
∣  ∣ ∈
∑ { 1 log[1 + ∑  ( S −) ]</p>
        <p>(19)


+ 1 log[1 + ∑</p>
        <p>( S −) ]}
∈ 
∈ 
where  ,  ,  are hyperparameters;  denotes mini-batch
samples.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>5. Experiments</title>
      <p>In this section, we carefully assess and analyze the
performance of  3-BRITS by comparing it with
state-ofmains of healthcare, environment, and trafic. The
models against which  3-BRITS is compared include BRITS,
GRUD, V-RIN(full), and MRNN. For all experiments, only
the best model from each study is employed for
comparison. While a comparison with the  2GAN model
would have been intriguing, especially considering that
[34] does not provide a quantitative comparison with
BRITS, its inclusion in our study was precluded due to
the obsolescence of the publicly-available code based on
TensorFlow 1.7 and Python 2.7, rendering it incompatible
with our accessible GPU hardware.</p>
      <sec id="sec-2-1">
        <title>5.1. Datasets</title>
        <p>The four datasets chosen for experimental evaluation
each exhibit distinctive data distributions, with the
MIMIC-III database particularly noted for its high rate
of missing data. In our replication of the benchmarking
studies for these publicly accessible datasets, we opted
to bypass any steps that involved the removal of all-NaN
samples to preserve the original missingness inherent in
the data.</p>
      </sec>
      <sec id="sec-2-2">
        <title>5.2. Implementation Details</title>
        <p>In this study, we utilized the Adam optimizer across all
models, with the number of RNN hidden units fixed at
108. The batch size was determined based on the specific
dataset; MIMIC-Mortality and Air Quality were allocated
a batch size of 128, while Trafic and MIMIC-Physionet
Challenge were assigned a batch size of 64. To promote
stable training, each dataset was normalized to have zero
mean and unit variance. Randomly, we selected 10% of
each dataset for validation and another 10% for testing,
training the models on the remaining data. For the
imputation task, we randomly masked 10% of observations
in each dataset to serve as the ground truth, which was
used as validation data. A 5-fold cross-validation method
the-art models using four real-world datasets in the do- (MAE) and Mean Relative Error (MRE). As for the
Muland  -BRITS. The  3-BRITS model represents
Multiple Masking Metric Learning. Similarly, the  2-BRITS
denotes Multiple Masking Learning, and the  -BRITS
variant only encompasses Metric Learning. These
diferent versions allowed us to evaluate the efectiveness and
contribution of each component in a variety of real-world
datasets.
outperformed the others across all datasets. However, it
is noteworthy that, for each dataset, the MREs of our
proposed  3-BRITS and  2-BRITS models were generally
equivalent to, or better than, those of the other
competing models. Baseline models, namely MRNN, GRUD, and
V-RIN-full, did not outperform our proposed models in
terms of either MAE or MRE across all datasets. This
underlines the eficacy of the</p>
        <p>3-BRITS and  2-BRITS
methodologies in processing these real-world datasets.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>6. Discussion and Conclusions References</title>
      <p>We propose  3-BRITS, an innovative architecture that
incorporates deep metric learning into the BRITS model
for imputing missing values in multivariate time series
characterized by non-random missingness. Our empirical
ifndings indicate that  3-BRITS delivers state-of-the-art
performance across various datasets in the realm of time
series imputation.</p>
      <p>The  3-BRITS model advances the BRITS architecture
by optimizing sample similarity through self-supervised
deep metric learning. This approach allows for
circumventing prevalent issues such as class imbalance, thereby
averting the imposition of artificial data distribution. By
assessing imputation performance in isolation, as
opposed to jointly with downstream tasks,  3-BRITS
prevents the diminution of diversity and model bias that can
emerge from varying data focuses.</p>
      <p>The experimental results substantiate that  3-BRITS
outperforms all baseline models. These outcomes
underscore how augmenting an imputation model with deep
metric learning and self-supervised learning empowers
it to manage more intricate data with non-random
missingness, an area where other techniques might falter.
The  3-BRITS model presents a promising prospect for
achieving superior scalability and flexibility to address
challenges encountered in real-world time series data.</p>
      <p>In forthcoming research, we aspire to evaluate the
performance of  3-BRITS on additional complex healthcare
datasets, particularly those typified by high missing rates,
class imbalance, and mixed variable types. We will also
explore potential enhancements to  3-BRITS, inclusive
of the incorporation of other self-supervised learning
methodologies.</p>
    </sec>
    <sec id="sec-4">
      <title>Acknowledgments</title>
      <p>This paper represents independent research funded by
the NIHR Maudsley Biomedical Research Centre at South
London and Maudsley NHS Foundation Trust and King’s
College London. The views expressed are those of the
author(s) and not necessarily those of the NIHR or the
Department of Health and Social Care. The work of
Linglong Qian was supported by the Kings-China
Scholarship Council PhD Scholarship Programme (K-CSC) under
Grant CSC202008060096. All models are implemented
on CREATE HPC.1
1King’s College London. (2022). King’s Computational Research,
Engineering and Technology Environment (CREATE). Retrieved
March 2, 2022, from https://doi.org/10.18742/rnvf-m076</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Hu</surname>
          </string-name>
          , et al.,
          <article-title>Strategies for handling missing clinical data for automated surgical site infection detection from the electronic health record</article-title>
          ,
          <source>Journal of biomedical informatics 68</source>
          (
          <year>2017</year>
          )
          <fpage>112</fpage>
          -
          <lpage>120</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Z. C.</given-names>
            <surname>Lipton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Wetzel</surname>
          </string-name>
          ,
          <article-title>Directly modeling missing data in sequences with rnns: Improved classification of clinical time series, in: Machine learning for healthcare conference</article-title>
          , PMLR,
          <year>2016</year>
          , pp.
          <fpage>253</fpage>
          -
          <lpage>270</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>B. J.</given-names>
            <surname>Wells</surname>
          </string-name>
          ,
          <string-name>
            <surname>K. M. Chagin</surname>
            ,
            <given-names>A. S.</given-names>
          </string-name>
          <string-name>
            <surname>Nowacki</surname>
            ,
            <given-names>M. W.</given-names>
          </string-name>
          <string-name>
            <surname>Kattan</surname>
          </string-name>
          ,
          <article-title>Strategies for handling missing data in electronic health record derived data</article-title>
          ,
          <source>Egems</source>
          <volume>1</volume>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>R.</given-names>
            <surname>Armstrong</surname>
          </string-name>
          , et al.,
          <article-title>The incidence of cardiac arrest in the intensive care unit: A systematic review and meta-analysis</article-title>
          ,
          <source>Journal of the Intensive Care Society</source>
          <volume>20</volume>
          (
          <year>2019</year>
          )
          <fpage>144</fpage>
          -
          <lpage>154</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Mazurowski</surname>
          </string-name>
          , et al.,
          <article-title>Training neural network classifiers for medical decision making: The efects of imbalanced datasets on classification performance</article-title>
          ,
          <source>Neural networks 21</source>
          (
          <year>2008</year>
          )
          <fpage>427</fpage>
          -
          <lpage>436</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>He</surname>
          </string-name>
          , Y. Liu, Imverde:
          <article-title>Vertex-diminished random walk for learning imbalanced network representation</article-title>
          ,
          <source>in: 2018 IEEE International Conference on Big Data (Big Data)</source>
          , IEEE,
          <year>2018</year>
          , pp.
          <fpage>871</fpage>
          -
          <lpage>880</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>L. E.</given-names>
            <surname>Zarate</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. M.</given-names>
            <surname>Nogueira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. R.</given-names>
            <surname>Santos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <article-title>Techniques for missing value recovering in imbalanced databases: Application in a marketing database with massive missing data</article-title>
          ,
          <source>in: 2006 IEEE International Conference on Systems, Man and Cybernetics</source>
          , volume
          <volume>3</volume>
          , IEEE,
          <year>2006</year>
          , pp.
          <fpage>2658</fpage>
          -
          <lpage>2664</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>P.</given-names>
            <surname>Yadav</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Steinbach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kumar</surname>
          </string-name>
          , G. Simon,
          <article-title>Mining electronic health records (ehrs) a survey, ACM Computing Surveys (CSUR) 50 (</article-title>
          <year>2018</year>
          )
          <fpage>1</fpage>
          -
          <lpage>40</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P. B.</given-names>
            <surname>Jensen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. J.</given-names>
            <surname>Jensen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Brunak</surname>
          </string-name>
          ,
          <article-title>Mining electronic health records: towards better research applications and clinical care</article-title>
          ,
          <source>Nature Reviews Genetics</source>
          <volume>13</volume>
          (
          <year>2012</year>
          )
          <fpage>395</fpage>
          -
          <lpage>405</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kuen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shahroudy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Shuai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cai</surname>
          </string-name>
          , et al.,
          <article-title>Recent advances in convolutional neural networks</article-title>
          ,
          <source>Pattern recognition 77</source>
          (
          <year>2018</year>
          )
          <fpage>354</fpage>
          -
          <lpage>377</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M.</given-names>
            <surname>Schuster</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. K.</given-names>
            <surname>Paliwal</surname>
          </string-name>
          ,
          <article-title>Bidirectional recurrent neural networks</article-title>
          ,
          <source>IEEE transactions on Signal Processing</source>
          <volume>45</volume>
          (
          <year>1997</year>
          )
          <fpage>2673</fpage>
          -
          <lpage>2681</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Arber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Hunter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Ross</given-names>
            <surname>Jr</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hongo</surname>
          </string-name>
          , G. Sansig,
          <string-name>
            <given-names>J.</given-names>
            <surname>Borg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-C.</given-names>
            <surname>Perriard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. R.</given-names>
            <surname>Chien</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Caroni</surname>
          </string-name>
          ,
          <article-title>Mlp-deficient mice exhibit a disruption of cardiac cytoarchitectural organization, dilated cardiomyopathy, and heart failure</article-title>
          ,
          <source>Cell</source>
          <volume>88</volume>
          (
          <year>1997</year>
          )
          <fpage>393</fpage>
          -
          <lpage>403</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>W.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <surname>Brits:</surname>
          </string-name>
          <article-title>Bidirectional recurrent imputation for time series</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>31</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Che</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Purushotham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Sontag</surname>
          </string-name>
          , Y. Liu, [29]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Dai</surname>
          </string-name>
          , E. Hovy,
          <string-name>
            <given-names>T.</given-names>
            <surname>Luong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <article-title>UnsuperRecurrent neural networks for multivariate time se- vised data augmentation for consistency training, ries with missing values</article-title>
          ,
          <source>Scientific reports 8 (2018) Advances in neural information processing systems 1-12. 33</source>
          (
          <year>2020</year>
          )
          <fpage>6256</fpage>
          -
          <lpage>6268</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <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>
          , M. van der Schaar, Multi- [30]
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Ng</surname>
          </string-name>
          , et al.,
          <article-title>Preventing” overfitting” of crossdirectional recurrent neural networks: A novel validation data</article-title>
          ,
          <source>in: ICML</source>
          , volume
          <volume>97</volume>
          ,
          <string-name>
            <surname>Citeseer</surname>
          </string-name>
          ,
          <year>1997</year>
          ,
          <article-title>method for estimating missing data</article-title>
          , in: Time series pp.
          <fpage>245</fpage>
          -
          <lpage>253</lpage>
          . workshop in international conference on machine [31]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. N.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , learning,
          <year>2017</year>
          . Bert:
          <article-title>Pre-training of deep bidirectional transform-</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>R. J.</given-names>
            <surname>Little</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. B.</given-names>
            <surname>Rubin</surname>
          </string-name>
          ,
          <article-title>Statistical analysis with ers for language understanding</article-title>
          ,
          <year>2018</year>
          .
          <article-title>URL: https: missing data</article-title>
          , volume
          <volume>793</volume>
          , John Wiley &amp; Sons,
          <year>2019</year>
          . //arxiv.org/abs/
          <year>1810</year>
          .04805.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>H.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. A.</given-names>
            <surname>Garcia</surname>
          </string-name>
          , Learning from imbalanced [32]
          <string-name>
            <given-names>K.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , S. Ren,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <article-title>Deep residual learndata, IEEE Transactions on knowledge and data ing for image recognition</article-title>
          ,
          <source>in: IEEE Conference on engineering 21</source>
          (
          <year>2009</year>
          )
          <fpage>1263</fpage>
          -
          <lpage>1284</lpage>
          .
          <article-title>Computer Vision and Pattern Recognition (CVPR),</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>O.</given-names>
            <surname>Loyola-González</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. F.</given-names>
            <surname>Martínez-Trinidad</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. A.</surname>
          </string-name>
          <year>2016</year>
          , pp.
          <fpage>770</fpage>
          -
          <lpage>778</lpage>
          . Carrasco-Ochoa,
          <string-name>
            <given-names>M.</given-names>
            <surname>García-Borroto</surname>
          </string-name>
          , Study of the [33]
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Scott</surname>
          </string-name>
          ,
          <article-title>impact of resampling methods for contrast pattern Multi-similarity loss with general pair weighting based classifiers in imbalanced databases, Neuro- for deep metric learning</article-title>
          ,
          <source>in: Proceedings of the computing 175</source>
          (
          <year>2016</year>
          )
          <fpage>935</fpage>
          -
          <lpage>947</lpage>
          . IEEE/CVF Conference on Computer Vision and Pat-
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>M.</given-names>
            <surname>Galar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fernández</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Barrenechea</surname>
          </string-name>
          , F. Her- tern
          <string-name>
            <surname>Recognition</surname>
          </string-name>
          ,
          <year>2019</year>
          , pp.
          <fpage>5022</fpage>
          -
          <lpage>5030</lpage>
          . rera, Eusboost: Enhancing ensembles for highly [34]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yuan</surname>
          </string-name>
          , E²gan:
          <article-title>End-toimbalanced data-sets by evolutionary undersam- end generative adversarial network for multivariate pling</article-title>
          ,
          <source>Pattern recognition 46</source>
          (
          <year>2013</year>
          )
          <fpage>3460</fpage>
          -
          <lpage>3471</lpage>
          . time series imputation, in: International Joint Con-
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>B.</given-names>
            <surname>Krawczyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Woźniak</surname>
          </string-name>
          , G. Schaefer, Cost- ference
          <source>on Artificial Intelligence (IJCAI)</source>
          ,
          <year>2019</year>
          , pp.
          <article-title>sensitive decision tree ensembles for efective im- 3094-3100</article-title>
          . doi:
          <volume>10</volume>
          .24963/ijcai.
          <year>2019</year>
          /429. balanced classification,
          <source>Applied Soft Computing</source>
          <volume>14</volume>
          (
          <year>2014</year>
          )
          <fpage>554</fpage>
          -
          <lpage>562</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ş. Bilge</surname>
          </string-name>
          ,
          <article-title>Deep metric learning: A sur- A. Datasets vey</article-title>
          ,
          <source>Symmetry</source>
          <volume>11</volume>
          (
          <year>2019</year>
          )
          <fpage>1066</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <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>F.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Trafic Dataset.
          <article-title>The Metro Interstate Trafic Volume Metric learning on healthcare data with incomplete Data Set, presents the hourly volume of trafic on the inmodalities</article-title>
          .,
          <source>in: IJCAI</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>3534</fpage>
          -
          <lpage>3540</lpage>
          .
          <article-title>terstate highway I-94 in Minneapolis-St Paul</article-title>
          , MN, USA.2
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Che</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>Decade: a deep metric learning model for multivariate time series</article-title>
          , in: KDD workshop
          <article-title>on mining and learning from time Air Quality Dataset. The Beijing Multi-Site Airseries</article-title>
          , sn,
          <year>2017</year>
          .
          <article-title>Quality Data ofers hourly records of air pollutants. 3</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>E.</given-names>
            <surname>Jun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. W.</given-names>
            <surname>Mulyadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <surname>H.-I. Suk</surname>
          </string-name>
          ,
          <article-title>Uncertainty-gated stochastic sequential model for MIMIC-III Dataset. The Medical Information Mart for ehr mortality prediction, IEEE Transactions on Intensive Care III (MIMIC-III) constitutes an extensive</article-title>
          ,
          <source>Neural Networks and Learning Systems</source>
          <volume>32</volume>
          (
          <year>2020</year>
          )
          <article-title>freely accessible database</article-title>
          ,
          <source>encompassing over 40</source>
          ,000
          <fpage>crit4052</fpage>
          -
          <lpage>4062</lpage>
          . ical care patients.4
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>A. W.</given-names>
            <surname>Mulyadi</surname>
          </string-name>
          , E. Jun,
          <string-name>
            <surname>H.-I. Suk</surname>
          </string-name>
          ,
          <article-title>Uncertainty-aware variational-recurrent imputation network for clini- PhysioNet Challenge 2012 Dataset. The Predicting cal time series, IEEE Transactions on Cybernetics Mortality of ICU Patients: The PhysioNet/Computing in (</article-title>
          <year>2021</year>
          ).
          <article-title>Cardiology Challenge 2012 is a publicly available medical</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>B.</given-names>
            <surname>Kulis</surname>
          </string-name>
          , et al.,
          <article-title>Metric learning: A survey, Foun- benchmarking dataset.5 dations and Trends® in Machine Learning 5 (</article-title>
          <year>2013</year>
          )
          <fpage>287</fpage>
          -
          <lpage>364</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <article-title>Distance metric learning: A comprehensive survey</article-title>
          ,
          <source>Michigan State Universiy</source>
          <volume>2</volume>
          (
          <year>2006</year>
          )
          <article-title>4</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>S. C.-X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Marlin</surname>
          </string-name>
          ,
          <article-title>Learning from irregularlysampled time series: A missing data perspective</article-title>
          , 2https://archive.ics.uci.edu/ml/datasets/Metro+Interstate+Trafifc+Volume 3https://archive.ics.uci.edu/ml/datasets/Beijing+Multi-Site+
          <article-title>AirQuality+Data# in:</article-title>
          <source>International Conference on Machine Learning</source>
          , 4https://physionet.org/content/mimiciii/1.4/ PMLR,
          <year>2020</year>
          , pp.
          <fpage>5937</fpage>
          -
          <lpage>5946</lpage>
          . 5https://physionet.org/content/challenge-2012
          <source>/1.0</source>
          .0/
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>