{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T04:38:14Z","timestamp":1682483894803},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3485447.3512103","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:11:23Z","timestamp":1650863483000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["LBCF: A Large-Scale Budget-Constrained Causal Forest Algorithm"],"prefix":"10.1145","author":[{"given":"Meng","family":"Ai","sequence":"first","affiliation":[{"name":"Kuaishou Inc., China"}]},{"given":"Biao","family":"Li","sequence":"additional","affiliation":[{"name":"Kuaishou Inc., China"}]},{"given":"Heyang","family":"Gong","sequence":"additional","affiliation":[{"name":"Kuaishou Inc., China and University of Science and Technology of China, China"}]},{"given":"Qingwei","family":"Yu","sequence":"additional","affiliation":[{"name":"Kuaishou Inc., China"}]},{"given":"Shengjie","family":"Xue","sequence":"additional","affiliation":[{"name":"Kuaishou Inc., China"}]},{"given":"Yuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Kuaishou Inc., China"}]},{"given":"Yunzhou","family":"Zhang","sequence":"additional","affiliation":[{"name":"Kuaishou Inc., China"}]},{"given":"Peng","family":"Jiang","sequence":"additional","affiliation":[{"name":"Kuaishou Inc., China"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Tensorflow: A system for large-scale machine learning. In 12th {USENIX} symposium on operating systems design and implementation ({OSDI} 16). 265\u2013283.","author":"Abadi Mart\u00edn","year":"2016","unstructured":"Mart\u00edn Abadi , Paul Barham , Jianmin Chen , Zhifeng Chen , Andy Davis , Jeffrey Dean , Matthieu Devin , Sanjay Ghemawat , Geoffrey Irving , Michael Isard , 2016 . Tensorflow: A system for large-scale machine learning. In 12th {USENIX} symposium on operating systems design and implementation ({OSDI} 16). 265\u2013283. Mart\u00edn Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, 2016. Tensorflow: A system for large-scale machine learning. In 12th {USENIX} symposium on operating systems design and implementation ({OSDI} 16). 265\u2013283."},{"key":"e_1_3_2_1_2_1","unstructured":"Susan Athey Julie Tibshirani and Stefan Wager. 2018. Generalized Random Forests. (2018). arxiv:1610.01271\u00a0[stat.ME] Susan Athey Julie Tibshirani and Stefan Wager. 2018. Generalized Random Forests. (2018). arxiv:1610.01271\u00a0[stat.ME]"},{"key":"e_1_3_2_1_3_1","volume-title":"Improve User Retention with Causal Learning. In The 2019 ACM SIGKDD Workshop on Causal Discovery. PMLR, 34\u201349","author":"Du Shuyang","year":"2019","unstructured":"Shuyang Du , James Lee , and Farzin Ghaffarizadeh . 2019 . Improve User Retention with Causal Learning. In The 2019 ACM SIGKDD Workshop on Causal Discovery. PMLR, 34\u201349 . Shuyang Du, James Lee, and Farzin Ghaffarizadeh. 2019. Improve User Retention with Causal Learning. In The 2019 ACM SIGKDD Workshop on Causal Discovery. PMLR, 34\u201349."},{"key":"e_1_3_2_1_4_1","volume-title":"Mathematical programming 29, 1","author":"Dyer E","year":"1984","unstructured":"Martin\u00a0 E Dyer . 1984. An O (n) algorithm for the multiple-choice knapsack linear program. Mathematical programming 29, 1 ( 1984 ), 57\u201363. Martin\u00a0E Dyer. 1984. An O (n) algorithm for the multiple-choice knapsack linear program. Mathematical programming 29, 1 (1984), 57\u201363."},{"key":"e_1_3_2_1_5_1","first-page":"159","article-title":"Dominance in multi-dimensional multiple-choice knapsack problems","volume":"15","author":"Dyer E","year":"1998","unstructured":"Martin\u00a0 E Dyer and John Walker . 1998 . Dominance in multi-dimensional multiple-choice knapsack problems . Asia-Pacific Journal of Operational Research 15 , 2 (1998), 159 . Martin\u00a0E Dyer and John Walker. 1998. Dominance in multi-dimensional multiple-choice knapsack problems. Asia-Pacific Journal of Operational Research 15, 2 (1998), 159.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412215"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/01969722.2015.1012892"},{"key":"e_1_3_2_1_8_1","volume-title":"International Conference on Predictive Applications and APIs. PMLR, 1\u201313","author":"Gutierrez Pierre","year":"2017","unstructured":"Pierre Gutierrez and Jean-Yves G\u00e9rardy . 2017 . Causal inference and uplift modelling: A review of the literature . In International Conference on Predictive Applications and APIs. PMLR, 1\u201313 . Pierre Gutierrez and Jean-Yves G\u00e9rardy. 2017. Causal inference and uplift modelling: A review of the literature. In International Conference on Predictive Applications and APIs. PMLR, 1\u201313."},{"key":"e_1_3_2_1_9_1","volume-title":"First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem. international Journal of Metaheuristics 2, 2","author":"Hiremath S","year":"2013","unstructured":"Chaitr\u00a0 S Hiremath and Raymond\u00a0 R Hill . 2013. First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem. international Journal of Metaheuristics 2, 2 ( 2013 ), 174\u2013199. Chaitr\u00a0S Hiremath and Raymond\u00a0R Hill. 2013. First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem. international Journal of Metaheuristics 2, 2 (2013), 174\u2013199."},{"key":"e_1_3_2_1_10_1","volume-title":"Knapsack problems","author":"Kellerer Hans","unstructured":"Hans Kellerer , Ulrich Pferschy , and David Pisinger . 2004. Multidimensional knapsack problems . In Knapsack problems . Springer , 235\u2013283. Hans Kellerer, Ulrich Pferschy, and David Pisinger. 2004. Multidimensional knapsack problems. In Knapsack problems. Springer, 235\u2013283."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2488217"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623341"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052616"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347027"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/98124"},{"key":"e_1_3_2_1_16_1","unstructured":"Nicholas Radcliffe. 2007. Using control groups to target on predicted lift: Building and assessing uplift model. Direct Marketing Analytics Journal(2007) 14\u201321. Nicholas Radcliffe. 2007. Using control groups to target on predicted lift: Building and assessing uplift model. Direct Marketing Analytics Journal(2007) 14\u201321."},{"key":"e_1_3_2_1_17_1","unstructured":"Nicholas\u00a0J Radcliffe and Patrick\u00a0D Surry. 2011. Real-world uplift modelling with significance-based uplift trees. White Paper TR-2011-1 Stochastic Solutions(2011) 1\u201333. Nicholas\u00a0J Radcliffe and Patrick\u00a0D Surry. 2011. Real-world uplift modelling with significance-based uplift trees. White Paper TR-2011-1 Stochastic Solutions(2011) 1\u201333."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/dir.20066"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/70.1.41"},{"key":"e_1_3_2_1_20_1","volume-title":"Estimating causal effects of treatments in randomized and nonrandomized studies.Journal of educational Psychology 66, 5","author":"Rubin B","year":"1974","unstructured":"Donald\u00a0 B Rubin . 1974. Estimating causal effects of treatments in randomized and nonrandomized studies.Journal of educational Psychology 66, 5 ( 1974 ), 688. Donald\u00a0B Rubin. 1974. Estimating causal effects of treatments in randomized and nonrandomized studies.Journal of educational Psychology 66, 5 (1974), 688."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-011-0434-0"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.27.3.503"},{"key":"e_1_3_2_1_23_1","volume-title":"Ensemble methods for uplift modeling. Data mining and knowledge discovery 29, 6","author":"So\u0142tys Micha\u0142","year":"2015","unstructured":"Micha\u0142 So\u0142tys , Szymon Jaroszewicz , and Piotr Rzepakowski . 2015. Ensemble methods for uplift modeling. Data mining and knowledge discovery 29, 6 ( 2015 ), 1531\u20131559. Micha\u0142 So\u0142tys, Szymon Jaroszewicz, and Piotr Rzepakowski. 2015. Ensemble methods for uplift modeling. Data mining and knowledge discovery 29, 6 (2015), 1531\u20131559."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Jerzy Splawa-Neyman Dorota\u00a0M Dabrowska and TP Speed. 1990. On the application of probability theory to agricultural experiments. Essay on principles. Section 9.Statist. Sci. (1990) 465\u2013472. Jerzy Splawa-Neyman Dorota\u00a0M Dabrowska and TP Speed. 1990. On the application of probability theory to agricultural experiments. Essay on principles. Section 9.Statist. Sci. (1990) 465\u2013472.","DOI":"10.1214\/ss\/1177012031"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835810"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450075"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1319839"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2788602"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330700"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.66"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSAA.2019.00057"}],"event":{"name":"WWW '22: The ACM Web Conference 2022","location":"Virtual Event, Lyon France","acronym":"WWW '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T12:08:50Z","timestamp":1682424530000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":31,"alternative-id":["10.1145\/3485447.3512103","10.1145\/3485447"],"URL":"http:\/\/dx.doi.org\/10.1145\/3485447.3512103","relation":{},"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}