.png){kind=icon}
.png){kind=icon}
Return
Learning Predictive Choice Models for Decision Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2013.173.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Probabilistic predictive models are often used in decision optimization applications. Optimal decision making in these applications critically depends on the performance of the predictive models, especially the accuracy of their probability estimates. In this paper, we propose a probabilistic model for revenue maximization and cost minimization across applications in which a decision making agent is faced with a group of possible customers and either offers a variable discount on a product or service or expends a variable cost to attract positive responses. The model is based directly on optimizing expected revenue and makes explicit the relationship between revenue and the customer's response behavior. We derive an expectation maximization ( EM) procedure for learning the parameters of the model from historical data, prove that the model is asymptotically insensitive to selection bias in historical decisions, and demonstrate in a series of experiments the method's utility for optimizing financial aid decisions at an international institute of higher learning.
Keywords:
Predictive choice models
decision optimization
sparse data
em algorithm
sample selection bias
imbalance data
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W