<!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>AI Decision Systems with Feedback Loop Active Learner</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mert Kosan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Linyun He</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Shubham Agrawal</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hongyi Liu</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chiranjeet Chetia</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of California</institution>
          ,
          <addr-line>Santa Barbara, California, 93106</addr-line>
          ,
          <country country="US">United States</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Visa Research</institution>
          ,
          <addr-line>Austin, Texas, 78759</addr-line>
          ,
          <country country="US">United States</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Making precise decisions for high-stakes applications such as finance, health, and self-driving is critical for increasing the economy of an entity or the quality of life. In most scenarios, decision quickness is also as essential as accuracy. This is particularly true in the case of event detection problems, where late detection can cause financial or physical damage. While recent work focuses on combining fast unsupervised AI decision systems and precise human decisions to solve this problem, the quality of this cooperation remains questionable. A human can generate ground-truth labels for the AI decision systems for future improvements. However, having noisy ground truth can worsen the performance. To address this challenge, this paper proposes FLAL (Feedback Loop Active Learner), a novel bridge system between the AI decision system and human/s, designed to understand human expertise and interest using a recommender mechanism and improve AI system performance using an active learning mechanism. FLAL is able to identify human behavior and makes entity recommendations to users who can generate better ground-truth labels for these entities. Our experiments show that FLAL performs better than competing baselines and converges fast.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;decision systems</kwd>
        <kwd>feedback-loop</kwd>
        <kwd>active learning</kwd>
        <kwd>data labeling</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Accuracy is one of the critical evaluation metrics in decision systems, especially for high-stake
