probabilistic graphical models
play

Probabilistic Graphical Models Christian Borgelt Dept. of Knowledge - PowerPoint PPT Presentation

Probabilistic Graphical Models Christian Borgelt Dept. of Knowledge Processing and Language Engineering Otto-von-Guericke-University of Magdeburg Universit atsplatz 2, D-39106 Magdeburg, Germany E-mail: borgelt@iws.cs.uni-magdeburg.de WWW:


  1. Probabilistic Graphical Models Christian Borgelt Dept. of Knowledge Processing and Language Engineering Otto-von-Guericke-University of Magdeburg Universit¨ atsplatz 2, D-39106 Magdeburg, Germany E-mail: borgelt@iws.cs.uni-magdeburg.de WWW: http://fuzzy.cs.uni-magdeburg.de/~borgelt 1

  2. Contents ✎ Inference Networks / Graphical Models ✎ Relational Networks: Decomposition and Reasoning ✎ Probabilistic Networks: Decomposition and Reasoning ✎ Conditional Independence Graphs ✎ Graphs and Decompositions ✎ Evidence Propagation in Graphs ✎ Danish Jersey Cattle Blood Type Determination: An Example ✎ Learning Relational Networks from Data ✎ Learning Probabilistic Networks from Data ✎ Probabilistic Networks and Causality ✎ Fault Analysis at DaimlerChrysler: An Application 2

  3. Inference Networks / Graphical Models ✎ Decomposition: Under certain conditions a distribution ✍ (e.g. a probability distribution) on a multi-dimensional domain, which encodes prior or generic knowledge about this domain, can be decomposed into a set ❢ ✍ 1 ❀ ✿ ✿ ✿ ❀ ✍ s ❣ of (overlapping) distributions on lower-dimensional subspaces. ✎ Simplified Reasoning: If such a decomposition is possible, it is sufficient to know the distributions on the subspaces to draw all inferences in the domain under consideration that can be drawn using the original distribution ✍ . ✎ Since such a decomposition is usually represented as a network and since it is used to draw inferences, it can be called an inference network . The edges of the network indicate the paths along which evidence has to be propagated. ✎ Another popular name is graphical model , where “graphical” indicates that it is based on a graph in the sense of graph theory. 3

  4. ✔ ✕ ✖ ✗ ✘ ✙ ✚ ✛ ✜ ✢ A Simple Example Example World Relation ☛ ✍ color shape size ☛ ✍ small ✡ ✍ medium ✡ ✍ small ✡ ☞ medium ✡ ☞ medium ✟ ✌ large ✠ ✌ medium ✠ ☞ medium ✠ ☞ medium ✎ 10 simple geometrical objects, 3 attributes. large ✎ One object is chosen at random and examined. ✎ Inferences are drawn about the unobserved attributes. 4

  5. ✩ ✩ ✩ ✩ ✩ ✩ ✩ ✩ ✥ ✪ ✥ ✥ ✥ ✥ ✥ ✪ ✏ ✩ The Reasoning Space ☛ ✡ ✟ ✠ ✟ ☞ ☞ ✌ ✍ large medium medium small ✎ The reasoning space consists of a finite set Ω of world states. ✎ The world states are described by a set of attributes ❆ ✐ , whose domains ❢ ❛ ( ✐ ) 1 ❀ ✿ ✿ ✿ ❀ ❛ ( ✐ ) ❦ i ❣ can be seen as sets of propositions or events. ✎ The events in a domain are mutually exclusive and exhaustive. ✎ The reasoning space is assumed to contain the true, but unknown state ✦ 0 . 5

  6. ✦ ✦ ★ ★ ★ ★ ✦ ★ ★ ✥ ✧ ✩ ✩ ★ The Relation in the Reasoning Space Relation Relation in the Reasoning Space ☛ ✡ ✟ ✠ ☛ ✍ color shape size ☞ ☛ ✍ small ✡ ✍ ✌ medium ✡ ✍ small ✍ ✡ ☞ medium ✡ ☞ medium ✟ ✌ large large ✠ ✌ medium medium small ✠ ☞ medium ✠ ☞ medium large Each cube represents one tuple. 6

  7. ✦ ✩ ❆ ✧❆ ❅ ❅ ✩ ✩ ✩ ★ ★ ✦ ✥ ✩ ✩ Reasoning ✎ Let it be known (e.g. from an observation) that the given object is green. This information considerably reduces the space of possible value combinations. ✎ From the prior knowledge it follows that the given object must be ✍ either a triangle or a square and ✍ either medium or large. ☛ ✡ ✟ ✠ ☛ ✡ ✟ ✠ ☞ ☞ ✌ ✌ ✍ ✍ large large medium medium small small 7

  8. ❅ ✩ ❆ ❆ ❆ ❆ ❆ ✩ ✩ ✩ ✩ ✩ ✩ ✪ ❆ ❅ ❅ ❅ ❅ ❅ ✪❆ ✩ ✩ ✩ ✩ ✩ ❆ ✩ ✩ ✧ ❇ ❇ ❇ ❇ ✪❇ ✩ ✩ ✩ ✩ ✩ ✩ ✥ ✩ ★ ★ ✦ ★ ★ ★ ★ ✦ ✦ ★ ✩ ✩ Prior Knowledge and Its Projections ☛ ✡ ✟ ✠ ☛ ✡ ✟ ✠ ☞ ☞ ✌ ✌ ✍ ✍ large large medium medium small small ☛ ✡ ✟ ✠ ☛ ✡ ✟ ✠ ☞ ☞ ✌ ✌ ✍ ✍ large large medium medium small small 8

  9. ✦ ✄ ✥ ★ ✦ ✦ ✦ ✦ ★ ✧ ✩ ✩ ✂ ★ ✧ ✩ ✩ ✧ ✥ ★ ★ ✦ ★ ★ ★ ★ ✥ ★ ✧ ✧ ✥ ✥ ✥ ✩ ✩ ✩ ★ ★ ★ ✪ ✪ ✪ ✪ ✪ Cylindrical Extensions and Their Intersection ☛ ✡ ✟ ✠ ☞ Intersecting the cylindrical ex- ✌ tensions of the projection to the subspace formed by color ✍ and shape and of the projec- tion to the subspace formed by large shape and size yields the origi- medium nal three-dimensional relation. small ☛ ✡ ✟ ✠ ☛ ✡ ✟ ✠ ☞ ☞ ✌ ✌ ✍ ✍ large large medium medium small small 9

  10. ❅ ❈ ❅ ❅ ❅ ❅ ❅ ❈ � ❈ ❈ � ❈ ❈ ✁ ❈ ❈❅ ❅ ❈ ❈ ✄ ❈ ❅ ❅ ❅ ❈ ❈ ❈ Reasoning with Projections The same result can be obtained using only the projections to the subspaces without reconstructing the original three-dimensional space: ☛ ✡ ✟ ✠ s m l size color project extend shape ☞ ☞ ✌ ✌ project extend ✍ ✍ ☛ ✡ ✟ ✠ s m l ✛ ✘ ✛ ✘ ✛ ✘ This justifies a network representation: color shape size ✚ ✙ ✚ ✙ ✚ ✙ 10

  11. ✩ ★ ✥ ✥ ✥ ✩ ✩ ✦ ✦ ✦ ★ ✥ ✄ ✂ ★ ✦ ✦ ★ ★ ★ ✥ ✥ ✦ ★ ✥ ✥ ✥ ✧ ✧ ✧ ✥ ✥ ★ ✦ ✦ ✦ ✦ ✦ ✦ ✦ ✦ ✦ ✩ ★ ★ ✧ ✦ ✦ ★ ★ ✦ ✦ ✧ ★ ✥ ✥ ✥ ✧ ✥ ✩ ✩ ★ ✦ ✩ ✩ ✥ ✧ Using other Projections ☛ ✡ ✟ ✠ ☛ ✡ ✟ ✠ ☞ ☞ ✌ ✌ ✍ ✍ large large medium medium small small ☛ ✡ ✟ ✠ ☛ ✡ ✟ ✠ ☞ ☞ ✌ ✌ ✍ ✍ large large medium medium small small 11

  12. ❅ ✩ ❆ ❆ ❆ ❆ ❆ ❆ ✪❆ ✩ ✩ ✩ ✩ ✩ ✩ ✩ ✩ ✪ ❅ ❅ ❅ ✩ ❅ ❅ ✩ ✩ ✩ ❆ ✩ ✩ ✧ ❇ ❇ ❇ ❇ ✪❇ ✩ ✩ ✩ ✩ ✩ ✩ ✥ ✩ ★ ★ ✦ ★ ★ ★ ★ ✦ ✦ ★ ✦ ✦ ✩ Is Decomposition Always Possible? ☛ ✡ ✟ ✠ ☛ ✡ ✟ ✠ ☞ ☞ ✌ ✌ ✍ ✍ 2 large large medium medium 1 small small ☛ ✡ ✟ ✠ ☛ ✡ ✟ ✠ ☞ ☞ ✌ ✌ ✍ ✍ large large medium medium small small 12

  13. Possibility-Based Formalization Definition: Let Ω be a (finite) sample space. A discrete possibility measure ❘ on Ω is a function ❘ : 2 Ω ✦ ❢ 0 ❀ 1 ❣ satisfying 1. ❘ ( ❀ ) = 0 and 2. ✽ ❊ 1 ❀ ❊ 2 ✒ Ω : ❘ ( ❊ 1 ❬ ❊ 2 ) = max ❢ ❘ ( ❊ 1 ) ❀ ❘ ( ❊ 2 ) ❣ . ✎ Similar to Kolmogorov’s axioms of probability theory. ✎ If an event ❊ can occur (if it is possible), then ❘ ( ❊ ) = 1 ❀ otherwise (if ❊ cannot occur/is impossible) then ❘ ( ❊ ) = 0 ✿ ✎ ❘ (Ω) = 1 is not required, because this would exclude the empty relation. ✎ From the axioms it follows ❘ ( ❊ 1 ❭ ❊ 2 ) ✔ min ❢ ❘ ( ❊ 1 ) ❀ ❘ ( ❊ 2 ) ❣ ✿ ✎ Attributes are introduced as random variables (as in probability theory). ✎ ❘ ( ❆ = ❛ ) is an abbreviation of ❘ ( ❢ ✦ ❥ ❆ ( ✦ ) = ❛ ❣ ) 13

  14. Possibility-Based Formalization (continued) Definition: Let ❳ = ❢ ❆ 1 ❀ ✿ ✿ ✿ ❀ ❆ ♥ ❣ be a set of attributes defined on a (finite) sample space Ω with respective domains dom( ❆ ✐ ), ✐ = 1 ❀ ✿ ✿ ✿ ❀ ♥ . A relation r ❳ over ❳ is the restriction of a discrete possibility measure ❘ on Ω to the set of all events that can be defined by stating values for all attributes in ❳ . That is, r ❳ = ❘ ❥ ❊ X , where � � � ❊ ✷ 2 Ω ❊ ❳ = � ✾ ❛ 1 ✷ dom( ❆ 1 ) : ✿ ✿ ✿ ✾ ❛ ♥ ✷ dom( ❆ ♥ ) : � � ❊ � = ❆ ❥ = ❛ ❥ ❆ j ✷ ❳ � � � ❊ ✷ 2 Ω = � ✾ ❛ 1 ✷ dom( ❆ 1 ) : ✿ ✿ ✿ ✾ ❛ ♥ ✷ dom( ❆ ♥ ) : � � �� � � ❊ = ✦ ✷ Ω ❆ ❥ ( ✦ ) = ❛ ❥ ✿ � ❆ j ✷ ❳ ✎ Corresponds to the notion of a probability distribution. ✎ Advantage of this formalization: No index transformation functions are needed for projections, there are just fewer terms in the conjunctions. 14

  15. Possibility-Based Formalization (continued) Definition: Let ❯ = ❢ ❆ 1 ❀ ✿ ✿ ✿ ❀ ❆ ♥ ❣ be a set of attributes and r ❯ a relation over ❯ . Furthermore, let ▼ = ❢ ▼ 1 ❀ ✿ ✿ ✿ ❀ ▼ ♠ ❣ ✒ 2 ❯ be a set of nonempty (but not neces- sarily disjoint) subsets of ❯ satisfying � ▼ = ❯✿ ▼ ✷▼ r ❯ is called decomposable w.r.t. ▼ iff ✽ ❛ 1 ✷ dom( ❆ 1 ) : ✿ ✿ ✿ ✽ ❛ ♥ ✷ dom( ❆ ♥ ) : � � � � �� � � r ❯ ❆ ✐ = ❛ ✐ = min r ▼ ❆ ✐ = ❛ ✐ ✿ ▼ ✷▼ ❆ i ✷ ❯ ❆ i ✷ ▼ If r ❯ is decomposable w.r.t. ▼ , the set of relations ❘ ▼ = ❢ r ▼ 1 ❀ ✿ ✿ ✿ ❀ r ▼ m ❣ = ❢ r ▼ ❥ ▼ ✷ ▼❣ is called the decomposition of r ❯ . 15

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend