Sequential cost-sensitive decision making with reinforcement learning
暂无分享,去创建一个
[1] Mahesan Niranjan,et al. On-line Q-learning using connectionist systems , 1994 .
[2] Ben J. A. Kröse,et al. Learning from delayed rewards , 1995, Robotics Auton. Syst..
[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] John N. Tsitsiklis,et al. Analysis of Temporal-Diffference Learning with Function Approximation , 1996, NIPS.
[7] Richard S. Sutton,et al. Introduction to Reinforcement Learning , 1998 .
[8] Pedro M. Domingos. MetaCost: a general method for making classifiers cost-sensitive , 1999, KDD '99.
[9] Thomas G. Dietterich,et al. Efficient Value Function Approximation Using Regression Trees , 1999 .
[10] Salvatore J. Stolfo,et al. AdaCost: Misclassification Cost-Sensitive Boosting , 1999, ICML.
[11] Thomas G. Dietterich,et al. Bootstrap Methods for the Cost-Sensitive Evaluation of Classifiers , 2000, ICML.
[12] Peter D. Turney. Cost-sensitive learning bibliography , 2000, The Web Conference.
[13] Edwin P. D. Pednault,et al. Segmentation-based modeling for advanced targeted marketing , 2001, KDD '01.
[14] Charles Elkan,et al. The Foundations of Cost-Sensitive Learning , 2001, IJCAI.
[15] Bianca Zadrozny,et al. Learning and making decisions when costs and probabilities are both unknown , 2001, KDD '01.
[16] Edwin P. D. Pednault,et al. Segmented Regression Estimators for Massive Data Sets , 2002, SDM.
[17] Peter Dayan,et al. Q-learning , 1992, Machine Learning.