CS 4100 Artificial Intelligence

Slides:



Advertisements
Similar presentations
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes March 27, 2012.
Advertisements

BAYESIAN NETWORKS. Bayesian Network Motivation  We want a representation and reasoning system that is based on conditional independence  Compact yet.
Identifying Conditional Independencies in Bayes Nets Lecture 4.
5/17/20151 Probabilistic Reasoning CIS 479/579 Bruce R. Maxim UM-Dearborn.
Reasoning under Uncertainty: Conditional Prob., Bayes and Independence Computer Science cpsc322, Lecture 25 (Textbook Chpt ) March, 17, 2010.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
Probability Notation Review Prior (unconditional) probability is before evidence is obtained, after is posterior or conditional probability P(A) – Prior.
1 CS 430 / INFO 430 Information Retrieval Lecture 12 Probabilistic Information Retrieval.
1 CS 430 / INFO 430 Information Retrieval Lecture 12 Probabilistic Information Retrieval.
Bayesian Belief Networks
1 Bayesian Reasoning Chapter 13 CMSC 471 Adapted from slides by Tim Finin and Marie desJardins.
Artificial Intelligence and Lisp Lecture 7 LiU Course TDDC65 Autumn Semester, 2010
Representing Uncertainty CSE 473. © Daniel S. Weld 2 Many Techniques Developed Fuzzy Logic Certainty Factors Non-monotonic logic Probability Only one.
1 CS 430 / INFO 430 Information Retrieval Lecture 10 Probabilistic Information Retrieval.
CPSC 322, Lecture 24Slide 1 Reasoning under Uncertainty: Intro to Probability Computer Science cpsc322, Lecture 24 (Textbook Chpt 6.1, 6.1.1) March, 15,
Mutually Exclusive: P(not A) = 1- P(A) Complement Rule: P(A and B) = 0 P(A or B) = P(A) + P(B) - P(A and B) General Addition Rule: Conditional Probability:
Semantic Web Technologies Lecture # 2 Faculty of Computer Science, IBA.
Artificial Intelligence CS 165A Tuesday, November 27, 2007  Probabilistic Reasoning (Ch 14)
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes April 3, 2012.
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes March 15and20, 2012.
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes March 13, 2012.
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes March 20, 2012.
Random Experiment Random Variable: Continuous, Discrete Sample Space: S Event: A, B, E Null Event Complement of an Event A’ Union of Events (either, or)
Artificial Intelligence CS 165A Tuesday, November 20, 2007  Knowledge Representation (Ch 10)  Uncertainty (Ch 13)
1 Monte Carlo Artificial Intelligence: Bayesian Networks.
CSE PR 1 Reasoning - Rule-based and Probabilistic Representing relations with predicate logic Limitations of predicate logic Representing relations.
Chapter 13 February 19, Acting Under Uncertainty Rational Decision – Depends on the relative importance of the goals and the likelihood of.
Probability Course web page: vision.cis.udel.edu/cv March 19, 2003  Lecture 15.
METU Informatics Institute Min720 Pattern Classification with Bio-Medical Applications Lecture notes 9 Bayesian Belief Networks.
CS 416 Artificial Intelligence Lecture 14 Uncertainty Chapters 13 and 14 Lecture 14 Uncertainty Chapters 13 and 14.
CHAPTER 5 Probability Theory (continued) Introduction to Bayesian Networks.
Uncertainty ECE457 Applied Artificial Intelligence Spring 2007 Lecture #8.
Decision Making Under Uncertainty - Bayesian Techniques.
An Example of {AND, OR, Given that} Using a Normal Distribution By Henry Mesa.
Chapter 12. Probability Reasoning Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Recuperação de Informação B Modern Information Retrieval Cap. 2: Modeling Section 2.8 : Alternative Probabilistic Models September 20, 1999.
Computer Science cpsc322, Lecture 25
ECE457 Applied Artificial Intelligence Fall 2007 Lecture #8
Virtual University of Pakistan
Reasoning Under Uncertainty: Belief Networks
CS 188: Artificial Intelligence Spring 2007
Quantitative methods Lecture 1.
Bayesian networks Chapter 14 Section 1 – 2.
Presented By S.Yamuna AP/CSE
Quick Review Probability Theory
Quick Review Probability Theory
Read R&N Ch Next lecture: Read R&N
Bayesian Networks: A Tutorial
CS 4/527: Artificial Intelligence
Advanced Placement Statistics
Read R&N Ch Next lecture: Read R&N
Representing Uncertainty
Advanced Artificial Intelligence
Probabilistic Reasoning; Network-based reasoning
Professor Marie desJardins,
CS 188: Artificial Intelligence Fall 2008
CAP 5636 – Advanced Artificial Intelligence
CS 188: Artificial Intelligence Fall 2007
CS 188: Artificial Intelligence Fall 2007
CS 188: Artificial Intelligence Fall 2008
Class #21 – Monday, November 10
CS 188: Artificial Intelligence
LESSON 5: PROBABILITY Outline Probability Events
Exam 2 - Review Chapters
Probabilistic Reasoning
Read R&N Ch Next lecture: Read R&N
Chapter 14 February 26, 2004.
ECE457 Applied Artificial Intelligence Spring 2008 Lecture #8
basic probability and bayes' rule
List of your team members Member 1 Member 2 Member 3
Presentation transcript:

CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes March 22, 2012

Guidelines for AI Term Project Proposals Should be a 2-4 page printable document, including a title for your project, name and members of your team (with email addresses), the course, semester, date, etc. Introduce the domain and give some preliminary examples of concepts that will probably be important in your ontology. You should mention at least one taxonomy and one relationship that will need to be modeled. Justify that planning is useful/necessary in this domain. For example you might mention a simple (even trivial) kind of planning that needs to take place. Make a start at describing some planning goals/tasks that will require non-trivial knowledge and reasoning. Mention the planning technique you intend to apply to this (STRIPS operators or formal logic/Situation Calculus). It is not necessary to mention or discuss Protégé implementation.

Conditional Probability P(X | A,B,C) defined as P(X,A,B,C) / P(A,B,C) Assuming Boolean Random Variables 8 values of the conditions A B C Adding up all P(X,A,B,C) gives us “prior” probability of X P(~X | A, B, C) = 1 – P(X | A, B, C)

Conditional Probability Chain rules says: P(A, B, C) = P(A | B, C) P(B, C) = P(A | B, C) P(B | C) P(C) can also be written P(A) P(B | A) P(C | A, B) Bayes rules says: P(X | A,B,C) = P(A,B,C | X) P(X) / P(A,B,C) *We call α = 1/P(A,B,C) and it applies to all values of X And write: P(X | A,B,C) = α P(A,B,C | X) P(X)

Conditional Probability This is interesting when there is some independence Conditional independence of 2 variables: P(X , Y | Z) = P(X | Z) P(Y | Z) Therefore if A, B, and C are conditionally independent of X INSTEAD OF P(X | A,B,C) = = α P(A,B,C | X) P(X) = α P(A |X) P(B | A, X) P(C | A, B, X) P(X) We get: P(X | A,B,C) = α P(A,B,C | X) P(X) = α P(A| X) P(B | X) P(C| X) P(X)

How to construct a Bayes Net

Test your understanding: design a Bayes net with plausible numbers

Calculating using Bayes’ Nets You can construct JPTable but often that is overkill