Uplift Random Forests

被引:42
|
作者
Guelman, Leo [1 ]
Guillen, Montserrat [1 ]
Perez-Marin, Ana M. [1 ]
机构
[1] Univ Barcelona, Riskctr, Dept Econometr, E-08034 Barcelona, Spain
关键词
marketing; personalized treatment; insurance; binary response; PERSONALIZED MEDICINE; CUSTOMER; INSURANCE; LOYALTY;
D O I
10.1080/01969722.2015.1012892
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Conventional supervised statistical learning models aim to achieve high accuracy in predicting the value of an outcome measure based on a number of input measures. However, in many applications, some type of action is randomized on the observational units. This is the case, for example, in treatment/control settings, such as those usually encountered in marketing and clinical trial applications. In these situations, we may not necessarily be interested in predicting the outcome itself, but in estimating the expected change in the outcome as a result of the action. This is precisely the idea behind uplift models, which, despite their many practical applications, have received little attention in the literature. In this article, we extend the state-of-the-art research in this area by proposing a new approach based on Random Forests. We perform carefully designed experiments using simple simulation models to illustrate some of the properties of the proposed method. In addition, we present evidence on a dataset pertaining to a large Canadian insurer on a customer retention case. The results confirm the effectiveness of the proposed method and show favorable performance relative to other existing uplift modeling approaches.
引用
收藏
页码:230 / 248
页数:19
相关论文
共 50 条
  • [31] Streaming random forests
    Abdulsalam, Hanady
    Skillicorn, David B.
    Martin, Patrick
    IDEAS 2007: 11TH INTERNATIONAL DATABASE ENGINEERING AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2007, : 225 - 232
  • [32] Random Decomposition Forests
    Chien, Chun-Han
    Chen, Hwann-Tzong
    2013 SECOND IAPR ASIAN CONFERENCE ON PATTERN RECOGNITION (ACPR 2013), 2013, : 687 - 691
  • [33] Subtractive random forests
    Broutin, Nicolas
    Devroye, Luc
    Lugosi, Gabor
    Oliveira, Roberto Imbuzeiro
    ALEA-LATIN AMERICAN JOURNAL OF PROBABILITY AND MATHEMATICAL STATISTICS, 2024, 21 : 575 - 591
  • [34] Neural Random Forests
    Gérard Biau
    Erwan Scornet
    Johannes Welbl
    Sankhya A, 2019, 81 : 347 - 386
  • [35] Random subsequence forests
    He Z.
    Wang J.
    Jiang M.
    Hu L.
    Zou Q.
    Information Sciences, 2024, 667
  • [36] Compressing Random Forests
    Painsky, Amichai
    Rosset, Saharon
    2016 IEEE 16TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2016, : 1131 - 1136
  • [37] Random forests for microarrays
    Cutler, Adele
    Stevens, John R.
    DNA MICROARRAYS, PART B: DATABASES AND STATISTICS, 2006, 411 : 422 - +
  • [38] On Oblique Random Forests
    Menze, Bjoern H.
    Kelm, B. Michael
    Splitthoff, Daniel N.
    Koethe, Ullrich
    Hamprecht, Fred A.
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, PT II, 2011, 6912 : 453 - 469
  • [39] On the profile of random forests
    Gittenberger, B
    MATHEMATICS AND COMPUTER SCIENCE II: ALGORITHMS, TREES, COMBINATORICS AND PROBABILITIES, 2002, : 279 - 293
  • [40] Random Forests with R
    Maindonald, John H.
    INTERNATIONAL STATISTICAL REVIEW, 2021,