LBCF: A Large-Scale Budget-Constrained Causal Forest Algorithm

Author:

Ai Meng1,Li Biao1,Gong Heyang2,Yu Qingwei1,Xue Shengjie1,Zhang Yuan1,Zhang Yunzhou1,Jiang Peng1

Affiliation:

1. Kuaishou Inc., China

2. Kuaishou Inc., China and University of Science and Technology of China, China

Publisher

ACM

Reference31 articles.

1. Martín 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–283. Martín 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–283.

2. Susan Athey Julie Tibshirani and Stefan Wager. 2018. Generalized Random Forests. (2018). arxiv:1610.01271 [stat.ME] Susan Athey Julie Tibshirani and Stefan Wager. 2018. Generalized Random Forests. (2018). arxiv:1610.01271 [stat.ME]

3. 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–49 . 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–49.

4. Martin  E Dyer . 1984. An O (n) algorithm for the multiple-choice knapsack linear program. Mathematical programming 29, 1 ( 1984 ), 57–63. Martin E Dyer. 1984. An O (n) algorithm for the multiple-choice knapsack linear program. Mathematical programming 29, 1 (1984), 57–63.

5. Dominance in multi-dimensional multiple-choice knapsack problems;Dyer E;Asia-Pacific Journal of Operational Research,1998

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Explicit Feature Interaction-aware Uplift Network for Online Marketing;Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2023-08-04

2. A Multi-stage Framework for Online Bonus Allocation Based on Constrained User Intent Detection;Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2023-08-04

3. E-Commerce Promotions Personalization via Online Multiple-Choice Knapsack with Uplift Modeling;Proceedings of the 31st ACM International Conference on Information & Knowledge Management;2022-10-17

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3