47 1 introduction
play

47.1 Introduction chapter overview: 46. Introduction and - PowerPoint PPT Presentation

May 12, 2023 •253 likes •332 views

Foundations of Artificial Intelligence May 24, 2017 47. Uncertainty: Representation Foundations of Artificial Intelligence 47.1 Introduction 47. Uncertainty: Representation 47.2 Conditional Independence Malte Helmert and Gabriele R oger

  1. Foundations of Artificial Intelligence May 24, 2017 — 47. Uncertainty: Representation Foundations of Artificial Intelligence 47.1 Introduction 47. Uncertainty: Representation 47.2 Conditional Independence Malte Helmert and Gabriele R¨ oger 47.3 Bayesian Networks University of Basel May 24, 2017 47.4 Summary M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 1 / 24 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 2 / 24 47. Uncertainty: Representation Introduction Uncertainty: Overview 47.1 Introduction chapter overview: ◮ 46. Introduction and Quantification ◮ 47. Representation of Uncertainty M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 3 / 24 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 4 / 24

  2. 47. Uncertainty: Representation Introduction 47. Uncertainty: Representation Introduction Running Example Full Joint Probability Distribution: Discussion We continue the dentist example. Advantage: Contains all necessary information toothache ¬ toothache Disadvantage: Prohibitively large in practice: catch ¬ catch catch ¬ catch Table for n Boolean variables has size O (2 n ). cavity 0 . 108 0 . 012 0 . 072 0 . 008 ¬ cavity 0 . 016 0 . 064 0 . 144 0 . 576 Good for theoretical foundations, but what to do in practice? M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 5 / 24 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 6 / 24 47. Uncertainty: Representation Conditional Independence 47. Uncertainty: Representation Conditional Independence Reminder: Bayes’ Rule General version with multivalued variables and conditioned on 47.2 Conditional Independence some background evidence e : P ( Y | X , e ) = P ( X | Y , e ) P ( Y | e ) P ( X | e ) M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 7 / 24 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 8 / 24

  3. 47. Uncertainty: Representation Conditional Independence 47. Uncertainty: Representation Conditional Independence Multiple Evidence Conditional Independence: Example toothache ¬ toothache If we already know that the probe catches and the tooth aches, catch ¬ catch catch ¬ catch we could compute the probability that this patient has cavity from cavity 0 . 108 0 . 012 0 . 072 0 . 008 P ( Cavity | catch ∧ toothache ) ¬ cavity 0 . 016 0 . 064 0 . 144 0 . 576 = α P ( catch ∧ toothache | Cavity ) P ( Cavity ) . Variables Toothache and Catch not independent Problem: Need conditional probability for catch ∧ toothache but independent given the presence or absence of cavity: Problem: for each value of Cavity . Problem: � same scalability problem as with full joint distribution P ( Toothache , Catch | Cavity ) = P ( Toothache | Cavity ) P ( Catch | Cavity ) M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 9 / 24 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 10 / 24 47. Uncertainty: Representation Conditional Independence 47. Uncertainty: Representation Conditional Independence Conditional Independence Conditional Independence and Multiple Evidence Example Multiple evidence: Definition P ( Cavity | catch ∧ toothache ) Two variables X and Y are conditionally independent given a third variable Z if = α P ( catch ∧ toothache | Cavity ) P ( Cavity ) = α P ( toothache | Cavity ) P ( catch | Cavity ) P ( Cavity ) . P ( X , Y | Z ) = P ( X | Z ) P ( Y | Z ) . � No need for conditional joint probabilities for conjunctions M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 11 / 24 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 12 / 24

  4. 47. Uncertainty: Representation Conditional Independence 47. Uncertainty: Representation Bayesian Networks Conditional Independence: Decomposition of Joint Dist. Full joint distribution: 47.3 Bayesian Networks P ( Toothache , Catch , Cavity ) = P ( Toothache , Catch | Cavity ) P ( Cavity ) = P ( Toothache | Cavity ) P ( Catch | Cavity ) P ( Cavity ) � Large table can be decomposed into three smaller tables. For n symptoms that are all conditionally independent given Cavity the representation grows as O ( n ) instead of O (2 n ). M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 13 / 24 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 14 / 24 47. Uncertainty: Representation Bayesian Networks 47. Uncertainty: Representation Bayesian Networks Bayesian Networks Bayesian Network: Example Definition P ( B ) P ( E ) Burglary Earthquake .001 .002 A Bayesian network is a directed acyclic graph, where ◮ each node corresponds to a random variable, B E P ( A ) ◮ each node X has an associated t t .95 Alarm t f .94 conditional probability distribution P ( X | parents ( X )) f t .29 f f .001 that quantifies the effect of the parents on the node. Bayesian networks are also called belief networks A P ( J ) A P ( M ) or probabilistic networks. MaryCalls JohnCalls t .9 0 t .7 0 f .0 5 f .0 1 They are a subclass of graphical models. M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 15 / 24 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 16 / 24

  5. 47. Uncertainty: Representation Bayesian Networks 47. Uncertainty: Representation Bayesian Networks Semantics Naive Construction The semantics for Bayesian networks expresses that ◮ the information associated to each node represents a conditional probability distribution, and that Order all variables, e.g.. as X 1 , . . . , X n . ◮ each variable is conditionally independent For i = 1 to n do: of its non-descendants given its parents. ◮ Choose from X 1 , . . . , X i − 1 a minimal set of parents of X i such that P ( X i | X i − 1 , . . . , X 1 ) = P ( X i = x i | parents ( X i )). Definition ◮ For each parent insert a link from the parent to X i . A Bayesian network with nodes { X 1 , . . . , X n } represents ◮ Define conditional probability table P ( X i | parents ( X i )). the full joint probability given by n � P ( X 1 = x 1 ∧ · · · ∧ X n = x n ) = P ( X i = x i | parents ( X i )) . i =1 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 17 / 24 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 18 / 24 47. Uncertainty: Representation Bayesian Networks 47. Uncertainty: Representation Bayesian Networks Compactness Influence of Node Ordering A bad node ordering can lead to large numbers of parents and probabiliy distributions that are hard to specify. Compactness of Bayesian networks stems from local structures in domains, where random variables are MaryCalls MaryCalls directly influenced only by a small number of variables. JohnCalls JohnCalls ◮ n Boolean random variables ◮ each variable directly influenced by at most k others Earthquake Alarm ◮ full joint probability distribution contains 2 n numbers ◮ Bayesian network can be specified by n 2 k numbers Burglary Burglary Alarm Earthquake (a) (b) M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 19 / 24 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 20 / 24

  6. 47. Uncertainty: Representation Bayesian Networks 47. Uncertainty: Representation Bayesian Networks Conditional Independence Given Parents Conditional Independence Given Markov Blanket Each variable is conditionally independent of its non-descendants The Markov blanket of a node consists given its parents. of its parents, children and children’s other parents. . . . U 1 U m U 1 U m . . . Each variable is X conditionally independent Z 1 j Z nj X of all other nodes in the Z 1 j Z nj network given its Markov Y Y n . . . blanket (gray area). 1 Y 1 Y n . . . X is conditionally independent of the nodes Z ij given U 1 . . . U m . M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 21 / 24 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 22 / 24 47. Uncertainty: Representation Summary 47. Uncertainty: Representation Summary Summary & Outlook Summary ◮ Conditional independence is weaker than (unconditional) independence but occurs more frequently. 47.4 Summary ◮ Bayesian networks exploit conditional independence to compactly represent joint probability distributions. Outlook ◮ There are exact and approximate inference algorithms for Bayesian networks. ◮ Exact inference in Bayesian networks is NP-hard (but tractable for some sub-classes such as poly-trees). ◮ All concepts can be extended to continuous random variables. M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 23 / 24 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 24 / 24

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

INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION

INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION

TRAINING COURSE ON SOCIAL PROTECTION & FORMALIZATION TRINIDAD AND TOBAGO MARCH 15, 2017 INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION Design of the NIS Assistance from the

547 views • 23 slides
INTRODUCTION Introduction 2/42 INTRODUCTION Alternations I am giving bread to the

INTRODUCTION Introduction 2/42 INTRODUCTION Alternations I am giving bread to the

Patterns of variation in the expression of case and agreement Andrs Brny Leiden University Centre for Linguistics 9 November 2019, BaSIS Workshop a.barany@hum.leidenuniv.nl INTRODUCTION Introduction 2/42 INTRODUCTION

1.37k views • 42 slides
Introduction Introduction Introduction Introduction Outline Motivation Failures

Introduction Introduction Introduction Introduction Outline Motivation Failures

Introduction Introduction Introduction Introduction Outline Motivation Failures Definition and concepts Process and product properties Principles SE Approaches Motivation Software and the economy The economies of

1.03k views • 49 slides
Introduction Introduction Introduction Nationwide Cause for Concern 1

Introduction Introduction Introduction Nationwide Cause for Concern 1

Introduction Introduction Introduction Nationwide Cause for Concern 1 https://www.cdc.gov/std/stats17/infographic.htm Introduction Epidemiology in Western Colorado CPHE Surveillance Data Report, May 2018 Chlamydia Epidemiology in Western

