<!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>
      <journal-title-group>
        <journal-title>Vancouver,
BC, Canada, October</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>A Hybrid Health Journey Recommender System using Electronic Medical Records</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Soheil Jamshidi</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ali Torkamani</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jynelle Mellen</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Malhar Jhaveri</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Penny Pan</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>James Chung</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hakan Kardes Cambia Health Solutions Portland</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>firstName}.</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>lastName}@cambiahealth.com</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <volume>6</volume>
      <issue>2018</issue>
      <abstract>
        <p>We present a recommender system aimed at improving the healthcare experience of consumers. Our model provides actionable insights to cohorts or individuals, based on their collective and personal healthrelated data. The actionable insights are delivered through digital interventions to help prevent adverse events for the consumer. By proposing timely and personalized suggestions, we will improve consumer health outcomes and prevent complications, which would also result in cost-savings. Our recommendation system employs an ensembling technique, where at its core, we have a Bayesian network that uses administrative claims data but could be extended to use Electronic Health Records (EHR) data for learning the structure of the interwoven health graph (conditions, medications, procedures, and more). This method allows for predicting the probability of various outcomes conditioned on the consumers' evidential health data. We also couple our ensemble method with a shallow random forest model to further refine the personalized recommendations after receiving the consumer's feedback. The experimental results show that our system significantly improves the precision-recall metrics of several intervention targets compared to a random baseline.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>CCS CONCEPTS</title>
      <p>• Applied computing → Consumer health; Health care
information systems; • Information systems → Recommender systems;</p>
    </sec>
    <sec id="sec-2">
      <title>INTRODUCTION</title>
      <p>
        Availability of clinical data in form of Electronic Health Records
(EHR) has dramatically increased over the past decade. In addition
to EHRs, there are large volumes of administrative payment data that
HealthRecSys’18, October 6, 2018, Vancouver, BC, Canada
© 2018 Copyright for the individual papers remains with the authors. Copying permitted
for private and academic purposes. This volume is published and copyrighted by its
editors.
offer insights to researchers. However, administrative data and EHRs
are scattered among numerous entities and sources, such as health
plans, laboratories, providers, hospitals, chart notes, and more. In
addition to the disparate sources, the breadth, depth, linkage, and scale
of the data lead to further complexity. For end-users (consumers) it
can make interpretation difficult due to information overload or a
lack of information, as well as term inconsistency. The increasing
need to leverage the health records led to the presence of Health
Recommender Systems (HRS) [
        <xref ref-type="bibr" rid="ref13 ref4">4, 13</xref>
        ]. Such recommender systems
can target medical experts or patients and play a vital role in
improving an individual’s health by providing insightful recommendations.
These systems are primarily created to handle ambiguous diagnosis
situation because of the varied decisions of providers [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] for certain
diseases. In that case, recommenders created by medical specialists
provide insight for tailored diagnosis procedure for patients. To this
aim, Machine Learning (ML) methods act as enablers. There has
been a large number of studies on a wide range of machine learning
techniques - such as decision trees, multi-layer perceptron (MLP),
support vector machine (SVM) - that has been focused on a variety
of diseases - dementia, kidney, and heart diseases to name a few
[
        <xref ref-type="bibr" rid="ref1 ref10 ref14 ref15 ref16 ref18 ref2 ref3">1–3, 10, 14–16, 18</xref>
        ].
      </p>
      <p>
        In this paper, we present a consumer-focused recommender
system that will give individuals suggestions based on their collective
health-related data (EHR and claims). To accomplish this, we
leverage an ensemble algorithm, where a Bayesian network (BN) is
combined with a random forest (RF). Probabilistic Graphical
Models such as BN are known to tolerate the data uncertainty (noise,
ambiguity, and missing values) in a consistent and mathematically
correct way [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] in inference phase and RF facilitates refining the
personalized recommendations after receiving the consumer’s
feedback. Such a system learns the conditional probability table using
maximum entropy or belief propagation approach on large datasets
derived from over a million records with thousands of diagnoses and
ifndings, and over a hundred variables. Medical and pharmacy claims
in combination with laboratory results, nurse notes, and consumer
data form a substantially powerful aggregated dataset that can be
used to train a model that offers actionable recommendations. This
recommendation system can serve a variety of health-related
applications (cost predictions and engagement modeling for example) or
can be presented as a product to the market.
      </p>
      <p>The structure of the remaining paper is as follows. Section 2
introduces the features of the data. Section 3 demonstrates the methods
used for learning and inference. Section 4 explains the technical
details of our graphical model. We discuss the experimental results
in Section 5. Then, in Section 6 we review the existing techniques</p>
      <p>Male
