Computing Upper and Lower Bounds in Interval Decision Trees

Danielson, MatsKTH,Data- och systemvetenskap, DSV,Stockholm University (författare)

VR-Computer Science
QC 20110812
This article presents algorithms for computing optima in decision trees with imprecise probabilities and utilities. In tree models involving uncertainty expressed as intervals and/or relations, it is necessary for the evaluation to compute the upper and lower bounds of the expected values. Already in its simplest form, computing a maximum of expectancies leads to quadratic programming (QP) problems. Unfortunately, standard optimization methods based on QP (and BLP - bilinear programming) are too slow for the evaluation of decision trees in computer tools with interactive response times. Needless to say, the problems with computational complexity are even more emphasized in multi-linear programming (MLP) problems arising from multi-level decision trees. Since standard techniques are not particularly useful for these purposes, other, non-standard algorithms must be used. The algorithms presented here enable user interaction in decision tools and are equally applicable to all multi-linear programming problems sharing the same structure as a decision tree.

Ekenberg, LoveKTH,Mittuniversitetet,Institutionen för informationsteknologi och medier (-2013),Data- och systemvetenskap, DSV(Swepub:kth)u1b0ge2m (författare)
KTHData- och systemvetenskap, DSV (creator_code:org_t)

Ingår i:European Journal of Operational Research: Elsevier BV181:2, s. 808-8160377-22171872-6860

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.