977 views • 39 slides
DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every

DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every

DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every meeting (2) Some ideas of diagrams for section 7.1 (Introduction) of TP. Giles Barr 25 Jan 2018, Pembroke College On DUNE, the reality is there is a

474 views • 10 slides
INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT

INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT

ADVANCED COMPUTER SECURITY INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT IS SECURITY? A systems security policies describe What the system is supposed to do Store and provide access

479 views • 16 slides
Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL

Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL

Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL Writing a SMIL file Adding Media Objects Martin Halvey Clipping media files January 2008 Timing and Synchronising Layout World Wide

387 views • 14 slides
14 Introduction Introduction Bad guys can put malware into Example: hosts

14 Introduction Introduction Bad guys can put malware into Example: hosts

Introduction Introduction source Encapsulation ISO/OSI reference model message M application segment H t H t M transport network datagram H n H n H t M presentation: allow applications to frame link H l H n H t M interpret

583 views • 4 slides
Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL

Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL

Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL Writing a SMIL file Adding Media Objects Martin Halvey Clipping media files January 2008 Timing and Synchronising Layout

322 views • 8 slides
Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL

Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL

Introduction Zynq Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL Processing System Processor Peripherals Data Buses AXI Bus Conclusion BTE5380 - Embedded Systems Octobre 2014 Andreas Habegger

1.81k views • 30 slides
2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04

2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04

2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04 Project References S E 5 PART.1 SMILE5 Introduction M I L Introduction STORION-SMILE5 Residential Energy Storage System Inverter 5kW Output Input

1.06k views • 25 slides
Introduction to CICS Course introduction Course introduction What is CICS? What is an

Introduction to CICS Course introduction Course introduction What is CICS? What is an

Introduction to CICS Course introduction Course introduction What is CICS? What is an application server? Why use an application server? Course introduction Services provided by CICS How CICS applications are defined Scaling CICS to meet

1.84k views • 146 slides
Network Visualization Introduction Presented by Shahed Introduction Introduction Basic

Network Visualization Introduction Presented by Shahed Introduction Introduction Basic

Network Visualization Introduction Presented by Shahed Introduction Introduction Basic building blocks Node Links (relationship between nodes) Spatial information Network data

584 views • 9 slides
Introduction Introduction (1) Main argument of the paper: universities are not only

Introduction Introduction (1) Main argument of the paper: universities are not only

Le jugement des pairs comme outil de management des universits Peer-review as a management tool Christine Musselin (CSO, Sciences Po et CNRS) Avril 2013, Lirrsistible ascension du capitalisme acadmique Introduction Introduction (1)

590 views • 28 slides
Introduction Introduction to storage and to storage and filesystems filesystems Introduction

Introduction Introduction to storage and to storage and filesystems filesystems Introduction