Female
and studies. We conclude the paper with a discussion and an outline
of the directions for further research in Section 7.
2</p>
    </sec>
    <sec id="sec-3">
      <title>NATURE OF DATA</title>
      <p>The dataset used in our recommender system is largely derived from
the claim data with over 1.5 million claims and over a hundred
distinct attributes over a 6 year period.</p>
      <p>Available attributes can be grouped as numerical and categorical
attributes. For example, consumer gender has two states, male and
female. Figure 1 illustrates that more than 55% of our target group
are women. We divided Age into twelve bins as follows: ≤1, 1-4,
5-12, 13-17, 18-25, from 26 to 85 in 10-year bins, and ≥86. It was
confirmed by domain experts that patients in these age ranges
generally develop similar conditions. The distribution of the number of
consumers per age bin is shown in Figure 2. The claim records cover
4 types of data sources: dental, medical, hospital. As it is shown
in Figure 3, 65% of the claims are related to medical claims. We
term the observed data, the manifests. The manifests are computed
as aggregations based on meaningful categories. For each manifest,
there is an integer count ≥ 0 that signifies the number of times a
person had the event in a quarter. Currently, our system only relies
on 4 major categories; drug classification, diagnosis classification,
providers specialty, and service category. Finally, since each patient
is associated with many records (claims) we aggregated records of
each patient by calendar quarters (as suggested by domain experts
to be the most relevant time frame to capture related health events).
However, our system can be used for different time granularities.
3</p>
    </sec>
    <sec id="sec-4">
      <title>METHODOLOGY</title>
      <p>We rely on a hybrid approach leveraging Probabilistic Graphical
Models (PGM), Random Forest (RF), and Collaborative Filtering
(CF) technique to obtain a vector of recommendations and combine
the results using an ensembler. This way, we benefit from the power
of PGMs in capturing the propagation of effects, CF in considering
the similar situations, and RFs targeting tailored recommendations.
Our proposed framework is illustrated in Figure 4 where data from
different sources is fed into analysis block where we train and use
our models. The output is a list of recommendations delivered via a
mobile application. Based on the feedback we gather from the users
(consumers, providers, etc.) on the quality of the recommendations,
we can optimize the weights of the ensembler. In this study, we focus
only on the green boxes, PGM and RF and the rest will be touched
in our future works.</p>
      <p>PGMs can handle large datasets in a computationally tractable
manner. We leverage a Bayesian network on a Directed Acyclic Graph
(DAG). Before learning the conditional probabilities of the network,
we found it useful to transform the data in a way that each patient
observation corresponded to the manifests exhibited in a quarter,
which is long enough to cover a sequence of symptoms, that let us
focus on a less noisy sequence of healthcare events. We consider
populating the data for the immediate previous quarter and the next
quarter for every quarter in our dataset, and hence there are triple of
the observations (or rows) for any given patient.
Given the transformed data, we can translate the questions to the
following prediction/inference problem: Let a patient with a total of
N features (manifests) including his/her medical tests, drugs, health
events, and other manifests related to a period, the previous period
and the next period. If we observe x features out of these N features,
can we predict the values (or the probability distributions) of the
remaining N −x features based on the available historical data. Using
this data as input we learn the structure and create the model. The
steps involved are as follows:
First, to derive a joint probability distribution table, we transformed
the input matrix to a discrete form with 0, 1 states. The input data
had the number of times a manifest was observed for a patient in
a given quarter. If this value was non-zero, we replaced it with a 1.
The matrix now represents if the manifest occurred at least once in
the period.</p>
      <p>Then, we convert the matrix to have manifests observed in a quarter
along with manifests observed in the next and previous quarters.
This transformation provided us with the data structure with which
we could predict or infer manifests of a quarter given those from
another quarter.
We consider the data as a matrix A. Then, we find AT × A where
AT represents the transpose of A. The resulting symmetric matrix B
has the number of joint occurrences of manifests across all patients.
The diagonals in this matrix represent the number of occurrences
of the manifest for all of the patients. Dividing the row values by
the diagonal value in the row resulted in the conditional probability
of the column manifest, given the row manifest, P (M R, MC) where
P (M R)
MR is the manifest in the row, MC is the manifest in the column,
resulting in P (MC |MR). As expected, all the diagonals reduce to 1,
and the resulting matrix is no more symmetric.</p>
      <p>To determine the significant relationships and to discard those
that were not as significant, we set a threshold of 0.05 (5%) for
the conditional probability. If a conditional probability was greater
than 5% we retain it. This choice of threshold was arbitrary, and
as an improvement, we should consult with our domain experts to
verify the structure and adjust accordingly. Each relationship with
a conditional probability above the threshold represents a directed
edge in a graph, with the arrow going from the row manifest to
the column manifest. Then, we remove cyclic relationships (the
diagonal entries because Bayesian model does not allow loops)
using the networkX python library. This function detects cycles on a
ifrst-come basis and removes the last encountered edge once a cycle
is detected. These edges form a DAG structure.</p>
      <p>The fit function estimated the Conditional Probability
Distribution (CPD) for each variable based on the given data and the
parameter estimation approach we use. In our case, we use the
Bayesian parameter estimation because it considers the probability
distribution representing our prior knowledge (how likely are we to
believe in the different choices of parameters) and the support of the
data (because confidence increases with more data). Moreover, our
prior distribution is not uniform and hence this is also a reason to
use Bayesian parameter estimation. Since our aim is to predict the
values of an unknown manifest we fit the model with the training
data set. At this step, the given data in graphical form was ready for
performing various types of reasoning.
3.2</p>
    </sec>
    <sec id="sec-5">
      <title>Hybrid Scoring</title>
      <p>As shown in Figure 4, we use multiple models to obtain the final
recommendation. One approach is to apply weighted ensemble
methods to obtain better predictive performance than could be obtained
from each of these models independently. The final
recommendations can be used for a wide range of applications. Here, we focus
on a Mobile App that provides health-care benefit or educational
recommendations. For example, if a high probability of hypertension
is predicted, then the App would recommend that the person visits
his/her Primary Care Physician (PCP).
3.3</p>
    </sec>
    <sec id="sec-6">
      <title>Feedback loop</title>
      <p>Feedback is a valuable asset for personalizing the recommendations
as well as making better recommendations to similar people. The
feedback loop can directly contribute to updating the weight vector
of the ensemble method, as well as hyperparameter tuning of the
individual models. In fact, we need an online learning algorithm
to incorporate the feedback into the re-training phase. However,
not every feedback or data observation has the same
weight/quality. Therefore, we need to consider a context-aware algorithm to
pay more attention to the more important segments of information.
Attention modeling will be done as a part of our future work.
4</p>
    </sec>
    <sec id="sec-7">
      <title>TECHNICAL DETAILS</title>
      <p>In this section, we briefly review the technical aspects of our Bayesian
network and how parameter learning methods are used to estimate
the conditional probabilities for the given set of claims and predict
the state or occurrence of a new set of claims.
4.1</p>
    </sec>
    <sec id="sec-8">
      <title>Bayesian Network</title>
      <p>Bayesian network (BN) is a probabilistic graphical model (PGM)
that represents a set of random variable (nodes) say X1, ....., Xn
and their conditional dependencies (edges corresponding to direct
influence of one node on another), say X1 ⊥⊥ X3 |X 6, using a directed
acyclic graph (DAG). By surfacing these independencies we can
reduce the number of values needed to be stored in order to represent
the joint probability distribution and thus makes the representation
more compact.</p>
      <p>For our purpose, we use two layers of inference: structure and
parameter learning. By leveraging structure inference, we create
the skeleton using conditional probabilities and domain expert input
which captures the dependencies between the variables. The second
layer utilizes the dependencies and historical data to estimate the
conditional probability distributions of the individual variables.</p>
      <p>In parameter learning, there are two main methods:
• Maximum likelihood estimation
• Bayesian estimation
We use Bayesian estimation over maximum likelihood estimation
(MLE) because MLE considers a uniform prior distribution and this
might lead us to end up in wrong conclusions about the likelihood of
a variable θXi and adjust the likelihood based on whether the sample
is biased or not. Also, MLE does not update the confidence of θXi
with the change in the size of the data (450,000 out of 1,000,000
vs 45 out of 100). Thus, in Bayesian estimation, we use the prior
knowledge about θ with its probability distribution. This
distribution will represent how likely we believe the different choices of
parameters. Therefore, we can create a joint distribution, which
captures the assumption over the parameters θ and the data we are to
observe. Each new data point gives us more information about θ and
hence the probability of the next occurrence. Hence the posterior
distribution for Bayesian estimation is:</p>
      <p>
        Pr(θ |x [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], .., x [M]) =
      </p>
      <p>
        Pr(x [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], .., x [M]|θ ) Pr(θ )
      </p>
      <p>
        Pr(x [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], .., x [M])
(1)
4.2
      </p>
    </sec>
    <sec id="sec-9">
      <title>Inference</title>
      <p>Finding the conditional probability distribution (CPD) over some
variables Pr(Y |E = e) is the same as inferring from a model.
Therefore, predicting values for a new data point is the same as finding
the conditional probability of the unknown variables, given the
observed values of other variables. The CPDs can be computed from
the joint probability distribution of the variables, by marginalizing
and reducing them over variables and states.</p>
      <p>In addition, we are interested in finding the state of a set of
variables given other set of variables. It is simply an inference query
over the model and state having higher probability would be the
prediction by the model. However, computing the joint probability
distribution will give us an exponentially large table, which the
probabilistic graphical model helps to avoid these tables. There are
two algorithms we can use for inference:
and vision benefits, respectively. In each figure, the expected result
from a random guess - based on the frequency of the positive class
that is 27.38% (4.66%) for dental (vision) benefit - is also depicted.
• Variable elimination
• Belief propagation
We use variable elimination over belief propagation since the former
is suitable for a very large network as it is not memory-expensive. In
addition, we discard the generated intermediate factors and hence it
is more flexible than BP. In variable elimination, consider the model
A → B → C → D and we try to find Pr(D):</p>
      <p>Pr(D) =
Õ</p>
      <p>Pr(a) Pr(b |a) Pr(c |b) Pr(D |c)
In variable elimination, we can sum over parts of the product instead
of over the complete product. Hence, Eq. (2) becomes:
Pr(D) =</p>
      <p>Pr(a) Pr(b |a) Pr(c |b) Pr(D |c) =
This method helps to significantly reduce the computation required to
compute the probabilities. Hence variable elimination is much more
efficient for calculating probability distributions than normalizing
and marginalizing the joint probability distribution.</p>
      <p>Our prediction function uses a maximum a posteriori probability
to find the states of variables corresponding to the maximum
probability in the joint distribution. This is useful when we want to predict
the state of variables in our model. Moreover, we introduce another
operation on factors called maximization. Maximum a posteriori
query is essentially a way to predict the state of variables, given
the state of other variables. Thus, using the trained model, we try
to predict the states of variables for new data points. To design the
models, we need to create conditional probability distributions or
factors, add them to the base model, create an inference object, and
then do maximum a posteriori queries over it for new data points to
predict variable states.
5</p>
    </sec>
    <sec id="sec-10">
      <title>EXPERIMENTAL RESULTS</title>
      <p>While our un-targeted Bayesian network based recommender system
can be leveraged to address a wide range of questions, in some cases
a targeted model (such as a random forest) can be more beneficial.
In our proposed framework depicted in Figure 4, we have included
both components. To assess the abilities of our recommender system,
we focus on recommendations of vision and dental benefits and train
the random forest model on the same dataset and set of features that
we trained our probabilistic graphical model and discuss the results
in this section.</p>
      <p>We trained the RF model using the default parameteres except for
the followings: n_estimators=30,max_depth=350, random_state=0,
and min_samples_leaf =2. Before fitting the data to the model we
split the data into random train and test set in 80:20 ratio (widely
recommended split ratio). The test set does not contain the
columns/manifests that we are interested in predicting. The shape of the data
used was 2,010 cases with around 1.5K features. We used a subset
of the data set because of the constraint in the computational power.
Figure 5 and Figure 6 illustrate the Precision-Recall ROC for dental
70
60
n
o
i
isc50
e
r
P
40
30
80
70
60
iion50
s
rce40
P
30
20
10</p>
      <p>PR-ROC for Dental benefits</p>
      <p>Model Scores</p>
      <p>Random Guess
20
40
60
80</p>
      <p>100</p>
      <p>Recall
PR-ROC for Vision benefits</p>
      <p>Model Scores
Random Guess</p>
      <p>Using the trained Bayesian network, we predicted the states of
all the missing columns/features of the test set. Prediction is done
by belief propagation where we find the most probable state of the
unknown manifests/features given the states of the other
manifests/features using CPD’s. Fig 7 shows the correlation of manifests
related to a specific target (Diabetes mellitus without complication,
in the next quarter) and their pairwise correlations considering two
consecutive quarters. As expected, having Diabetes mellitus without
complication and taking antidiabetics in the previous quarter have
a strong correlation with having it in the next quarter. Interestingly,
the correlation between hypertension, the disorder of lipid, and high
Glucose in blood are also captured by our model.</p>
      <p>The probabilities gathered from our Bayesian network can be
represented as a network. In Fig 8 the most probable manifests in
the previous quarter that can be used to predict whether the
consumer will visit an optimetrist are depicted as a network where edge
DM.w.o.C._NXT</p>
      <p>DM.w.o.C.</p>
      <p>ANTIDIABETICS</p>
      <p>METFORMIN HCL
Essential hypertension</p>
      <p>GLUCOSE BLOOD
