Empirical comparison of various reinforcement learning strategies for sequential targeted marketing
暂无分享,去创建一个
Haixun Wang | Naoki Abe | Bianca Zadrozny | Wei Fan | Edwin P. D. Pednault | Chidanand Apté | E. Pednault | N. Abe | B. Zadrozny | Haixun Wang | C. Apté | W. Fan
[1] C. Watkins. Learning from delayed rewards , 1989 .
[2] Mahesan Niranjan,et al. On-line Q-learning using connectionist systems , 1994 .
[3] Andrew W. Moore,et al. Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..
[4] John N. Tsitsiklis,et al. Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.
[5] Thomas G. Dietterich. What is machine learning? , 2020, Archives of Disease in Childhood.
[6] Pedro M. Domingos. MetaCost: a general method for making classifiers cost-sensitive , 1999, KDD '99.
[7] Thomas G. Dietterich,et al. Efficient Value Function Approximation Using Regression Trees , 1999 .
[8] Salvatore J. Stolfo,et al. AdaCost: Misclassification Cost-Sensitive Boosting , 1999, ICML.
[9] Thomas G. Dietterich,et al. Bootstrap Methods for the Cost-Sensitive Evaluation of Classifiers , 2000, ICML.
[10] Peter D. Turney. Cost-sensitive learning bibliography , 2000, The Web Conference.
[11] Edwin P. D. Pednault,et al. Segmentation-based modeling for advanced targeted marketing , 2001, KDD '01.
[12] Charles Elkan,et al. The Foundations of Cost-Sensitive Learning , 2001, IJCAI.
[13] Bianca Zadrozny,et al. Learning and making decisions when costs and probabilities are both unknown , 2001, KDD '01.
[14] Edwin P. D. Pednault,et al. Segmented Regression Estimators for Massive Data Sets , 2002, SDM.
[15] Naoki Abe,et al. Sequential cost-sensitive decision making with reinforcement learning , 2002, KDD.
[16] A. ADoefaa,et al. ? ? ? ? f ? ? ? ? ? , 2003 .
[17] Peter Dayan,et al. Q-learning , 1992, Machine Learning.