Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur Graph Search.
Concept
Diagramme d'influence
Résumé
An influence diagram (ID) (also called a relevance diagram, decision diagram or a decision network) is a compact graphical and mathematical representation of a decision situation. It is a generalization of a Bayesian network, in which not only probabilistic inference problems but also decision making problems (following the maximum expected utility criterion) can be modeled and solved.
ID was first developed in the mid-1970s by decision analysts with an intuitive semantic that is easy to understand. It is now adopted widely and becoming an alternative to the decision tree which typically suffers from exponential growth in number of branches with each variable modeled. ID is directly applicable in team decision analysis, since it allows incomplete sharing of information among team members to be modeled and solved explicitly. Extensions of ID also find their use in game theory as an alternative representation of the game tree.
An ID is a directed acyclic graph with three types (plus one subtype) of node and three types of arc (or arrow) between nodes.
Nodes:
Decision node (corresponding to each decision to be made) is drawn as a rectangle.
Uncertainty node (corresponding to each uncertainty to be modeled) is drawn as an oval.
Deterministic node (corresponding to special kind of uncertainty that its outcome is deterministically known whenever the outcome of some other uncertainties are also known) is drawn as a double oval.
Value node (corresponding to each component of additively separable Von Neumann-Morgenstern utility function) is drawn as an octagon (or diamond).
Arcs:
Functional arcs (ending in value node) indicate that one of the components of additively separable utility function is a function of all the nodes at their tails.
Conditional arcs (ending in uncertainty node) indicate that the uncertainty at their heads is probabilistically conditioned on all the nodes at their tails.
Conditional arcs (ending in deterministic node) indicate that the uncertainty at their heads is deterministically conditioned on all the nodes at their tails.
Source officielle
À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.
Proximité ontologique
Cours associés (1)
MGT-448: Statistical inference and machine learning
This course aims to provide graduate students a thorough grounding in the methods, theory, mathematics and algorithms needed to do research and applications in machine learning. The course covers topi
Séances de cours associées (10)
Construire un arbre de décision
Couvre les arbres de décision de construction pour classer les champignons comme toxiques ou non.
Compilation et C++ Basics
Couvre les bases de la compilation et de la programmation C ++, y compris les variables, les fonctions, les boucles et le débogage.
Problème de limite de membrane élastique 2D
Couvre le problème de limite de membrane élastique en 2D, explorant la formulation mathématique et les méthodes de solution.
Publications associées (31)
Personnes associées (7)