Optimizing debt collections using constrained reinforcement learning

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 75-84

  Abe, Naoki ^a   Melville, Prem ^a   Pendus, Cezar ^a   Reddy, Chandan K ^a   Jensen, David L ^a   Thomas, Vince P ^b   Bennett, James J ^b   Anderson, Gary F ^b   Cooley, Brent R ^b   Kowalczyk, Melissa ^c   Domick, Mark ^c   Gardinier, Timothy ^c  

^a IBM RESEARCH   (United States)

^b IBM   (United States)

^c State of New York Dept of Tax and Fin   (United States)

Author keywords

Business analytics and optimization; Constrained Markov Decision Process; Debt collection; Reinforcement learning

Indexed keywords

APPLICATION DOMAINS; BUSINESS ANALYTICS AND OPTIMIZATION; COMPETITIVE ADVANTAGE; CONSTRAINED MARKOV DECISION PROCESS; DATA MODELING; DATA SETS; DEBT COLLECTION; FINANCIAL INSTITUTION; NEW YORK STATE; OPTIMIZATION SYSTEM;

COMPETITION; MARKOV PROCESSES; REINFORCEMENT LEARNING; TAXATION;

CONSTRAINED OPTIMIZATION;

EID: 77956206696     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835817     Document Type: Conference Paper

References (20)

1. N. Abe, N. Verma, C. Apte, and R. Schroko. Cross channel optimized marketing by reinforcement learning. In Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM Press, 2004.
2. Eitan Altman. Asymptotic properties of constrained markov decision processes. Technical Report RR-1598, INRIA, 1993.
3. C. Apte, E. Bibelnieks, R. Natarajan, E. Pednault, F. Tipu, D. Campbell, and B. Nelson. Segmentation-based modeling for advanced targeted marketing. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 408-413. ACM, 2001.
4. L. C. Baird. Reinforcement learning in continuous time: Advantage updating. In Proceedings of the International Conference on Neural Networks, 1994.
5. S. Bradtke and M. Duff. Reinforcement learing methods for continuous-time Markov decision problems. In Advances in Neural Information Processing Systems, volume 7, pages 393-400. The MIT Press, 1995.
6. P. Domingos. MetaCost: A general method for making classifiers cost sensitive. In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining, pages 155-164. ACM Press, 1999.
7. C. Elkan. The foundations of cost-sensitive learning. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, August 2001.
8. L. P. Kaelbling, M. L. Littman, and A. W. Moore. Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 4, 1996.
9. D. Margineantu. On class probability estimates and cost-sensitive evaluation of classifiers. In Workshop Notes, Workshop on Cost-Sensitive Learning, International Conference on Machine Learning, June 2000.
10. R. Natarajan and E.P.D. Pednault. Segmented regression estimators for massive data sets. In Second SIAM International Conference on Data Mining, Arlington, Virginia, 2002. to appear.
11. E. Pednault, N. Abe, B. Zadrozny, H. Wang, W. Fan, and C. Apte. Sequential cost-sensitive decision making with reinforcement learning. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM Press, 2002.
12. F. Provost, P. Melville, and M. Saar-Tsechansky. Data acquisition and cost-effective predictive modeling: Targeting offers for electronic commerce. In Proceedings of the Ninth International Conference on Electronic Commerce, 2007.
13. M. L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and sons, Inc., 1994.
14. R. S. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. MIT Press, 1998.
15. J. N. Tsitsiklis and B. Van Roy. An analysis of temporal difference learning with function approximation. IEEE Transactions on Automatic Control, 42(5):674-690, 1997.
16. P. Turney. Cost-sensitive learning bibliography. Institute for Information Technology, National Research Council, Ottawa, Canada, 2000. http://extractor.iit.nrc.ca/bibliographies/cost-sensitive.html.
17. F. Wang and C. Zniolo. Xbit: An xml-based bitemporal data model. In Proceedings of the 23rd International Conference on Conceptual Modeling, pages 810-824, 2004.
18. C. J. C. H. Watkins. Learning from Delayed Rewards. PhD thesis, Cambridge University, Cambridge, 1989.
19. B. Zadrozny. Policy mining: Learning decision policies from fixed sets of data. PhD thesis, University of California, San Diego, 2003.
20. B. Zadrozny and C. Elkan. Obtaining calibrated probability estimates from decision trees and naive bayesian classifiers. In Proceedings of the Eighteenth International Conference on Machine Learning, 2001.