Moreno Baricevic Gilberto Daz Axel Kohlmeyer Stefano Cozzini ULA ICTP CNR-IOM DEMOCRITOS Merida, VENEZUELA Trieste, ITALY Trieste, ITALY Introduction Introduction to storage and to storage and filesystems filesystems Introduction

1.19k views • 51 slides
JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of

JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of

JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of the brand new JA-100 alarm system Visions Basic architecture System components Setting Help us with final validations You are the FIRST ones

1.69k views • 111 slides
Graphical Models Independence & Factorization Including structure Complexity of

Graphical Models Independence & Factorization Including structure Complexity of

Graphical Models slides adopted from Sandro Schnborn 1 Graphical Models Independence & Factorization Including structure Complexity of multivariate problems Independence assumptions Graphical Models Graphs to depict

385 views • 23 slides
Guest Lectures: Bettina Speckmann, Cartography & Flow; Yang Wang, Architectures for Scale.

Guest Lectures: Bettina Speckmann, Cartography & Flow; Yang Wang, Architectures for Scale.

Guest Lectures: Bettina Speckmann, Cartography & Flow; Yang Wang, Architectures for Scale. Example Present: Biomechanical Motion; Proposals Expectations Tamara Munzner Department of Computer Science University of British Columbia CPSC

647 views • 28 slides
Today CS 188: Artificial Intelligence Uncertainty Spring 2006 Probability Basics

Today CS 188: Artificial Intelligence Uncertainty Spring 2006 Probability Basics

Today CS 188: Artificial Intelligence Uncertainty Spring 2006 Probability Basics Joint and Condition Distributions Models and Independence Lecture 8: Probability Bayes Rule 2/9/2006 Estimation Utility Basics Value

185 views • 6 slides
Presidential Management Fellows (PMF) Program PMF Class of 2021 Application Cycle Briefing for

Presidential Management Fellows (PMF) Program PMF Class of 2021 Application Cycle Briefing for

Presidential Management Fellows (PMF) Program PMF Class of 2021 Application Cycle Briefing for Academic Stakeholders www.PMF.gov 1 What is PMF? A call to lead, a call to serve The Presidential Management Fellows (PMF) Program is the

684 views • 30 slides
Technology Solutions for Financial Inclusion-Indian Models PART - A Deepankar Roy, Ph.D.

Technology Solutions for Financial Inclusion-Indian Models PART - A Deepankar Roy, Ph.D.

Technology Solutions for Financial Inclusion-Indian Models PART - A Deepankar Roy, Ph.D. National Institute of Bank Management, Pune, India Information and Communication Technology (ICT) Financial Inclusion, without the intensive use of ICT

135 views • 10 slides
Ap ery numbers and their experimental siblings Challenges in 21st Century Experimental

Ap ery numbers and their experimental siblings Challenges in 21st Century Experimental

Ap ery numbers and their experimental siblings Challenges in 21st Century Experimental Mathematical Computation ICERM, Brown University Armin Straub July 22, 2014 University of Illinois at UrbanaChampaign n 2 n + k 2 n

610 views • 42 slides
Natural Language Processing Lecture 2: Words and Morphology Linguistic Morphology The shape of

Natural Language Processing Lecture 2: Words and Morphology Linguistic Morphology The shape of

Natural Language Processing Lecture 2: Words and Morphology Linguistic Morphology The shape of Words to Come What? Linguistics? What? Linguistics? One common complaint we receive in this course goes One common complaint we receive in

584 views • 45 slides
CSE 473: Artificial Intelligence Autumn 2011 Adversarial Search Luke Zettlemoyer Based on

CSE 473: Artificial Intelligence Autumn 2011 Adversarial Search Luke Zettlemoyer Based on

CSE 473: Artificial Intelligence Autumn 2011 Adversarial Search Luke Zettlemoyer Based on slides from Dan Klein Many slides over the course adapted from either Stuart Russell or Andrew Moore 1 Today Adversarial Search Minimax

1.03k views • 49 slides

More recommend