DIAGNOSTIC PRODUCTS</p>
      <p>Disorders of lipid
Other aftercare
DME SUPPLIER</p>
      <p>DME</p>
      <p>Med. Devices</p>
      <p>General Medicine
LaboIrNaStoUrLyI N-OGuLtApRaGtiIeNnEt
1.0
thickness, shows the prevalence of manifests related to a specific
target. As shown, those who had more medical interactions (surgery,
medicines, ofcfie visit, etc.) are more probable to have optometry
event in their medical journey.</p>
    </sec>
    <sec id="sec-11">
      <title>6 EXISTING TECHNOLOGIES</title>
      <p>
        Health-care domain has specific characteristics and requirements
that can not be addressed by general purpose or commercial
recommender systems that are available in other domains (such as ones
used in Netflix or Amazon) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Recommender systems for clinical
activities have no specific task and it mainly depends on the item
that is recommended. All of the possible items are expected to be
recommended. Rating system does not exist and most clinical
behaviours are binary (have a symtom or not). Compare to the general
recommender systems with specific and well defined tasks, subset
of items can be recommended, rating system exists due to
subjective desire and behavior is not binary as a customer may refuse to
buy but it does not indicate she does not like the product. However,
similar to other domains, machine learning methods have a clear
advantage over manual inspection of data. Health domain is volatile
and dynamic, machine learning methods can tolerate the changes in
medical codes due to easier retraining process compare to manually
pattern recognition, robust against temporal changes of patterns
using a sliding window approach for learning, and can offer
personalized experience per hospital or patient at the same time having a
general view of the whole system.
      </p>
      <p>
        To design a framework/system, it is necessary to know the target
users. Two main end users can be considered for healthcare
recommender systems. Wiensner and Pfeifer [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ] suggest that such
systems can target health professionals (doctors and/or nurses) to
help them gather additional information on a special case, or can
identify patients as end user and deliver health-related content to
them, such as lifestyle change recommendation [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] through changing
their sleeping, eating, and exercising routines and improving patient
safety [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] and lowering health risks through informing them about
interactions between different drugs. Policy makers are also another
target for in this domain.
      </p>
      <p>
        To design such a system, there are several guidelines. Valdez et al.
