Probability and Distribution | Bài giảng số 6 chương 4 học phần Applied statistics | Trường Đại học Quốc tế, Đại học Quốc gia Thành phố Hồ Chí Minh

Addition Law: is helpful when we are interested in knowing the probability that at least one of two events occurs. That is, with events A and B we are interested in knowing the probability that event A or event B or both occur. Addition Law: two concepts related to the combination of events: the union of events and the intersection of events. The union of A and B is the event containing all sample points belonging to A or B or both. The union is denoted by A U B. Tài liệu giúp bạn tham khảo, ôn tập và đạt kết quả cao. Mời bạn đón xem.

APPLIED STATISTICS
COURSE CODE: ENEE1006IU
Lecture 6:
Chapter 4: Probability and Distribuon
(3 credits: 2 is for lecture, 1 is for lab-work)
Instructor: TRAN THANH TU Email:
tu@hcmiu.edu.vn
tu@hcmiu.edu.vn 1
tu@hcmiu.edu.vn 2
4.1. INTRODUCTION TO PROBABILITY
•Random experiments, counng rules, and assigning
probabilies
•Events and their probabilies
•Some basic relaonships of probability
•Condional probability
•Bayes’ theorem
4.1. INTRODUCTION TO PROBABILITY
tu@hcmiu.edu.vn 3
•Random experiments:
A random experiment is a process that generates well-dened experimental
outcomes. On any single repeon or trial, the outcome that occurs is
determined completely by chance.
By specifying all the possible experimental outcomes, we idenfy the sample
space for a random experiment.
The sample space for a random experiment is the set of all experimental
outcomes.
An experimental outcome is also called a sample point to idenfy it as an
element of the sample space.
4.1. INTRODUCTION TO PROBABILITY •Random
experiments:
tu@hcmiu.edu.vn 4
4.1. INTRODUCTION TO PROBABILITY
•Counng rules:
tu@hcmiu.edu.vn 5
Being able to idenfy and count the experimental outcomes is a necessary step in
assigning probabilies.
Three useful counng rules:
Mulple-step experiments: If an experiment can be described as a sequence of k
steps with n1 possible outcomes on the rst step, n2 possible outcomes on the
second step, and so on, then the total number of experimental outcomes is given by
(n1)*(n2)* . . . *(nk).
4.1. INTRODUCTION TO PROBABILITY •Counng rules:
tu@hcmiu.edu.vn 6
4.1. INTRODUCTION TO PROBABILITY
tu@hcmiu.edu.vn 7
•Counng rules:
Combinaons: allows one to count the number of experimental outcomes when the
experiment involves selecng n objects from a set of N objects.
The notaon ! means factorial; for
example, 5 factorial is
5! = (5)(4)(3)(2)(1) = 120
4.1. INTRODUCTION TO
PROBABILITY
•Counng rules:
Permutaons: allows one to
compute the number of
tu@hcmiu.edu.vn 8
experimental outcomes when n objects are to be selected from a set of N objects
where the order of selecon is important. The same n objects selected in a dierent
order are considered a dierent experimental outcome.
tu@hcmiu.edu.vn 9
4.1. INTRODUCTION TO PROBABILITY
•Assigning probabilies:
The three approaches most frequently used are the classical, relave frequency,
and subjecve methods.
Regardless of the method used, two basic requirements for assigning
probabilies must be met.
tu@hcmiu.edu.vn 10
4.1. INTRODUCTION TO PROBABILITY
•Assigning probabilies:
The classical method of assigning probabilies is appropriate when all the
experimental outcomes are equally likely.
tu@hcmiu.edu.vn 11
When using this approach, the two basic requirements for assigning
probabilies are automacally sased.
If n experimental outcomes are possible,
a probability of 1/n is assigned to each experimental outcome
4.1. INTRODUCTION TO PROBABILITY
•Assigning probabilies:
The relave frequency method of assigning probabilies is appropriate when data are
available to esmate the proporon of the me the experimental outcome will occur
if the experiment is repeated a large number of mes.
tu@hcmiu.edu.vn 12
When using this approach, the two basic requirements for assigning probabilies are
automacally sased.
4.1. INTRODUCTION TO PROBABILITY
•Assigning probabilies:
tu@hcmiu.edu.vn 13
The subjecve method of assigning probabilies is most appropriate when one
cannot realiscally assume that the experimental outcomes are equally likely and
when lile relevant data are available.
4.1. INTRODUCTION TO PROBABILITY
•Events and their probabilies:
tu@hcmiu.edu.vn 14
An event is a collecon of sample points.
The probability of any event is equal to the sum of the probabilies of the
sample points in the event.
calculate the probability of a parcular event by adding the probabilies of the
sample points (experimental outcomes) that make up the event.
4.1. INTRODUCTION TO PROBABILITY
•Events and their probabilies:
tu@hcmiu.edu.vn 15
Events
equal 10, more than 10, etc.)
tu@hcmiu.edu.vn 16
4.1. INTRODUCTION TO PROBABILITY
•Some basic relaonships of probability:
tu@hcmiu.edu.vn 17
The complement of A is dened to be the event consisng of all sample points
that are not in A. The complement of a is denoted by A
c
.
tu@hcmiu.edu.vn 18
4.1. INTRODUCTION TO PROBABILITY
•Some basic relaonships of probability:
Addion Law: is helpful when we are interested in knowing the probability that
at least one of two events occurs. That is, with events A and B we are interested
in knowing the probability that event A or event B or both occur.
Addion Law: two concepts related to the combinaon of events: the union of
events and the intersecon of events.
-The union of A and B is the event containing all
sample points belonging to A or B or both. The
union is denoted by A U B.
-The intersecon of A and B is the event containing
the sample points belonging to both A and B. The
intersecon is denoted by A ∩ B.
tu@hcmiu.edu.vn 19
4.1. INTRODUCTION TO PROBABILITY
•Some basic relaonships of probability:
The addion law provides a way to compute the probability that event A or
event B or both occur. In other words, the addion law is used to compute the
probability of the union of two events.
tu@hcmiu.edu.vn 20
4.1. INTRODUCTION TO PROBABILITY
•Condional probability: Suppose we have an event A with
| 1/46

