Using adaptive learning in credit scoring to estimate take-up probability distribution
暂无分享,去创建一个
[1] Jonathan N. Crook,et al. Credit Scoring and Its Applications , 2002, SIAM monographs on mathematical modeling and computation.
[2] Evan L. Porteus. Some Bounds for Discounted Sequential Decision Processes , 1971 .
[3] P. Whittle. Restless bandits: activity allocation in a changing world , 1988, Journal of Applied Probability.
[4] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[5] R. Meyer,et al. Sequential Choice Under Ambiguity: Intuitive Solutions to the Armed-Bandit Problem , 1995 .
[6] Andrew B. Whinston,et al. Dynamic profiling of consumers for customized offerings over the Internet: a model and analysis , 2001, Decis. Support Syst..
[7] Peter E. Rossi,et al. The Value of Purchase History Data in Target Marketing , 1996 .
[8] Ramayya Krishnan,et al. E-Business and Management Science: Mutual Impacts (Part 2 of 2) , 2003, Manag. Sci..
[9] Sumit Sarkar,et al. The Role of the Management Sciences in Research on Personalization , 2003, Manag. Sci..
[10] Alan L. Montgomery,et al. Special Issue: OR/MS and E-Business: Applying Quantitative Marketing Techniques to the Internet , 2001, Interfaces.
[11] J. MacQueen. A MODIFIED DYNAMIC PROGRAMMING METHOD FOR MARKOVIAN DECISION PROBLEMS , 1966 .
[12] Evan L. Porteus. Foundations of Stochastic Inventory Theory , 2002 .
[13] J. Gani,et al. Progress in statistics , 1975 .
[14] J. Bather,et al. Multi‐Armed Bandit Allocation Indices , 1990 .