Minimax regret spanning arborescences under uncertain costs.
Eduardo CondeAlfredo CandiaPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- minimax regret
- misclassification costs
- cost sensitive
- preference elicitation
- utility function
- total cost
- class distribution
- naive bayes
- decision problems
- incomplete information
- stochastic programming
- classification error
- multi class
- training examples
- dynamic programming
- decision making
- class imbalance
- active learning
- computational complexity
- training data