Preview text:

APPLIED STATISTICS COURSE CODE: ENEE1006IU Lecture 6:
Chapter 4: Probability and Distribution
(3 credits: 2 is for lecture, 1 is for lab-work)
Instructor: TRAN THANH TU Email: tttu@hcmiu.edu.vn tttu@hcmiu.edu.vn 1
4.1. INTRODUCTION TO PROBABILITY
•Random experiments, counting rules, and assigning probabilities
•Events and their probabilities
•Some basic relationships of probability •Conditional probability •Bayes’ theorem
4.1. INTRODUCTION TO PROBABILITY tttu@hcmiu.edu.vn 2 •Random experiments:
A random experiment is a process that generates well-defined experimental
outcomes. On any single repetition or trial, the outcome that occurs is
determined completely by chance.
By specifying all the possible experimental outcomes, we identify the sample
space for a random experiment.
The sample space for a random experiment is the set of all experimental outcomes.
An experimental outcome is also called a sample point to identify it as an element of the sample space.
4.1. INTRODUCTION TO PROBABILITY •Random experiments: tttu@hcmiu.edu.vn 3
4.1. INTRODUCTION TO PROBABILITY •Counting rules: tttu@hcmiu.edu.vn 4
Being able to identify and count the experimental outcomes is a necessary step in assigning probabilities. Three useful counting rules:
Multiple-step experiments: If an experiment can be described as a sequence of k
steps with n1 possible outcomes on the first step, n2 possible outcomes on the
second step, and so on, then the total number of experimental outcomes is given by (n1)*(n2)* . . . *(nk).
4.1. INTRODUCTION TO PROBABILITY •Counting rules: tttu@hcmiu.edu.vn 5
4.1. INTRODUCTION TO PROBABILITY tttu@hcmiu.edu.vn 6 •Counting rules:
Combinations: allows one to count the number of experimental outcomes when the
experiment involves selecting n objects from a set of N objects.
The notation ! means factorial; for example, 5 factorial is 5! = (5)(4)(3)(2)(1) = 120 4.1. INTRODUCTION TO PROBABILITY •Counting rules: Permutations: allows one to compute the number of tttu@hcmiu.edu.vn 7
experimental outcomes when n objects are to be selected from a set of N objects
where the order of selection is important. The same n objects selected in a different
order are considered a different experimental outcome. tttu@hcmiu.edu.vn 8
4.1. INTRODUCTION TO PROBABILITY •Assigning probabilities:
The three approaches most frequently used are the classical, relative frequency, and subjective methods.
Regardless of the method used, two basic requirements for assigning probabilities must be met. tttu@hcmiu.edu.vn 9
4.1. INTRODUCTION TO PROBABILITY •Assigning probabilities:
The classical method of assigning probabilities is appropriate when all the
experimental outcomes are equally likely. tttu@hcmiu.edu.vn 10
When using this approach, the two basic requirements for assigning
probabilities are automatically satisfied.
If n experimental outcomes are possible,
a probability of 1/n is assigned to each experimental outcome
4.1. INTRODUCTION TO PROBABILITY •Assigning probabilities:
The relative frequency method of assigning probabilities is appropriate when data are
available to estimate the proportion of the time the experimental outcome will occur
if the experiment is repeated a large number of times. tttu@hcmiu.edu.vn 11
When using this approach, the two basic requirements for assigning probabilities are automatically satisfied.
4.1. INTRODUCTION TO PROBABILITY •Assigning probabilities: tttu@hcmiu.edu.vn 12
The subjective method of assigning probabilities is most appropriate when one
cannot realistically assume that the experimental outcomes are equally likely and
when little relevant data are available.
4.1. INTRODUCTION TO PROBABILITY
•Events and their probabilities: tttu@hcmiu.edu.vn 13
An event is a collection of sample points.
The probability of any event is equal to the sum of the probabilities of the sample points in the event.
calculate the probability of a particular event by adding the probabilities of the
sample points (experimental outcomes) that make up the event.
4.1. INTRODUCTION TO PROBABILITY
•Events and their probabilities: tttu@hcmiu.edu.vn 14 Events equal 10, more than 10, etc.) tttu@hcmiu.edu.vn 15
4.1. INTRODUCTION TO PROBABILITY
•Some basic relationships of probability: tttu@hcmiu.edu.vn 16
The complement of A is defined to be the event consisting of all sample points
that are not in A. The complement of a is denoted by Ac. tttu@hcmiu.edu.vn 17
4.1. INTRODUCTION TO PROBABILITY
•Some basic relationships of probability:
Addition Law: is helpful when we are interested in knowing the probability that
at least one of two events occurs. That is, with events A and B we are interested
in knowing the probability that event A or event B or both occur.
Addition Law: two concepts related to the combination of events: the union of
events and the intersection of events.
-The union of A and B is the event containing all
-The intersection of A and B is the event containing
sample points belonging to A or B or both. The
the sample points belonging to both A and B. The union is denoted by A U B.
intersection is denoted by A ∩ B. tttu@hcmiu.edu.vn 18
4.1. INTRODUCTION TO PROBABILITY
•Some basic relationships of probability:
The addition law provides a way to compute the probability that event A or
event B or both occur. In other words, the addition law is used to compute the
probability of the union of two events. tttu@hcmiu.edu.vn 19
4.1. INTRODUCTION TO PROBABILITY
•Conditional probability: Suppose we have an event A with tttu@hcmiu.edu.vn 20