applications [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ] such as financial event detection [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], drug discovery [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], and autonomous
driving [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Making the decision systems controlled by AI is risky because of the gray area
problem [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], where AI cannot decide the actual answer and uses an artificial and pre-defined
threshold. On the other hand, human decision systems are time-consuming and require an
expert [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. It leads us to the following question: Can we improve AI decision systems with the
help of human expertise?
      </p>
      <p>Certain high-stakes decisions, such as detecting anomalies in operating server machines
wherein missing them would cause financial loss, can be easily given by AI decision systems. In
order to make such decisions, AI Decision systems are created using either historical experience
(previous anomaly patterns, i.e., learned features) or algorithmic design (certain behaviors
are anomalies, i.e., expert-designed features). However, historical experiences are not always
available because of the label scarcity problem in AI for high-stakes applications. Therefore, the
anomaly decision systems generally are designed as unsupervised classification models, which
afects generalizability and generates multiple misclassifications. A human decision maker may
solve this problem. However, human decision making is very time-consuming and not ideal
where a fast decision is necessary. For instance, if a server machine fails, AI could detect this
quickly compared to a human however human expertise is needed to check and confirm the
detection as well as understand its root cause. In such a context, the human required should be
an expert in understanding the problem. This scenario is not limited to high-stakes decisions.
Credit card approval systems or insurance acceptance systems are other examples that AI may
need the help of human decisions.</p>
      <p>
        Feedback loop (Human-in-the-loop) systems have been studied [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] to create a bridge between
AI and humans. They collect labels from the users and improve the AI decision systems. However,
can we trust the user’s expertise? Even if they are experts, how do we confirm their interest
in asked queries? Recommender systems have been proposed to learn the interest of people
[
        <xref ref-type="bibr" rid="ref10 ref11 ref9">9, 10, 11</xref>
        ]. The system ranks unseen/unused items and recommends them to the user based on
their historical interest or using user interactions [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. While collecting ground-truth labels, the
selection of humans to answer particular queries is critical to improving label correctness and
quality. Combining the recommender mechanism with a feedback loop system could potentially
increase the performance of AI decision systems by having plenty and correct ground-truth
labels.
      </p>
      <p>In this paper, we are looking at specific scenarios of multiple independent entities. Each
entity has temporal multidimensional features, and the AI system makes a decision for each
entity and time (e.g., anomaly/failure decision). Entities will be ranked by their relevance score
to the humans and queried to them to learn their expertise and interests with a pre-defined
budget. It helps the framework generate accurate ground-truth labels and labeling operation
will not be challenging or boring for a human since they are interested in answering.</p>
      <p>We propose FLAL–a novel Feedback Loop Active Learner for better ground-truth labeling–
which aims to learn the expertise and interest of a human before querying the entities to them
using the active learning mechanism. Figure 1 illustrates a summary of FLAL bridging between
an AI decision system and a human. FLAL collects decision for entities from the AI system,
ranks entities based on their relevance score to human/s, and send queries based on the budget.
The human/s answers these queries and sends them back to a FLAL, which learns their behavior
towards these entities as well as stores the answers as ground truths. These ground truths
will be used to improve AI decision systems in the future. Our main contributions can be
summarized as follows:
• We highlight the limitation of current AI decision systems, human decisions, and their
cooperation to generate data labels. AI decision system makes many mistakes, human
decisions are slow, and cooperation may be limited because of the lack of expertise or
interest from humans.
• We propose FLAL, a novel feedback loop active learning framework, for better
groundtruth generation and understanding of human behavior. It uses active learning to train
the framework based on human feedback and stores generated data labels to improve AI
decision systems in the future.
• We conduct experiments to verify the efectiveness of FLAL. We show that our framework
performs better than competing baselines: random forest active learner, AI
decisionbased, and random recommendations. FLAL not only has the best performance but also
converges fast.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Works</title>
      <p>Human-in-the-Loop</p>
      <p>
        Human-in-the-loop, in other words, feedback-loop, mechanisms are studied in the literature to
enhance AI performance by label annotation [
        <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
        ] and generating explanations [
        <xref ref-type="bibr" rid="ref15 ref16 ref17 ref18">15, 16, 17, 18</xref>
        ]
to black-box operations. Since feedback-loop systems are generally real-time systems, they
often use active learning during their training [
        <xref ref-type="bibr" rid="ref13 ref19 ref20">19, 20, 13</xref>
        ]. In our work, we also adapt similar
ideas by incorporating human decisions into AI. However, our method increases the eficiency of
this cooperation by learning the expertise and interest of humans before asking them questions.
Recommenders
      </p>
      <p>
        Recommendation systems are one of the solutions for understanding the behavior of
individuals. They are designed to infer interests and recommend items to humans based on their
historical experience or user interactions [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. The main idea is to rank all relevant items
to the user and recommend the top ones. Therefore, ranking algorithms become one of the
main components [
        <xref ref-type="bibr" rid="ref21 ref22 ref23">21, 22, 23</xref>
        ] in designing recommendation systems. Recently, as opposed to
classical recommenders such as collaborative filtering and matrix factorization, deep-learning
frameworks are applied to learn a better representation of items [
        <xref ref-type="bibr" rid="ref10 ref24 ref25">10, 24, 25</xref>
        ]. However, a lack of
data availability can restrict the number of parameters to be learned. Even though we still use
the advantage of deep learning recommenders, we keep our framework simple but efective.
Our recommender system finds better queries based on the user’s expertise and interests. In
this way, the feedback loop will generate better ground truth labels.
      </p>
      <p>Temporal Embeddings</p>
      <p>
        Representation learning on time-series data has become a popular technique to reduce the
dimension of the temporal data while keeping the representation (meaning) of it intact [
        <xref ref-type="bibr" rid="ref26 ref27">26, 27</xref>
        ].
Time2Vec [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] uses a sine activation function to embed the time-series data. Unsupervised
time-series embedders have been proposed [
        <xref ref-type="bibr" rid="ref29 ref30">29, 30</xref>
        ] to deal with label scarcity. Franceschi et
al. [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ] use the triplet loss function to learn a representation of multidimensional time-series
data. The trained embedder can embed any time-series data with any length. More recently,
Zerveas et al. [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ] propose a transformer-based framework by reconstructing the mask part of
the time-series data. FLAL uses a pre-trained temporal data embedder to represent time-series
data coming from the entities for better and more compact representations.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology</title>
      <sec id="sec-3-1">
        <title>3.1. Problem Formulation</title>
        <p>We formulate our problem as a self-supervised time-series classification. Given an entity set
ℰ = {1, 2, . . . , } where each entity represents a multivariate time-series data (i.e.,  =
[1, 2, . . . , ]), an unsupervised AI decision system  which generates decision probability
 for each entity and timestamp (i.e, () = ), a user set  = {1, 2, . . . , }, and
interest labels  ∈ {0, 1}× ×  for each user to certain timestamp and entity; our goal is to
learn a function ^ : ℰ ,  →  that approximates the expertise of users.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. FLAL: Feedback Loop Active Learner</title>
        <p>We introduce FLAL, a feedback loop active learner that generates ground-truth labels for the AI
decision system while learning human expertise and/or interest. FLAL performs user mapping
and feature extraction that optimizes the human expert’s predictions. As a result, it obtains
better ground-truth labels for the AI decision system.</p>
        <p>Figure 2 describes the steps of FLAL in detail. FLAL finds a global embedding space using
pre-trained time-series embedders and translates the global embedding space into personalized
embedding space. To overcome the cold-start problem, FLAL extracts features from user
embedding space and incorporates AI decisions into this feature set. Finally, it calculates
relevance scores for each entity and sends the top  to human experts for evaluation. The
human classifies each query which in turn generates ground truth information and adds feedback
(explicit or implicit) about their expertise or interest in a certain query. FLAL trains its framework
using this feedback via an active learning mechanism and stores the ground truth information
to improve AI decision systems in the future when necessary.</p>
        <sec id="sec-3-2-1">
          <title>3.2.1. Stream Data Embedder</title>
          <p>
            To increase the expressiveness and compactness of our data, we use an unsupervised multivariate
time-series embedder to represent the entity’s time series. This part of our algorithm is
pretrained with the data, which is not used in our experiments. We used [
            <xref ref-type="bibr" rid="ref29">29</xref>
            ] for our stream
data embedder since it is more flexible to diferent time-series lengths and generates good
representations for anomaly data compared to [
            <xref ref-type="bibr" rid="ref30">30</xref>
            ]. During the embedding of the time-series
data, we consider the last  timestamps.
          </p>
          <p>ℎ = ([(−  ); . . . ; ])
where ℎ is an embedding of ,  is an unsupervised multivariate time-series embedder,
 is multivariate time-series data for , and [· ; · ] is the row concatenation operator.
(1)</p>
        </sec>
        <sec id="sec-3-2-2">
          <title>3.2.2. User Embedding Mapper</title>
          <p>Global embedding space may not be as representative as user embedding space, where one can
understand the expertise of users. Therefore, we have a user embedding mapper that maps
generated embeddings from the stream data embedder to the user embedding space. This
allows them to distinguish between relevant and irrelevant entities to the user. Figure 4 shows
an example of the usefulness of user embedding mapper. For an anomaly detection problem,
multiple reasons can cause an anomaly. But the users are often experts on a certain subset
of those anomalies and the user embedding mapper will map these types close to each other.
As a result, they can be separated from the other anomaly types or normal ones. The user
embeddings are generated as follows:
ℎ = (ℎ)
(2)
where ℎ is a user embedding for User A, and  is the user embedding mapper.  can be
designed as any function, such as the identity or neural networks.</p>
        </sec>
        <sec id="sec-3-2-3">
          <title>3.2.3. Feature Extractor</title>
          <p>Since we do not know any information about the users and cannot conduct an initial survey as
most recommenders do, we need to extract features from the user embedding space. Features
can be learned or designed for a specific application scenario. An example of an expert-designed
feature for anomaly applications can be the average distance from one item to others, which
will likely be higher for anomaly cases. However, learned features are shown as more expressive
than expert-designed features because it is hard to design or engineer all useful features. Feature
extractor can also be seen as a function layer on top of the user embedding mapper. So it will
learn new features from ℎ:</p>
          <p>ℎ′ =  (ℎ)
where ℎ′ has smaller dimension than ℎ, and  is a feature extractor function.  can also
represent a set of learned and expert-designed functions. In that case, ℎ′ will be a concatenation
of extracted features.</p>
        </sec>
        <sec id="sec-3-2-4">
          <title>3.2.4. Recommender</title>
          <p>In order to find better queries for specific users, we calculate each entity’s relevance score to a
user. Note that the AI decision system  already calculates decision probability  for entity
. Even though this probability may not be fully correct, we can incorporate it into relevance
score calculation to ease the cold-start problem. Furthermore, we will also use the extracted
features from the feature extractor. The relevance score of  for a user  calculation will be
as the following:</p>
          <p>= 1 ×  + ∑︁  ⊙ ℎ′
where 1 and  are learned weights. Also, these weights may tell us a story about the
importance of AI decision systems and extracted features for diferent users. Once relevance
scores are calculated for all entities, the recommender will send the top  relevant entities to
the user to get feedback.</p>
        </sec>
        <sec id="sec-3-2-5">
          <title>3.2.5. User Feedback</title>
          <p>The users will have a list of queries to be checked and answered. The user will respond to
each query with two answers: (1) what should be the decision of the AI system? (2) what
is their expertise/interest in this query? The first answer is stored to update the AI decision
system if necessary, while the second is used to train FLAL. Note that our main algorithm is
not controlling the answering part done by the user. If a query has no response, it means no
decision (i.e., do not use to improve the AI decision system) and no expertise (improve FLAL
with the information that the user is not an expert). Furthermore, an interaction system can be
designed to understand the expertise or interest of the user in queries by looking at their click
count or other related metrics. However, this is out of the scope of this project. The expertise
information will be stored in  ∈ {0, 1}, and used to update FLAL.
1–15
(3)
(4)</p>
        </sec>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Training FLAL</title>
        <p>We train our framework based on active learning principles since the problem requires learning
the behavior of users in real-time to collect better ground truth labels for AI decision systems.
The collected ground truth information will be stored to update the AI decision system if
necessary. Our active learning mechanism focuses on updating the recommender using feedback
from expertise information. For each timestamp t, we train our objective which aims to sort
relevance scores of entities,  = [1, . . . , ] based on the expertise information array

 = [1, . . . ,  ]. More specifically we use a contrastive loss for our active learning training

which contains three diferent terms as follows:
max ALL(, ) = 1 *
where WIDEN widens the gap between correctly ranked positive and negative samples,
NARROW narrows the gap between wrongly ranked positive and negative samples, and
RECOVERY recovers unrecommended by narrowing the gap between wrongly-recommended
samples and unrecommended samples (which may contain useful recommendations). We use
1,2,3 as a tunable hyperparameter to value each term respectively. They can be optimized
based on the scenario and the need of an application.</p>
        <sec id="sec-3-3-1">
          <title>3.3.1. Example scenario for our training</title>
          <p>Let  = [1.5, 1.2, 1.1, 0.9, 0.3, 0.2],  = 4,  = [1, 0, 0, 1, ?, ?], 1 = 0.50, 2 = 0.75,
and 3 = 0.25, then our objective will be calculated as follows:
ALL(, ) = 0.50 * ( (1.5 − 1.2) +  (1.5 − 1.1)) → WIDEN
+ 0.75 * ( (0.9 − 1.2) +  (0.9 − 1.1)) → NARROW
+ 0.25 * ( (0.3 − 1.2) +  (0.2 − 1.2) +
 (0.3 − 1.1) +  (0.2 − 1.1)) → RECOVER</p>
        </sec>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. User Simulation</title>
        <p>To see the efectiveness of our feedback-loop part, we need to simulate the user answers. One
way to do this is by using ground truth information for the AI decision system if it is available
(simulating that the user’s expertise/interest is the ground truth). We apply this strategy in this
paper. However, this would allow only one user available in the system. To extend the number
of users to more than one, we propose a new way of simulating users. Each user is represented
as a Gaussian latent space in the entity embedding space. The user space is assigned randomly.
If a query entity is in this space, the user is considered an expert. The user embedding mapper
will map related entities into this space. Figure 5 shows the mapping example.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments</title>
      <p>We illustrate the empirical verification of FLAL compared to three baselines on a dataset. First,
we compare method performance with precision at Section 4.3. Later on, we conduct two
ablation studies: the efect of user embedding mapper (Section 4.4) and objective function
weights (Section 4.5).</p>
      <sec id="sec-4-1">
        <title>4.1. Dataset</title>
        <p>
          We use a public Server Machine [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ] dataset for our experiments. The dataset contains 38
time-series data with various lengths. For our purpose, we chucked the data into 100 time series
(entities) with a length of 365. Each time series consists of 38 diferent features. At any point in
the time series, machine activity is classified as normal or failure. Failure represents an anomaly.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Experimental Settings</title>
        <sec id="sec-4-2-1">
          <title>4.2.1. Baselines</title>
          <p>We used three baselines to compare our method.</p>
          <p>Random: It makes random recommendations in the recommender step to the user.</p>
          <p>AI System Decisions: It only uses AI decision system probability to recommend entities to
the user.</p>
          <p>Random Forest Active Learner: It combines uncertainty and confidence scores for each
entity and recommends them to the user. The model is trained using active learning with a
random forest as the estimator and the same settings as FLAL.</p>
        </sec>
        <sec id="sec-4-2-2">
          <title>4.2.2. Other Settings</title>
          <p>Model selection: We select user embedding mapper as a linear layer as a result of ablation
study (See Section 4.4), feature extractor generates 15 learned features with linear layer, and
recommender is also a linear layer to generate a relevance score for an entity. To simulate user
feedback, we use the ground truth information of the dataset.</p>
          <p>Hyperparameters: We tune hyperparameters of FLAL using grid search. We optimize our
model using Adam optimizer with a learning rate of 0.0001, L2 normalization weight on model
weights 0.001. We select loss function weights 1, 2, and 3 from {0.0, 0.5, 1.0} (See Section
4.5). In our experiments,  is set to 127 (the length of the multivariate time series data becomes
128 with the current snapshot) and the embedding size  is 128. We set  to 10 and 20 for
diferent runs. The number of recommended items is also set to Q.</p>
          <p>Evaluation metrics: Since the real evaluation can only consider feedback from the
recommended entities, we compare precision metrics in our experiments. At each round, we calculate
precision@Q and average precision@Q.</p>
        </sec>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Performance</title>
        <p>Figure 6 shows precision@Q and average precision@Q, where Q is 10 and 20. We calculate
a cumulative average of precision performance at each step. Note that this performance will
reflect improved AI decision system performance since we use the user’s interest/expertise
label as a ground truth decision. Our method, Feedback Loop Active Learner, outperforms
the competing baselines at all reported metrics, especially after 10-20 steps. Another essential
requirement of learning human interest is convergence speed. FLAL converges in around 50
steps, faster than the best baseline Random Forest Active Learner.</p>
        <p>Notice that the precision performance of the AI Decision System is not enough. However,
active learner mechanisms improve the performance of the decision system drastically, while
random decisions are still worse than the original AI decision system. Another notable
diference between  = 10 and  = 20 is in precision@Q performance. When  = 20, the
performance drops below 0.6. However, this essentially could happen because the number of
anomalies in the data is hardly more than 12 (i.e., 20 × 0.6) at a certain time. This shows us that
we should optimize the number of recommended entities based on the number of anomalies
at every step instead of using the same values as the budget of . The average precision is
less vulnerable to this issue since the leading zeros do not afect the result. For both , the
performance is close to each other.
Random</p>
        <p>AI Decision System</p>
        <p>Random Forest Active Learner</p>
        <p>Feedback Loop Active Learner
0.1
0
50
100
150
250
300
350
0
50
100
150
250
300
350</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Diferent User Embedding Mapper</title>
        <p>1.0
0
10.8
=
Q
@
iion0.6
s
c
e
r
P0.4
e
g
a
r
ve0.2
A
0.0
1.0
0
20.8
=
Q
@
n
io0.6
s
i
c
e
r
P
e0.4
g
a
r
e
v
A0.2
0.1
Identity
Linear
NonLinear
Non-Linear2
0
50
100
150
250
300
350
0
50
100
150
250
300
350
0.1
0.8
0.7
1.0
0.8
0.7
0.6
0.5
0.4
0.3</p>
      </sec>
      <sec id="sec-4-5">
        <title>4.5. Loss Function Term Sensitivity</title>
        <p>Figure 8 shows a sensitivity analysis on objective function terms for the Machine dataset.
Each block represents the last step cumulative average of precision@10 scores from FLAL
parameterized by diferent 1,2,3 values. All terms contribute to the performance, while the
absence of the first term (i.e., 1 = 0) makes the model performance very bad. This behavior
is expected since the first term is the core part of the contrastive loss. The second term is not
efective as the first term for the Machine dataset, but still increasing the value of 2 makes
the performance better. The third term has a similar efect as the second term. They both aim
to narrow the positive and negative sample rankings. The best performance is achieved when
hyperparameters are equal to 1, or 1 = 1, 2 = 0.5, and 3 = 0.5.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion and Future Works</title>
      <p>We investigate better and more efective ground truth generation by incorporating
recommendation systems into AI decision systems and human collaboration for entity-based time-series
data. We propose FLAL understanding the expertise and interest of a human over queries to
make feedback more eligible and accurate using active learning. FLAL trains a personalized
embedding mapper; uses features extraction and AI system decisions to solve the cold-start
problem of recommender systems. FLAL performs better than competing baselines: random
forest active learners, AI decision-based, and random recommenders; and it converges fast.
Furthermore, our ablation studies show that the linear user embedding mapper is learning
enough information and each term in the objective function contributes to the result.</p>
      <p>In future work, we want to investigate this problem using diferent datasets and our proposed
user simulation setting. We also desire to conduct human experiments to show the efectiveness
of FLAL in real settings. Furthermore, we will optimize the number of recommendations instead
of using it as the budget .
1–15</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>The work was done when Mert Kosan was an intern at Visa Research.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>K.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. R.</given-names>
            <surname>Chua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. Y.</given-names>
            <surname>Ngiam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. C.</given-names>
            <surname>Ooi</surname>
          </string-name>
          ,
          <article-title>Tracer: A framework for facilitating accurate and interpretable analytics for high stakes applications</article-title>
          ,
          <source>in: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>1747</fpage>
          -
          <lpage>1763</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>C.</given-names>
            <surname>Rudin</surname>
          </string-name>
          ,
          <article-title>Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead</article-title>
          ,
          <source>Nature Machine Intelligence</source>
          <volume>1</volume>
          (
          <year>2019</year>
          )
          <fpage>206</fpage>
          -
          <lpage>215</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kosan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Silva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Medya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Uzzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <article-title>Event detection on dynamic graphs</article-title>
          ,
          <source>arXiv preprint arXiv:2110.12148</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kosan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Medya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ranu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <article-title>Global counterfactual explainer for graph neural networks</article-title>
          ,
          <source>arXiv preprint arXiv:2210.11695</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sef</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kornhauser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Xiao</surname>
          </string-name>
          ,
          <article-title>Deepdriving: Learning afordance for direct perception in autonomous driving</article-title>
          ,
          <source>in: Proceedings of the IEEE international conference on computer vision</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>2722</fpage>
          -
          <lpage>2730</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>T.</given-names>
            <surname>Stevens</surname>
          </string-name>
          ,
          <article-title>Knowledge in the grey zone: Ai and cybersecurity</article-title>
          ,
          <source>Digital War</source>
          <volume>1</volume>
          (
          <year>2020</year>
          )
          <fpage>164</fpage>
          -
          <lpage>170</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Liao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Smith-Renner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <article-title>Towards a science of human-ai decision making: a survey of empirical studies</article-title>
          ,
          <source>arXiv preprint arXiv:2112.11471</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>X.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Xiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , T. Ma,
          <string-name>
            <given-names>L.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <article-title>A survey of human-in-the-loop for machine learning</article-title>
          ,
          <source>Future Generation Computer Systems</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bobadilla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ortega</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hernando</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gutiérrez</surname>
          </string-name>
          ,
          <article-title>Recommender systems survey</article-title>
          ,
          <source>Knowledge-based systems 46</source>
          (
          <year>2013</year>
          )
          <fpage>109</fpage>
          -
          <lpage>132</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tay</surname>
          </string-name>
          ,
          <article-title>Deep learning based recommender system: A survey and new perspectives, ACM Computing Surveys (CSUR) 52 (</article-title>
          <year>2019</year>
          )
          <fpage>1</fpage>
          -
          <lpage>38</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <article-title>A survey on modern recommendation system based on big data</article-title>
          ,
          <source>arXiv preprint arXiv:2206.02631</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>R.</given-names>
            <surname>Sabitha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vaishnavi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Karthik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bhavadharini</surname>
          </string-name>
          ,
          <article-title>User interaction based recommender system using machine learning</article-title>
          ,
          <source>Intelligent Automation and Soft Computing</source>
          <volume>31</volume>
          (
          <year>2022</year>
          )
          <fpage>1037</fpage>
          -
          <lpage>1049</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>R. M. Monarch</surname>
          </string-name>
          ,
          <article-title>Human-in-the-Loop Machine Learning: Active learning and annotation for human-centered AI, Simon</article-title>
          and Schuster,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <surname>X.</surname>
          </string-name>
          <article-title>Anthony'Chen, Human-centered ai for medical imaging, Artificial Intelligence for Human Computer Interaction: A Modern Approach (</article-title>
          <year>2021</year>
          )
          <fpage>539</fpage>
          -
          <lpage>570</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>H.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Suárez-Paniagua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Whiteley</surname>
          </string-name>
          , H. Wu,
          <article-title>Explainable automated coding of clinical notes using hierarchical label-wise attention networks and label embedding initialisation</article-title>
          ,
          <source>Journal of biomedical informatics 116</source>
          (
          <year>2021</year>
          )
          <fpage>103728</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>T.</given-names>
            <surname>Dash</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chitlangia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ahuja</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Srinivasan</surname>
          </string-name>
          ,
          <article-title>A review of some techniques for inclusion of domain-knowledge into deep neural networks</article-title>
          ,
          <source>Scientific Reports</source>
          <volume>12</volume>
          (
          <year>2022</year>
          )
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-W.</given-names>
            <surname>Chiu</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.-Y.</given-names>
            <surname>Su</surname>
          </string-name>
          , S.-T. Huang,
          <article-title>Towards model-informed precision dosing with expert-in-the-loop machine learning</article-title>
          ,
          <source>in: 2021 IEEE 22nd International Conference on Information Reuse and Integration for Data Science (IRI)</source>
          , IEEE,
          <year>2021</year>
          , pp.
          <fpage>342</fpage>
          -
          <lpage>347</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>C.</given-names>
            <surname>Chandler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. W.</given-names>
            <surname>Foltz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Elvevåg</surname>
          </string-name>
          ,
          <article-title>Improving the applicability of ai for psychiatric applications through human-in-the-loop methodologies</article-title>
          , Schizophrenia
          <string-name>
            <surname>Bulletin</surname>
          </string-name>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tao</surname>
          </string-name>
          ,
          <article-title>Deep reinforcement active learning for human-inthe-loop person re-identification</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF international conference on computer vision</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>6122</fpage>
          -
          <lpage>6131</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>S.</given-names>
            <surname>Budd</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. C.</given-names>
            <surname>Robinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Kainz</surname>
          </string-name>
          ,
          <article-title>A survey on active learning and human-in-the-loop deep learning for medical image analysis</article-title>
          ,
          <source>Medical Image Analysis</source>
          <volume>71</volume>
          (
          <year>2021</year>
          )
          <fpage>102062</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>G.</given-names>
            <surname>Shani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gunawardana</surname>
          </string-name>
          ,
          <article-title>Evaluating recommendation systems</article-title>
          ,
          <source>in: Recommender systems handbook</source>
          , Springer,
          <year>2011</year>
          , pp.
          <fpage>257</fpage>
          -
          <lpage>297</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>M.</given-names>
            <surname>Zehlike</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Stoyanovich</surname>
          </string-name>
          ,
          <article-title>Fairness in ranking, part ii: Learning-to-rank and recommender systems</article-title>
          ,
          <source>ACM Computing Surveys (CSUR)</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          , et al.,
          <article-title>Explainable recommendation: A survey and new perspectives</article-title>
          ,
          <source>Foundations and Trends® in Information Retrieval</source>
          <volume>14</volume>
          (
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <lpage>101</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>H</surname>
            .-T. Cheng, L. Koc,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Harmsen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Shaked</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Chandra</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Aradhye</surname>
            ,
            <given-names>G.</given-names>
            Anderson, G.
          </string-name>
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Chai</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Ispir</surname>
          </string-name>
          , et al.,
          <article-title>Wide &amp; deep learning for recommender systems</article-title>
          ,
          <source>in: Proceedings of the 1st workshop on deep learning for recommender systems</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>7</fpage>
          -
          <lpage>10</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Wang</surname>
          </string-name>
          , D.-Y. Yeung,
          <article-title>Collaborative deep learning for recommender systems</article-title>
          ,
          <source>in: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>1235</fpage>
          -
          <lpage>1244</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Kazemi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Goel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Jain</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Kobyzev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sethi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Forsyth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Poupart</surname>
          </string-name>
          ,
          <article-title>Representation learning for dynamic graphs: A survey</article-title>
          .,
          <source>J. Mach. Learn. Res</source>
          .
          <volume>21</volume>
          (
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <lpage>73</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>E.</given-names>
            <surname>Eldele</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ragab</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. K.</given-names>
            <surname>Kwoh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Guan</surname>
          </string-name>
          ,
          <article-title>Time-series representation learning via temporal and contextual contrasting</article-title>
          ,
          <source>arXiv preprint arXiv:2106.14112</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Kazemi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Goel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Eghbali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ramanan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sahota</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Thakur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Smyth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Poupart</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Brubaker, Time2vec: Learning a vector representation of time</article-title>
          , arXiv preprint arXiv:
          <year>1907</year>
          .
          <volume>05321</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <surname>J.-Y. Franceschi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Dieuleveut</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Jaggi</surname>
          </string-name>
          ,
          <article-title>Unsupervised scalable representation learning for multivariate time series</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>32</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>G.</given-names>
            <surname>Zerveas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jayaraman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Patel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bhamidipaty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Eickhof</surname>
          </string-name>
          ,
          <article-title>A transformer-based framework for multivariate time series representation learning</article-title>
          ,
          <source>in: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &amp; Data Mining</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>2114</fpage>
          -
          <lpage>2124</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Niu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Pei</surname>
          </string-name>
          ,
          <article-title>Robust anomaly detection for multivariate time series through stochastic recurrent neural network</article-title>
          ,
          <source>in: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery &amp; data mining</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>2828</fpage>
          -
          <lpage>2837</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>