<!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>Daria Semenova[</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>The Comparison of Methods for Individual Treatment E ect Detection?</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>National Research University Higher School of Economics</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>0000</year>
      </pub-date>
      <volume>0001</volume>
      <abstract>
        <p>Today, treatment e ect estimation at the individual level is a vital problem in many areas of science and business. For example, in marketing, estimates of the treatment e ect are used to select the most e cient promo-mechanics; in medicine, individual treatment e ects are used to determine the optimal dose of medication for each patient and so on. At the same time, the question on choosing the best method, i.e., the method that ensures the smallest predictive error (for instance, RMSE) or the highest total (average) value of the e ect, remains open. Accordingly, in this paper we compare the e ectiveness of machine learning methods for estimation of individual treatment e ects. The comparison is performed on the Criteo Uplift Modeling Dataset. In this paper we show that the combination of the Logistic Regression method and the Di erence Score method as well as Uplift Random Forest method provide the best correctness of Individual Treatment E ect prediction on the top 30% observations of the test dataset.</p>
      </abstract>
      <kwd-group>
        <kwd>Individual Treatment E ect ITE Machine Learning Random Forest XGBoost SVM Random Experiments A/B testing Uplift Random Forest</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>We live in a world of growing information. Data appear daily in many sectors
of our lives. Accordingly, many questions on data storage, processing and usage
are arising. In particular, questions about the most suitable methods for certain
problems are increasingly being asked. In this paper, we compare several methods
for solving one of the most discussed problems of the last decade, individual
treatment e ect estimation.</p>
      <p>Under treatments in the academic literature it is customary to understand
a certain exposure exerted on an individual or group of individuals in order to
? Copyright c 2019 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
?? The publication was prepared within the framework of the Academic Fund Program
at the National Research University Higher School of Economics in 2019-2020 (grant
No 19-04-048) and by the Russian Academic Excellence Project "5-100".
provoke a response. So, for example, in marketing push noti cations with an
appeal to buy goods at a discount may be identi ed as treatments; in medicine,
the de nition of treatment is more formal and implies the e ect of a drug on
the human body. As for the treatment e ect, it can be de ned as a quantitative
indicator that demonstrates how much the treatment has in uenced individuals
under treatment, compared to individuals from the control group, that is, those
who have not been treated.</p>
      <p>In many situations, individuals may react di erently to the same treatments,
thus, there is a heterogeneity in responses to a treatment. Given the assumption
of a heterogeneous population, we should consider a personalized or individual
treatment e ect (ITE). There is a number of approaches addressing this problem.
So, in our study we will investigate some of the most commonly used approaches
for individual treatment e ect evaluation, combining them with machine learning
methods.</p>
      <p>Before proceeding to the description of the approaches and methods that we
plan to use in our study, it is necessary to introduce several basic terms related
to the topic of ITE evaluation. First of all, we need to identify the outcome
or response variable Y . This is the parameter that change we need to track
during the implementation of a certain treatment. For example, in marketing,
such a parameter may be the average customer check after two weeks of an
advertising campaign. Usually, outcome variable is numerical or categorical. In
the rst case, it measures a quantitative indicator, for example, the sum of a
check in a particular store, and in the second case, it takes values from some
limited set of categories. If only two outcomes are expected, for example, to buy
or not to buy something, the variable takes values 1 and 0, respectively, and
the outcome is designated as binary. Secondly, it is necessary to identify a set of
parameters or characteristics X that a ect the target variable. Returning to the
previous marketing example, the set of X can consist of recency, frequency and
monetary characteristics of particular individual's purchases before the start of
the marketing campaign. Thirdly, we should de ne treatment and control groups.
In random experiments, all participants are usually divided into two groups: the
treatment group and the control group. The treatment group is the group of
individuals that is a ected during the experiment, and the control group is the
group that is not a ected. The results of comparing outcomes in the control and
treatment groups allow us to judge the e ciency of the treatment. Now that we
have de ned the basic concepts, we can move on to the essence of the study.</p>
      <p>
        In this paper, we focus on e ect for a binary variable and moreover for the
approaches of individual treatment e ect (ITE) estimation task reduction to
classi cation problem. However our goal is not classi cation but the identi
cation of the subgroups of clients who are more likely to respond on the treatment
positively. We consider several machine learning (hereinafter ML) methods (in
particular, linear logit regression, Random Forest, XGBoost and SVM) for three
approaches of treatment e ect evaluation: di erence score method, modi ed
outcome method and uplift Random Forest [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. To validate the compared approaches
on real data, we use Criteo Uplift Modeling Dataset, released along with the
paper A Large Scale Benchmark for Uplift Modeling by Diemert et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>The rest of the paper is organized as follows. The rst section reviews the
related works. The second section discusses the data we deal with. The third
section introduces methodology. The fourth section discusses the evaluation results.
The last sections contain conclusions and directions for further research.
1</p>
    </sec>
    <sec id="sec-2">
      <title>Literature review</title>
      <p>
        To date, there are several review papers that systematize existing methods
assessing individual treatment e ects (see, for example, [
        <xref ref-type="bibr" rid="ref10 ref7">10, 7</xref>
        ]. Existing methods,
primarily, di er in type of the response or outcome variable Y . In most of the
studies it is either numerical or categorical. So, if the objective of the study is
to evaluate a quantitative indicator, then Y is numerical and corresponds to the
numerical value of the outcome variable. For example, in medicine, a numerical
variable Y would correspond to the quantity of a certain component in a
person blood, and accordingly, treatment will be aimed at a quantitative increase
or decrease of this indicator. In other cases the outcome variable is categorical
indicating certain states of the individual.In particular, when there are only two
possible states, the variable takes the values 0 or 1. In marketing, such a problem
can be formulated, for example, as the fact of visiting or purchasing in a certain
time window after sending a noti cation to the customer.
      </p>
      <p>
        Another signi cant di erence between existing models is the methodology
underlying them. Here, all models can be divided into two large groups. The
rst one includes models that transform the task of treatment e ect estimation
problem into a regression or classi cation (depending on the type of the target
variable) problem in a special way. In particular, let there be some response
variable Y and a set of independent variables X. The main question in this case is
to nd the most accurate functional relationship between Y and X (Y f (X)).
As you can see, there is no treatment variable in the regression and classi cation
problems, and the main issue to be solved in such models is how exactly the
treatment variable can be encoded so that the solution of the classi cation or
regression problem gives the solution to the problem of individual treatment
e ect estimation [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The second large group of methods includes modi cations
of machine learning techniques specially designed for solving the treatment e ect
evaluation problem.
1.1
      </p>
      <sec id="sec-2-1">
        <title>Reduction to the Classi cation Task</title>
        <p>
          Nowadays, methods of reduction to the classi cation problem are
conventionally divided into two groups: indirect estimation methods and direct estimation
methods [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
        <p>Indirect methods are realized through a systematic two-stage procedure of
individual treatment e ect estimation,the rst stage of which is aimed to achieve
high accuracy in predicting the target variable Y due to covariates X and
treatment. In the second step, the ITE is estimated as the di erence in prediction
between the treatment and control group. By contrast, direct methods modify
the data in such a way, that only one model is estimated.</p>
        <p>
          Indirect Methods The group of indirect methods includes, for example, the
di erence-in-di erence method [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] and the di erence score method [
          <xref ref-type="bibr" rid="ref8 ref9">9, 8</xref>
          ]. In our
study we use the di erence score method, because ML-methods that we plan to
apply are more applicable for it compared to the di erence-in-di erence method.
So let us dwell on di erence score method in more detail.
        </p>
        <p>
          Di erence score method The di erence score method is also known as the
TwoModel approach. The main idea of it lies in the construction of two models that
predict the value of the response variable Y by the properties of each description
of the object x 2 X. The rst model is built on the treatment group that received
the treatment and the second one is built on the control group receiving no
treatment. It is assumed that these models can accurately predict the average
value of the response variable Y in each of the situations; therefore, the di erence
in the predictions of the models should give us the average e ect for observations
with characteristics X [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. Because of its simplicity the Two-model approach is
usually used as the baseline for more complex statistical and machine learning
classi cation methods [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], such as logistic regression [
          <xref ref-type="bibr" rid="ref8 ref9">9, 8</xref>
          ], Random Forest [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ],
XGBoost [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] and even neural networks [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
        <p>
          Direct methods Direct methods represent the idea of adding special
interaction variables, which become equal to zero on the control group, and on the test
group correspond to independent variables of the original data sample. In this
case, a model of the form Y^ = f (X; T; T X) is trained. Such models are well
studied in mathematical statistics and econometrics, and, accordingly, there are
rigorous methods for calculating the statistical signi cance and con dence
intervals for many speci cations of the function f ( ), which is an undoubted advantage
of this approach [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. Having trained such a model, the e ect of the impact can
be estimated as:
4Y^g = ^( g) = ^(x) = f (X; 1; X)
f (X; 0; 0 X)
(1)
The group of direct models includes modi ed covariate method, causal
K-nearestneighbor, matching before randomization and modi ed outcome method [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].In
our study we will focus on the last of the above approaches due to its ability to
be easily combined with machine learning techniques.
        </p>
        <p>
          Modi ed outcome method The modi ed outcome method is developed by Jaskowski
and Jaroszewicz [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] and by Weisberg and Pontes [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] and implies the target
variable Y transformation so that the solution of the classi cation problem on the
transformed data provides the solution to the ITE problem. The authors propose
setting a new variable Z, taking values 1 or 0 in the following way:
Zi =
and then tting a binary regression model to Z on the set of covariates X. If we
accept the assumption that Y = 1 is more desirable than Y = 0, we can assume
W = 1 as an event of receiving a potential treatment result that is at least as
good as the observed result [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
        <p>In this case, when taking the assumption of the equal size of test and control
groups, the expected value of the event Z = 1 occurrence will be determined as:
E[Z] =</p>
        <p>E[Y jT = 1] P [T = 1]+
+E[1</p>
        <p>Y jT = 0] P [T = 0] = 0:5 (1 + E[4Y ])</p>
        <p>
          Thus, it turns out that the expected value of a new random variable E[Z]
monotonously depends on the treatment e ect. In this case, the estimated model
Z = f (X)+ will predict conditional expected value of Z on the set of covariates
X, that is, it will be a monotonous transformation of the treatment e ect [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ].
        </p>
        <p>
          The advantages of the modi ed outcome method seem to be as follow: rstly,
it allows to use a wide range of classi cation models; secondly, it makes possible
to get lesser dispersion of model predictions in comparison with the Two-models
approach; and thirdly, it is more simple to interpret the coe cients of linear
models [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
        </p>
        <p>
          Weisberg and Pontes [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] somehow modi ed the abovemention approach,
entering a random variable Z = 2 Y (2 T 1), expected value of that E[Z] is
equal to the expected value of treatment e ect E[T ]. Thus, the model estimation
Z = f (X) + yields the function f (X), which predicts E[ZjX] = (X). In this
case, the entire data sample is used to train the model, and as a result, the
quality of prediction of such a model should be better than in the described above
model of Jaskowski and Jaroszewicz [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. Therefore, by virtue of the assumption
of a higher quality model proposed by Weisberg and Pontes [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], we will use a
modi cation of these authors in our study.
1.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Uplift random forest models</title>
        <p>
          In the previous section, we examined in detail the methods related to the group
where the task of individual treatment e ect estimation is transformed into
classi cation problem. The method described below refers to the second group
of approaches mentioned above, involving the use of modi ed machine
learning methods. This method is called Uplift random forest and it was developed
by Guelman and his colleagues [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].The main idea of the Uplift Random forest
is the tree-building algorithm with the sensitive splitting criteria, proposed by
Rzepakowski and Jaroszewicz [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. The method is based on the criteria for
splitting tree nodes, which in turn is intended to maximize the distance between the
empirical distribution density of the response variable Y in the test and control
groups. As a distance, the authors consider the Kullback-Leibler divergence. The
quality of a particular splitting is characterized by growth rate of the distance
between test and control group. In this work we consider for a reference only one
method from this group since the main idea of this paper is to check whether
machine learning models can improve the estimation quality of reduction
approaches.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Data</title>
      <p>
        To compare di erent methods for treatment e ect evaluation, we used Criteo
Uplift Modeling Dataset. The choice of the dataset was justi ed by its large
dimension, as well as the data openness. This dataset was created by the Diemert
and his colleagues [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] by combining the data obtained as a result of several
incrementality tests, a speci c randomized research procedure, in which advertising
treatment directed not to all customers, but only to a randomly selected test
group. The dataset consists of 25 million observations, each of which represents
a user of the website. For each person it is known his 12 features, belonging
to a group (test or control), whether the user visited and/or converted on the
advertiser's website during the test period (2 weeks), and whether the user has
been e ectively treated. Due to the loss of potential income in the control group,
advertisers usually keep only a small control group.
      </p>
      <p>
        Criteo Uplift Modeling Dataset contains signi cantly modi ed data by the
Diemert and his colleagues for the reason of privacy [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The initial data was
processed as follows: the data was sub-sampled non-uniformly so the initial level
of increment cannot be deduced; the names of the features were anonymous,
and their values were randomly designed to preserve predictive power, while it
is almost impossible to restore the original features or user context.
3
      </p>
    </sec>
    <sec id="sec-4">
      <title>Methodology</title>
      <p>The main goal of this study is the comparison of di erent machine learning
methods applied to di erent approaches of individual treatment e ect evaluation. We
aimed to compare various methods in terms of better identi cation of clients
who are more likely to respond to treatment, i.e. who have a higher individual
treatment e ect (ITE):</p>
      <p>IT E = E[Yi = 1 j Xi; treatment = 1]
E[Yi = 1 j Xi; treatment = 0]
(2)</p>
      <p>Each client was assigned either to a test group, that is, to the one that
received the marketing treatment, or to the control group, the participants of
which did not receive marketing treatment. Note that in this case it is impossible
to observe the same person in two groups at the same time, which makes the
task of ITE estimation for an individual point infeasible. But despite this, there
are several approaches to solving it, some of which have been described in the
literature review - so, we will use them in our study.</p>
      <p>
        We apply linear logistic regression, Random Forest, XGBoost and SVM
methods to Di erence Score and Modi ed Outcome approaches of measurement of
ITE, as well as Random forest method to Uplift modeling, proposed by
Guelman [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The choice of above mentioned machine learning methods was justi ed
by their popularity and frequency of use in studies of the treatment e ect
evaluation. Presumably, the Modi ed Outcome method and Uplift modeling should
show better results compared to the indirect method, since they are aimed
directly at ITE modeling, in contrast to the latter approach.
      </p>
      <p>So, the main steps of the experimental part of the study are described below.
Preliminary data analysis. According to a preliminary analysis of the data,
the response of customers in the test and control groups was 4.41% and
2.61%, respectively. Results of t-test con rm the statistically signi cant
difference of target variable between the test and control groups, which, in
turn, indicates the presence of the treatment e ect (p-value &lt; 0.01), but this
di erence is small. That is why it is extremely important to nd a
combination of approach and method which will allow to estimate the individual
treatment e ect most accurately. Our algorithm, described below, is aimed
at achieving this goal.</p>
      <p>Random split. We randomly assigned clients to either training (sample used
for learning model) or holdout group (sample used for test of evaluation
quality). The size of treatment and control group in training dataset are
equal and less than in original dataset. We divide entire sample into training
and holdout sets because training and evaluate quality of model on the same
sample leads to retraining (to nd patterns in the training sample that are
not patterns for all other data). Only test of evaluation quality on holdout
set will correctly convey the quality of the model.</p>
      <p>Model estimation. Fit the models on training sample. In reason of the
computational complexity the training sample for SVM and Uplift Random forest
models was truncated.</p>
      <p>
        Prediction. Predict ITE on holdout sample. These values of ITE are ordered
from high to low and binned together in deciles. We limit quantity of targets
clients by 30% with the highest score of ITE similarly Guelman [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. This
action can be explained by two reasons. First of all, all individual considered
by model as being persuadable will have a high ITE and thus be in front.
Secondly, there is also practical reason: the cost of marketing campaigns is
usually high, therefore, rms try to limit the share of targets clients.
Quality metrics of models. Average treatment e ect and total treatment
effect are used to compare di erent methods and choose the best. The ideal
model will predict large ITE for observations with real large ITE, and as a
result, the average e ect should be large in the selected subsample of the
holdout sample. On the other hand, if the model gives poor predictions and,
as a consequence, arranges the observations in a random order, then the
average treatment e ect will not di er from the average e ect on the entire
holdout sample. This means that di erent models for assessing the ITE can
be compared by the size of the AVE on subsample. In most marketing tasks,
the researcher is not so much interested in the ATE as the overall e ect
(TTE). TTE is ATE multiplied by the number of target customers.
      </p>
      <p>AT E = E[Y j treatment = 1]</p>
      <p>E[Y j treatment = 0]
T T E = AT E</p>
      <p>N
(3)
(4)
where N is the size of subgroup.</p>
      <p>Another vital step that must be taken after calculating the quality metrics
is to verify the performance of the predictive model in practice. To do this,
we use the cross-validation method. Cross-validation iterations are performed
for di erent divided sets, which helps to reduce the spread of results, and the
veri cation results are averaged over all iterations. In our study, each
crossvalidation iteration includes all algorithm steps from random split to model
quality metrics measure. In each iteration new training and holdout samples are
submitted for input. Then iterations are performed twenty times to reduce the
results spread whereupon results are averaged over all iterations.
4</p>
    </sec>
    <sec id="sec-5">
      <title>Empirical results</title>
      <p>In this section we demonstrate the results of di erent ML-methods
implementation to three approaches of ITE detection. It should be recalled that we studied
the interaction of such approaches as modi ed outcome method (mom) and
di erence score method (2M) with the following ML-methods: Logit, Random
Forest, SVM and XGBoost. Also, we compared all the above combinations with a
special model - Uplift Random Forest. All approaches were implemented using
the twenty-fold cross-validation procedure. Table 1 allows comparing the
performance of di erent ML methods applied to three approaches of ITE detection in
terms of average treatment e ect of subgroup, particularly, of top 30% clients
with the highest ITE.</p>
      <p>It is worth noting, that all methods give di erent estimates with di erent
con dence intervals.</p>
      <p>According to the results obtained, di erence score method estimated by linear
logistic regression turned out to be the best among all. Also, we should highlight
the signi cant statistical di erence in mean values ATE and TTE between two
best models: 2M-GML and UPLIFT-RF. Therefore, despite the fact that the
di erence between the mean values of ATE and TTE of two best models is not
so large, mean values di er statistically, which means that 2M-GML model is
better than UPLIFT-RF model in terms of ATE and TTE.</p>
      <p>One of the reason for the high quality of the Two-model approach could be
the particularity of the dataset. In particular, if the model Y^ = f (X; treatment)
is well tted in the data, then the two model can provide good results. Thus
method comparison on other datasets is needed to check this statement.</p>
      <p>Another important point to be made relates to computational complexity of
Uplift Random Forest the train dataset for this method was truncated.
Probably, this fact has become the reason for the poorer performance demonstrated
by UPLIFT-RF compared to 2M-GML. With regard to the worst results, they
were demonstrated by combinations of the SVM-method and modi ed outcome
approach, as well as of the Random forest and modi ed outcome approach. A
visual representation of the ATE results, obtaining due to the twenty-cycles
cross-validation is presented on the Figure 1.</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>Nowadays, heterogeneous treatment e ect estimation is a fundamental and
useful for business and science problem. There are various approaches have been
proposed to identify the individuals that are most likely to respond towards a
treatment. In this paper we were aimed to compare some of the well-known
approaches such as Modi ed Outcome method, Di erence Score method and Uplift
Random Forest. The rst two approaches of ITE measurement were estimated
by linear logistic regression, Random Forest, SVM and XGBoost. The Criteo Uplift
Modeling Dataset was used for tting models.</p>
      <p>In this study, we used two metrics: average treatment e ect (ATE) and
total treatment e ect (TTE) on three deciles predicted by the model. To reduce
the noise rate of results cross-validation procedure was performed on di erent
splitted subsamples.</p>
      <p>According to the empirical results, Di erence Score method modeling by
linear logistic regression and Uplift Random Forest have achieved the best
performance. The noisiest results were showed by SVM in combination with both
Modi ed Outcome and Di erence Score approaches. Since the conclusion on
the linear regression best perfomance seems to be really surprising, proposed
methodology needs to be further veri ed with other data.</p>
      <p>The practical implementation of the research results will presumably consist
in applying the best combination of approach and method of ITE estimation
to real marketing campaigns, which, in turn, will increase their e ectiveness in
terms of consumers' responses rise.
6</p>
    </sec>
    <sec id="sec-7">
      <title>Future research</title>
      <p>
        Finally, there are some limitations of paper that open area for further research.
We consider the case of reduction to classi cation problem, reduction to
regression problem also may be useful in terms of nancial gain from a marketing
campaign. Also we have used only three approaches of individual treatment e ect
estimation. It is available to extent list of approaches by, for example, modi ed
covariate method [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Moreover, because of the computation complexity a small
share of the initial database was used for training set, increasing the size of the
training set can improve the models quality.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Breiman</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Random forests</article-title>
          .
          <source>Machine learning 45(1)</source>
          ,
          <volume>5</volume>
          {
          <fpage>32</fpage>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Buzmakov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Machine learning for subgroup discovery under treatment e ect</article-title>
          . arXiv preprint arXiv:
          <year>1902</year>
          .
          <volume>10327</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guestrin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Xgboost: A scalable tree boosting system</article-title>
          .
          <source>In: Proceedings of the 22nd acm sigkdd international conference on knowledge discovery and data mining</source>
          . pp.
          <volume>785</volume>
          {
          <fpage>794</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Diemert</given-names>
            <surname>Eustache</surname>
          </string-name>
          , Betlei Artem, Renaudin,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Massih-Reza</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>A large scale benchmark for uplift modeling</article-title>
          .
          <source>In: Proceedings of the AdKDD and TargetAd Workshop</source>
          , KDD, London,United Kingdom,
          <year>August</year>
          ,
          <volume>20</volume>
          ,
          <year>2018</year>
          . ACM (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Guelman</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Optimal personalized treatment learning models with insurance applications (</article-title>
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Guelman</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guillen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perez-Mar n</surname>
            ,
            <given-names>A.M.:</given-names>
          </string-name>
          <article-title>Uplift random forests</article-title>
          .
          <source>Cybernetics and Systems</source>
          <volume>46</volume>
          (
          <issue>3-4</issue>
          ),
          <volume>230</volume>
          {
          <fpage>248</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Gutierrez</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gerardy</surname>
          </string-name>
          , J.Y.:
          <article-title>Causal inference and uplift modelling: A review of the literature</article-title>
          .
          <source>In: International Conference on Predictive Applications and APIs</source>
          . pp.
          <volume>1</volume>
          {
          <issue>13</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Hansotia</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rukstales</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Incremental value modeling</article-title>
          .
          <source>Journal of Interactive Marketing</source>
          <volume>16</volume>
          (
          <issue>3</issue>
          ),
          <volume>35</volume>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Hansotia</surname>
            ,
            <given-names>B.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rukstales</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Direct marketing for multichannel retailers: Issues, challenges and solutions</article-title>
          .
          <source>Journal of Database Marketing &amp; Customer Strategy Management</source>
          <volume>9</volume>
          (
          <issue>3</issue>
          ),
          <volume>259</volume>
          {
          <fpage>266</fpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Jaroszewicz</surname>
            ,
            <given-names>S.S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rzepakowski</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Ensemble methods for uplift modeling</article-title>
          .
          <source>Data Min. Knowl. Discov</source>
          <volume>29</volume>
          (
          <issue>6</issue>
          ),
          <volume>1531</volume>
          {
          <fpage>1559</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Jaskowski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jaroszewicz</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Uplift modeling for clinical trial data</article-title>
          .
          <source>In: ICML Workshop on Clinical Data Analysis</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Lo</surname>
            ,
            <given-names>V.S.:</given-names>
          </string-name>
          <article-title>The true lift model: a novel data mining approach to response modeling in database marketing</article-title>
          .
          <source>ACM SIGKDD Explorations Newsletter</source>
          <volume>4</volume>
          (
          <issue>2</issue>
          ),
          <volume>78</volume>
          {
          <fpage>86</fpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Manahan</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>A proportional hazards approach to campaign list selection</article-title>
          .
          <source>SAS User Group International (SUGI) 30 Proceedings</source>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Rzepakowski</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jaroszewicz</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Decision trees for uplift modeling with single and multiple treatments</article-title>
          .
          <source>Knowledge and Information Systems</source>
          <volume>32</volume>
          (
          <issue>2</issue>
          ),
          <volume>303</volume>
          {
          <fpage>327</fpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Tian</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alizadeh</surname>
            ,
            <given-names>A.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gentles</surname>
            ,
            <given-names>A.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tibshirani</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>A simple method for estimating interactions between a treatment and a large number of covariates</article-title>
          .
          <source>Journal of the American Statistical Association</source>
          <volume>109</volume>
          (
          <issue>508</issue>
          ),
          <volume>1517</volume>
          {
          <fpage>1532</fpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Weisberg</surname>
            ,
            <given-names>H.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pontes</surname>
            ,
            <given-names>V.P.</given-names>
          </string-name>
          :
          <article-title>Estimation of individual causal e ects (</article-title>
          <year>April 2014</year>
          ), http://www.freepatentsonline.com/8688610.html
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Weisberg</surname>
            ,
            <given-names>H.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pontes</surname>
            ,
            <given-names>V.P.</given-names>
          </string-name>
          :
          <article-title>Post hoc subgroups in clinical trials: Anathema or analytics? Clinical trials 12(4</article-title>
          ),
          <volume>357</volume>
          {
          <fpage>364</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>