SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:miun-4034"
 

Search: onr:"swepub:oai:DiVA.org:miun-4034" > Computing Upper and...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • Danielson, MatsKTH,Data- och systemvetenskap, DSV,Stockholm University (author)

Computing Upper and Lower Bounds in Interval Decision Trees

  • Article/chapterEnglish2007

Publisher, publication year, extent ...

  • Elsevier BV,2007
  • printrdacarrier

Numbers

  • LIBRIS-ID:oai:DiVA.org:miun-4034
  • https://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-4034URI
  • https://doi.org/10.1016/j.ejor.2006.06.030DOI
  • https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-37431URI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:ref swepub-contenttype
  • Subject category:art swepub-publicationtype

Notes

  • 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.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

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

Related titles

  • In:European Journal of Operational Research: Elsevier BV181:2, s. 808-8160377-22171872-6860

Internet link

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Danielson, Mats
Ekenberg, Love
About the subject
NATURAL SCIENCES
NATURAL SCIENCES
and Computer and Inf ...
and Computer Science ...
NATURAL SCIENCES
NATURAL SCIENCES
and Computer and Inf ...
Articles in the publication
European Journal ...
By the university
Mid Sweden University
Royal Institute of Technology

Search outside SwePub

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.

 
pil uppåt Close

Copy and save the link in order to return to this view