propose a 3-step process [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] to design a recommender system: 1)
understanding the domain, 2) Evaluation , and 3) Inception. In the
evaluation step, the importance of user-centered criteria and ethical
implications (trust, value, security, long-term efficiency, individual
freedom, and risk) in addition to accuracy metrics are discussed.
Schafer et al. discuss the recent challenges that were tackled by the
researchers and how to proceed toward a health aware recommender
system. Personalization, the balance between persuasion and
empowerment, and user trust and satisfaction are the main issues that
captured researchers attention [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. They group the challenges for
future studies into 3 groups of Patient, recommender systems, and
evaluation challenges. User modeling and profiling, Data
integration and cleaning from multiple sources are the main patient-related
challenges. On the recommender system side, personalized and
accurate recommendation along with step by step implementation of
recommendations using the “expert-in-the-loop" interactions. On
the evaluation side, the accuracy, real-life performance, ethical, and
privacy considerations are discussed.
      </p>
      <p>
        There has been a number of prior efforts in this domain. One of
the well known existing application is Promedas [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], a medical
patient-specific clinical diagnostic decision support system, that uses
a probabilistic graphical model built with the help of medical
specialists. As discussed earlier, they help in recommending a diagnosis
specific to an individual when there is a ambiguity among
physicians without rationalization. Probabilistic methods and especially
Bayesian networks have been used in a wide range of domains. For
example, Huang [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] used the Bayesian network in response to two
issues in the tourism domain. First, the absence of travel history for a
single user to use a content-based activity estimation and the second
is the absence of similarity between users and other users.
Since our system predicts multiple targets simultaneously, for each
person, certain combinations of the outputs will be more likely that
the other combinations. To address this fact, we adopted a
structured prediction based approach that uses collective classification
in its core by considering the associativity of targets as nodes in a
graph [
        <xref ref-type="bibr" rid="ref20 ref24">20, 24</xref>
        ]. This model captures dependencies that would not
be considered otherwise [
        <xref ref-type="bibr" rid="ref21 ref7">7, 21</xref>
        ]. At the same time, the consumers’
feedback plays a vital role in fine-tuning and improving the
performance of the recommender systems. However incorporating the
users’ feedback is challenging, the system can also be exposed to
bias due to personal taste or motivations as was shown in other
domains such as Amazon or application markets [
        <xref ref-type="bibr" rid="ref12 ref27">12, 27</xref>
        ]. Therefore,
we incorporated robust approaches similar to Torkamani et al. and
Fakhraei et al. [
        <xref ref-type="bibr" rid="ref12 ref21 ref22 ref6">6, 12, 21, 22</xref>
        ]. We also need to tackle the imposes
computational complexity to the system, if the goal is to update the
system’s state on the fly in real time. For which, we can consider
using updating schemes that have been used in similar domains to
reduce the updating costs [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>Given all the efforts have been done in this domain, our model uses
a large and rich dataset and relies on a mathematically correct and
proved basis and is able to address a wide range of different questions
about the health journey of consumers, beneficial for consumers,
providers, and payers over time.
7</p>
    </sec>
    <sec id="sec-12">
      <title>CONCLUSION</title>
      <p>Our proposed recommender system provides personalized, timely
and actionable health-care insights for consumers. We make
relevant suggestions by predicting the probabilities of various health
events. By deploying users’ feedback from their interactions within
the mobile application, we enable additional personalized
suggestions. This is accomplished through an ensemble algorithm, where a
Bayesian network is combined with a random forest. In the future,
we can improve this framework in several ways. First, by
including data from other sources, such as lab results or nurse notes, we
can expand the feature set to provide a more complete view of the
consumer. This view would improve the precision-recall metrics of
the predictions, as well as shed a brighter light on how to increase
the effectiveness of the recommendations. Second, while a calendar
quarter is currently the feature extraction and prediction time unit,
we can change this within the probability model to predict the timing
of a health event (as an additional random variable). We could also
expand the model to capture a longer period of health care history to
identify missing values over time, which would lead to the discovery
of long-term influences, such as chronic ailments. Finally, for both
better interpretability and overall improvement of the recommender
system, we are working on a context-aware attention modeling
algorithm to identify, invigorate, and use the most relevant features
extracted from the health data and received feedback.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Pragati</given-names>
            <surname>Agrawal</surname>
          </string-name>
          and Amit kumar Dewangan.
          <year>2015</year>
          .
          <article-title>A brief survey on the techniques used for the diagnosis of diabetes-mellitus</article-title>
          .
          <source>Int. Res. J. of Eng. and Tech. IRJET 2</source>
          (
          <year>2015</year>
          ),
          <fpage>1039</fpage>
          -
          <lpage>1043</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>PK</given-names>
            <surname>Anooj</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Clinical decision support system: Risk level prediction of heart disease using weighted fuzzy rules</article-title>
          .
          <source>Journal of King Saud University-Computer and Information Sciences</source>
          <volume>24</volume>
          ,
          <issue>1</issue>
          (
          <year>2012</year>
          ),
          <fpage>27</fpage>
          -
          <lpage>40</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Pushkaraj</surname>
            <given-names>R Bhandari</given-names>
          </string-name>
          , Sapna P Yadav, Shyam A Mote, Devika P Rankhambe, UG Scholar, and Pune APCOER.
          <year>2016</year>
          .
          <article-title>Predictive system for medical diagnosis with expertise analysis</article-title>
          .
          <source>International Journal of Engineering Science</source>
          <volume>4652</volume>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Amy</given-names>
            <surname>Compton-Phillips</surname>
          </string-name>
          . [n. d.].
          <article-title>Care Redesign - What Data Can Really Do for Health Care</article-title>
          . http://join.catalyst.nejm.org/hubfs/Insights% 20Council%
          <fpage>20Monthly</fpage>
          %
          <fpage>20</fpage>
          -%
          <source>20Files/Insights%20Council%20March% 202017%20Report%20What%20Data%20Can%20Really%20Do%20for% 20Health%20Care.pdf</source>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Lian</given-names>
            <surname>Duan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W Nick</given-names>
            <surname>Street</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E</given-names>
            <surname>Xu</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Healthcare information systems: data mining methods in the creation of a clinical recommender system</article-title>
          .
          <source>Enterprise Information Systems 5</source>
          ,
          <issue>2</issue>
          (
          <year>2011</year>
          ),
          <fpage>169</fpage>
          -
          <lpage>181</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Shobeir</given-names>
            <surname>Fakhraei</surname>
          </string-name>
          , James Foulds, Madhusudana Shashanka, and
          <string-name>
            <given-names>Lise</given-names>
            <surname>Getoor</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Collective spammer detection in evolving multi-relational social networks</article-title>
          .
          <source>In Proceedings of the 21th acm sigkdd international conference on knowledge discovery and data mining. ACM</source>
          ,
          <volume>1769</volume>
          -
          <fpage>1778</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Shobeir</given-names>
            <surname>Fakhraei</surname>
          </string-name>
          , Bert Huang,
          <string-name>
            <given-names>Louiqa</given-names>
            <surname>Raschid</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Lise</given-names>
            <surname>Getoor</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Networkbased drug-target interaction prediction with probabilistic soft logic</article-title>
          .
          <source>IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) 11</source>
          ,
          <issue>5</issue>
          (
          <year>2014</year>
          ),
          <fpage>775</fpage>
          -
          <lpage>787</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Robert</surname>
            <given-names>G Farrell</given-names>
          </string-name>
          , Catalina M Danis,
          <string-name>
            <given-names>Sreeram</given-names>
            <surname>Ramakrishnan</surname>
          </string-name>
          , and Wendy A Kellogg.
          <year>2012</year>
          .
          <article-title>Intrapersonal retrospective recommendation: lifestyle change recommendations using stable patterns of personal behavior</article-title>
          .
          <source>In Proceedings of the First International Workshop on Recommendation Technologies for Lifestyle Change (LIFESTYLE</source>
          <year>2012</year>
          ), Dublin, Ireland. Citeseer,
          <volume>24</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Yuxia</given-names>
            <surname>Huang</surname>
          </string-name>
          and
          <string-name>
            <given-names>Ling</given-names>
            <surname>Bian</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>A Bayesian network and analytic hierarchy process based personalized recommendations for tourist attractions over the Internet</article-title>
          .
          <source>Expert Systems with Applications 36</source>
          ,
          <issue>1</issue>
          (
          <year>2009</year>
          ),
          <fpage>933</fpage>
          -
          <lpage>943</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Aiswarya</given-names>
            <surname>Iyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S</given-names>
            <surname>Jeyalatha</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Ronak</given-names>
            <surname>Sumbaly</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Diagnosis of diabetes using classification mining techniques</article-title>
          .
          <source>arXiv preprint arXiv:1502.03774</source>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Soheil</given-names>
            <surname>Jamshidi</surname>
          </string-name>
          and Mahmoud Reza Hashemi.
          <year>2012</year>
          .
          <article-title>An efficient data enrichment scheme for fraud detection using social network analysis</article-title>
          .
          <source>In Telecommunications (IST)</source>
          ,
          <source>2012 Sixth International Symposium on. IEEE</source>
          ,
          <fpage>1082</fpage>
          -
          <lpage>1087</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Soheil</surname>
            <given-names>Jamshidi</given-names>
          </string-name>
          , Reza Rejaie, and
          <string-name>
            <given-names>Jun</given-names>
            <surname>Li</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Trojan Horses in Amazons Castle: Understanding the Incentivized Online Reviews</article-title>
          .
          <source>In Proceedings of the 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM '18)</source>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Bert</surname>
            <given-names>Kappen</given-names>
          </string-name>
          , Wim Wiegerinck, Ender Akay, Jan Neijt, and Andr'e van Beek.
          <year>2003</year>
          .
          <article-title>Promedas: A clinical diagnostic decision support system</article-title>
          .
          <source>In Proceedings of the 15th Belgian-Dutch Conference on Artificial Intelligence</source>
          .
          <fpage>23</fpage>
          -
          <lpage>24</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Nguyen</given-names>
            <surname>Cong</surname>
          </string-name>
          <string-name>
            <surname>Long</surname>
          </string-name>
          , Phayung Meesad, and
          <string-name>
            <given-names>Herwig</given-names>
            <surname>Unger</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>A highly accurate firefly based algorithm for heart disease prediction</article-title>
          .
          <source>Expert Systems with Applications</source>
          <volume>42</volume>
          ,
          <issue>21</issue>
          (
          <year>2015</year>
          ),
          <fpage>8221</fpage>
          -
          <lpage>8231</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Joao</surname>
            <given-names>Maroco</given-names>
          </string-name>
          , Dina Silva, Ana Rodrigues, Manuela Guerreiro, Isabel Santana, and Alexandre de Mendonça.
          <year>2011</year>
          .
          <article-title>Data mining methods in the prediction of Dementia: A real-data comparison of the accuracy, sensitivity and specificity of linear discriminant analysis, logistic regression, neural networks, support vector machines, classification trees and random forests</article-title>
          .
          <source>BMC research notes 4</source>
          ,
          <issue>1</issue>
          (
          <year>2011</year>
          ),
          <fpage>299</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Amrita</given-names>
            <surname>Naik</surname>
          </string-name>
          and
          <string-name>
            <given-names>Lilavati</given-names>
            <surname>Samant</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Correlation review of classification algorithm using data mining tool: WEKA, Rapidminer, Tanagra, Orange and Knime</article-title>
          .
          <source>Procedia Computer Science</source>
          <volume>85</volume>
          (
          <year>2016</year>
          ),
          <fpage>662</fpage>
          -
          <lpage>668</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Haggai</surname>
            <given-names>Roitman</given-names>
          </string-name>
          , Yossi Messika, Yevgenia Tsimerman, and
          <string-name>
            <given-names>Yonatan</given-names>
            <surname>Maman</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Increasing patient safety using explanation-driven personalized content recommendation</article-title>
          .
          <source>In Proceedings of the 1st ACM International Health Informatics Symposium. ACM</source>
          ,
          <volume>430</volume>
          -
          <fpage>434</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>Kanak</given-names>
            <surname>Saxena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Richa</given-names>
            <surname>Sharma</surname>
          </string-name>
          , et al.
          <year>2015</year>
          .
          <article-title>Efficient heart disease prediction system using decision tree</article-title>
          .
          <source>In Computing, Communication &amp; Automation (ICCCA)</source>
          ,
          <source>2015 International Conference on. IEEE</source>
          ,
          <fpage>72</fpage>
          -
          <lpage>77</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Hanna</surname>
            <given-names>Schafer</given-names>
          </string-name>
          , Santiago Hors-Fraile, Raghav Pavan Karumur, Andre Calero Valdez, Alan Said, Helma Torkamaan, Tom Ulmer, and
          <string-name>
            <given-names>Christoph</given-names>
            <surname>Trattner</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Towards health (aware) recommender systems</article-title>
          .
          <source>In Proceedings of the 2017 international conference on digital health. ACM</source>
          ,
          <volume>157</volume>
          -
          <fpage>161</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Ben</surname>
            <given-names>Taskar</given-names>
          </string-name>
          , Vassil Chatalbashev, Daphne Koller, and
          <string-name>
            <given-names>Carlos</given-names>
            <surname>Guestrin</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>Learning structured prediction models: A large margin approach</article-title>
          .
          <source>In Proceedings of the 22nd international conference on Machine learning. ACM</source>
          ,
          <volume>896</volume>
          -
          <fpage>903</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>MohamadAli</given-names>
            <surname>Torkamani and Daniel Lowd</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Convex adversarial collective classification</article-title>
          .
          <source>In International Conference on Machine Learning</source>
          .
          <fpage>642</fpage>
          -
          <lpage>650</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Mohamad</given-names>
            <surname>Ali</surname>
          </string-name>
          Torkamani and
          <string-name>
            <given-names>Daniel</given-names>
            <surname>Lowd</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>On robustness and regularization of structural support vector machines</article-title>
          .
          <source>In International Conference on Machine Learning</source>
          .
          <fpage>577</fpage>
          -
          <lpage>585</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Andr'e Calero</surname>
            <given-names>Valdez</given-names>
          </string-name>
          , Martina Ziefle, Katrien Verbert, Alexander Felfernig, and
          <string-name>
            <given-names>Andreas</given-names>
            <surname>Holzinger</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Recommender systems for health informatics: Stateof-the-art and future perspectives</article-title>
          .
          <source>In Machine Learning for Health Informatics</source>
          . Springer,
          <fpage>391</fpage>
          -
          <lpage>414</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>David</given-names>
            <surname>Weiss</surname>
          </string-name>
          and
          <string-name>
            <given-names>Benjamin</given-names>
            <surname>Taskar</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Structured prediction cascades</article-title>
          .
          <source>In Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics</source>
          .
          <volume>916</volume>
          -
          <fpage>923</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>WAJJ</given-names>
            <surname>Wiegerinck and Tom Heskes</surname>
          </string-name>
          .
          <year>2001</year>
          .
          <article-title>Probability assessment with maximum entropy in Bayesian networks</article-title>
          . (
          <year>2001</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>Martin</given-names>
            <surname>Wiesner</surname>
          </string-name>
          and
          <string-name>
            <given-names>Daniel</given-names>
            <surname>Pfeifer</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Health recommender systems: concepts, requirements, technical basics and challenges</article-title>
          .
          <source>International journal of environmental research and public health 11</source>
          ,
          <issue>3</issue>
          (
          <year>2014</year>
          ),
          <fpage>2580</fpage>
          -
          <lpage>2607</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>Zhen</given-names>
            <surname>Xie</surname>
          </string-name>
          and
          <string-name>
            <given-names>Sencun</given-names>
            <surname>Zhu</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>AppWatcher: Unveiling the underground market of trading mobile app reviews</article-title>
          .
          <source>In Proceedings of the 8th ACM Conference on Security &amp; Privacy in Wireless and Mobile Networks. ACM</source>
          ,
          <volume>10</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>