Introduction to Probability (CSCE 317)

Slides:



Advertisements
Similar presentations
Chapter 2 Probability. 2.1 Sample Spaces and Events.
Advertisements

COUNTING AND PROBABILITY
Chapter 7 Probability 7.1 Experiments, Sample Spaces, and Events
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering An Introduction to Bayesian Networks March 16, 2010 Marco Valtorta SWRG 3A55.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering An Introduction to Bayesian Networks September 12, 2003 Marco Valtorta SWRG.
1 Definitions Experiment – a process by which an observation ( or measurement ) is observed Sample Space (S)- The set of all possible outcomes (or results)
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering An Introduction to Bayesian Networks January 10, 2006 Marco Valtorta SWRG 3A55.
1 Definitions Experiment – a process by which an observation ( or measurement ) is observed Sample Space (S)- The set of all possible outcomes (or results)
Chapter 4 Probability Copyright © 2014 by The McGraw-Hill Companies, Inc. All rights reserved.McGraw-Hill/Irwin.
Basic Concepts and Approaches
COMP14112: Artificial Intelligence Fundamentals L ecture 3 - Foundations of Probabilistic Reasoning Lecturer: Xiao-Jun Zeng
Conditional Probability and Independence If A and B are events in sample space S and P(B) > 0, then the conditional probability of A given B is denoted.
LESSON ONE DECISION ANALYSIS Subtopic 2 – Basic Concepts from Statistics Created by The North Carolina School of Science and Math forThe North Carolina.
10/1/20151 Math a Sample Space, Events, and Probabilities of Events.
Chapter 8 Probability Section R Review. 2 Barnett/Ziegler/Byleen Finite Mathematics 12e Review for Chapter 8 Important Terms, Symbols, Concepts  8.1.
Sample space The set of all possible outcomes of a chance experiment –Roll a dieS={1,2,3,4,5,6} –Pick a cardS={A-K for ♠, ♥, ♣ & ♦} We want to know the.
Dr. Gary Blau, Sean HanMonday, Aug 13, 2007 Statistical Design of Experiments SECTION I Probability Theory Review.
Basic Concepts of Discrete Probability (Theory of Sets: Continuation) 1.
Copyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Chapter 4 Probability.
Probability Notes Math 309. Sample spaces, events, axioms Math 309 Chapter 1.
CPSC 531: Probability Review1 CPSC 531:Probability & Statistics: Review Instructor: Anirban Mahanti Office: ICT Class.
3. Counting Permutations Combinations Pigeonhole principle Elements of Probability Recurrence Relations.
Probability & Statistics I IE 254 Exam I - Reminder  Reminder: Test 1 - June 21 (see syllabus) Chapters 1, 2, Appendix BI  HW Chapter 1 due Monday at.
1 TABLE OF CONTENTS PROBABILITY THEORY Lecture – 1Basics Lecture – 2 Independence and Bernoulli Trials Lecture – 3Random Variables Lecture – 4 Binomial.
Computing Fundamentals 2 Lecture 6 Probability Lecturer: Patrick Browne
Dr. Ahmed Abdelwahab Introduction for EE420. Probability Theory Probability theory is rooted in phenomena that can be modeled by an experiment with an.
The sample space (omega) collectively exhaustive for the experiment mutually exclusive right scope ‘granularity’ The probability law assigns a probability.
PROBABILITY, PROBABILITY RULES, AND CONDITIONAL PROBABILITY
Probability: Terminology  Sample Space  Set of all possible outcomes of a random experiment.  Random Experiment  Any activity resulting in uncertain.
Sixth lecture Concepts of Probabilities. Random Experiment Can be repeated (theoretically) an infinite number of times Has a well-defined set of possible.
Probability Rules In the following sections, we will transition from looking at the probability of one event to the probability of multiple events (compound.
Introduction to Probability (Dr. Monticino). Assignment Sheet  Read Chapters 13 and 14  Assignment #8 (Due Wednesday March 23 rd )  Chapter 13  Exercise.
SECTION 11-2 Events Involving “Not” and “Or” Slide
+ Chapter 5 Overview 5.1 Introducing Probability 5.2 Combining Events 5.3 Conditional Probability 5.4 Counting Methods 1.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Introduction to Probability (CSCE 317) January 21, 2016 Marco Valtorta SWRG.
Random Variables and Stochastic Processes – Dr. Ghazi Al Sukkar Office Hours: will be.
5.2 Day One Probability Rules. Learning Targets 1.I can describe a probability model for a chance process. 2.I can use basic probability rules, including.
CSCI 115 Chapter 3 Counting. CSCI 115 §3.1 Permutations.
1 Probability- Basic Concepts and Approaches Dr. Jerrell T. Stracener, SAE Fellow Leadership in Engineering EMIS 7370/5370 STAT 5340 : PROBABILITY AND.
Basic Probability. Introduction Our formal study of probability will base on Set theory Axiomatic approach (base for all our further studies of probability)
Onur DOĞAN.  The Classical Interpretation of Probability  The Frequency Interpretation of Probability  The Subjective Interpretation of Probability.
Chapter 4 Introduction to Probability. I. Experiments, sample space and counting rules Probability is the numerical measure of a chance or likelihood.
PROBABILITY AND STATISTICS WEEK 2 Onur Doğan. Introduction to Probability The Classical Interpretation of Probability The Frequency Interpretation of.
Probability and Statistics for Computer Scientists Second Edition, By: Michael Baron Chapter 2: Probability CIS Computational Probability and Statistics.
Biostatistics Class 2 Probability 2/1/2000.
Virtual University of Pakistan
The Language of Sets If S is a set, then
Math a - Sample Space - Events - Definition of Probabilities
What Is Probability?.
Probability.
Probability Axioms and Formulas
Chapter 3 Probability.
What is Probability? Quantification of uncertainty.
Axioms, Interpretations and Properties
From Randomness to Probability
PROBABILITY AND STATISTICS
Chapter 4 – Probability Concepts
Unit 1: Basic Probability
Honors Statistics From Randomness to Probability
CONDITIONAL PROBABILITY
Chapter 2 Notes Math 309 Probability.
How to Interpret Probability Mathematically, the probability that an event will occur is expressed as a number between 0 and 1. Notationally, the.
Introduction to Probability (CSCE 317)
Definition of Probability
Probability Notes Math 309.
Mrs.Volynskaya Alg.2 Ch.1.6 PROBABILITY
January 15, 2019 Marco Valtorta SWGN 2A15
Lecture 2 Basic Concepts on Probability (Section 0.2)
Probability Notes Math 309.
Probability Notes Math 309 August 20.
Presentation transcript:

Introduction to Probability (CSCE 317) January 10, 2017 Marco Valtorta SWRG 3A55 mgv@cse.sc.edu

Purpose of the Introductory Slides Review the axioms of probability: Kolmogorov’s axioms Review models of the axioms

Probabilities A set of events is a set of subsets of the set of sample points Ω s.t: Ω is an event, If E1 and E2 are events, then E1 U E2 is an event, If E is an event, then its complement is an event Let Ω be a set of sample points (outcomes), F be a set of events relative to Ω, and P a function that assigns a unique real number to each E in F . Suppose that P(E) >= 0 for all E in F P(Ω) = 1 If E1 and E2 are disjoint subsets of F , then P(E1 V E2) = P(E1) + P(E2) Then, the triple (Ω, F ,P) is called a probability space, and P is called a probability measure on F A set of events is a set of subsets of the sample points with three properties: (1) Omega is an event, (2) If E1 and E2 are events, then E1 U E2 is an event, (3) if E is an event, then its complement is an event. The three properties of probability in the second half of the space are called the axioms of Kolmogorov.

Conditional probabilities Let (Ω, F ,P) be a probability space and E1 in F such that P(E1) > 0. Then for E2 in F , the conditional probability of E2 given E1, which is denoted by P(E2| E1), is defined as follows: This should be considered a fourth axiom (besides the three axioms of Kolmogorov) that needs to be shows true in every (proper) model of probability.

Models of the Axioms There are three major models (i.e., interpretations in which the axioms are true) of the axioms of Kolmogorov and of the definition of conditional probability. The classical approach The limiting frequency approach The subjective (Bayesian) approach

Derivation of Kolmogorov’s Axioms in the Classical Approach Let n be the number of equipossible outcomes in Ω If m is the number of equipossible outcomes in E, then P(E) = m/n ≥0 P(Ω) = n/n = 1 Let E1 and E2 be disjoint events, with m equipossible outcomes in E1 and k equipossible outcomes in E2. Since E1 and E2 are disjoint, there are k+m equipossible outcomes in E1 V E2, and: P(E1)+P(E2) = m/n + k/n = (k+m)/n = P(E1 V E2)

Conditional Probability in the Classical Approach Let n, m, k be the number of sample points in Ω, E1, and E1&E2. Assuming that the alternatives in E1 remain equipossible when it is known that E1 has occurred, the probability of E2 given that E1 has occurred, P(E2|E1), is: k/m = (k/n)/(m/n) = P(E1&E2)/P(E1) This is a theorem that relates unconditional probability to conditional probability.

The Subjective Approach The probability P(E) of an event E is the fraction of a whole unit value which one would feel is the fair amount to exchange for the promise that one would receive a whole unit of value if E turns out to be true and zero units if E turns out to be false The probability P(E) of an event E is the fraction of red balls in an urn containing red and brown balls such that one would feel indifferent between the statement "E will occur" and "a red ball would be extracted from the urn." Neapolitan, after De Finetti (first definition) I believe that the second definition is due to Dennis V. Lindley

The Subjective Approach II If there are n mutually exclusive and exhaustive events Ei, and a person assigned probability P(Ei) to each of them respectively, then he would agree that all n exchanges are fair and therefore agree that it is fair to exchange the sum of the probabilities of all events for 1 unit. Thus if the sum of the probabilities of the whole sample space were not one, the probabilities would be incoherent. De Finetti derived Kolmogorov’s axioms and the definition of conditional probability from the first definition on the previous slide and the assumption of coherency. Neapolitan, p.56. This is De Finetti’s Dutch Book theorem

Definition of Conditional Probability in the Subjective Approach Let E and H be events. The conditional probability of E given H, denoted P(E|H), is defined as follows: Once it is learned that H occurs for certain, P(E|H) is the fair amount one would exchange for the promise that one would receive a whole unit value if E turns out to be true and zero units if E turns out to be false. [Neapolitan, 1990] Note that this is a conditional definition: we do not care about what happens when H is false. Neapolitan, 1990, p.57

Derivation of Conditional Probability One would exchange P(H) units for the promise to receive 1 unit if H occurs, 0 units otherwise; therefore, by multiplication of payoffs: One would exchange P(H)P(E|H) units for the promise to receive P(E|H) units if H occurs, 0 units if H does not occur (bet 1); furthermore, by definition of P(E|H), if H does occur: One would exchange P(E|H) units for the promise to receive 1 unit if E occurs, and 0 units if E does not occur (bet 2) Therefore, one would exchange P(H)P(E|H) units for the promise to receive 1 unit if both H and E occur, and 0 units otherwise (bet 3). But bet 3 is the same that one would accept for P(E&H), i.e. one would exchange P(E&H) units for the promise to receive 1 unit if both H and E occur, and 0 otherwise, and therefore P(H)P(E|H)=P(E&H). The derivation of P(H)P(E|H) = P(E & H) in the subjective approach given above is on p.57 of [Neapolitan, 1990]