Chap 3. Probability_Intro
Chap 3. Probability_Intro
4
4.3 Terminology
• An experiment is the process by which an observa=on or
measurements is obtained,( is a methode of data collec=on).
• When a repe==on of an experiment is performed, what we
observed is an outcome called a simple event (E).
• A probability of a simple event is a mesure of our belief that
the event A will occur.
• An event is a collec=on of simple events.
• Eg: Event A= {E1, E2, E3} Event B= {E1, E3, E5}
• The probability of an event A is wri]en as P(A), p(A) or Pr(A).
• The set of all events is called the sample space
• Probability func0on: a func=on giving the probability for each
outcome
• The probalility varies between 0 and 1; the sum of the
probabili=es for all simple events equals 1.
4.4 Basic probability laws
Example:
Blood type O A B AB
Probability 0.44 ? 0.10 0.04
3. Complementality
Then,
Probabili=es involving mul=ple events
3. Addi0onal rule
• If both events A and B occur on a single performance of an
experiment, this is called the intersec=on or
joint probability of A and B, denoted as
• In this case, P(A and B) ≠ 0
Therefore, P(A U B)= P(A) + P(B) –
• Sensi=vity
= P(Test posi=ve | pa=ent has disease)
= P(T+ | D+)
= True posi=ve rate
• Specificity
= P(Testnega=ve | pa=ent does not have disease)
= P(T-| D-)
=True nega=ve rate
• Two commonly used terms related to diagnos=c
tes=ng are false posi=ve and false nega=ve.
• False posi=ve is when a person who is non-diseased
(D−) tests posi=ve (T+), and false nega=ve is when a
person who is diseased (D+) tests nega=ve (T−).
• The probabili=es of these events can be wri]en in
terms of sensi=vity and specificity:
• P(False Posi=ve) = P(T+|D−) = 1−specificity
• P(False Nega=ve) = P(T−|D+) = 1−sensi=vity
POPULATION
Ar=ficial
Cutoff
True posi=ves True posi=ves
Sensi=vity = = X 100
True posi=ves + All persons with the
false nega=ves disease
= TP
TP + FN
= a/ a+c
True nega=ves True nega=ves
Specificity = = X 100
True nega=ves+ All persons without the
false posi=ves disease
= TN
TN + FP
= d/(b+d)
Percent false posi=ves = % of people without the disease
who were incorrectly labeled by the test as having the disease
FP
FP + TN X 100
= b/(b+d)
Percent false nega=ves = % of people with the disease who
were not detected by the test
FN
FN + TP X 100
= c/ (a+c)
Predic=ve Values
• Posi=ve Predic=ve Value: This is the probability that a person who
has tested posi=ve on a diagnos=c test (T+) actually has the disease
(D+).
• PPV = P(pa=ent has disease | Test posi=ve )
= P(D+|T+).
• Nega=ve Predic=ve Value: This is the probability that a person who
has tested nega=ve on a diagnos=c test (T−) actually does not have
the disease (D−).
• NPV − = P(pa=entdoes not have disease | Test nega=ve )
= P(D−|T−).
• Overall Accuracy: This is the probability that a randomly selected
subject is correctly diagnosed by the test.
• It can be wri]en as accuracy = P(D+)sensi=vity + P(D−)specificity.
Predic=ve Value
As specificity increases,
posi=ve predic=ve
value increases.
As sensi=vity increases, posi=ve
predic=ve value also increases,
but to a much lesser extent.
Exercises
• 1. In a popula=on with 1000 individuals, 100 have
the disease. The screening test given to each of
the individuals was posi=ve for 80 of the 100
diseased individuals. In the same popula=on , the
test was nega=ve for 800 of the 900 non-
diseased individuals.
• Sensi=vity= ?
• Specificity=?
• PPV= ?
• NPV= ?
Disease Status
5! = 5 × 4 × 3 × 2 × 1 = 120
By defini=on 0! = 1
Combina=on
• A combina0on is an arrangement of objects,
without repe==on, where order is not
important.
• Since a combina=on is the number of ways
you can arrange objects, it will always be a
whole number.
Permuta=on
• A permuta0on is an arrangement of objects,
without repe==on, where order is important.
• Since a permuta=on is the number of ways
you can arrange objects, it will always be a
whole number.
Permuta=on Example
If we have 3 colored marbles: Instead of lis=ng all possible
one RED, one BLUE, and permuta=ons, there is a
one GREEN, how many formula to figure out the total
permuta=ons using all three number of permuta=ons
marbles are possible?
n!
n Px =
RBG RGB (n − x )!
BGR BRG n is the total # of objects
GRB GBR x is the total # of objects you are choosing
3! (3 ∗ 2 ∗1)
3 P3 = = =6
(3 − 3)! 0!
Combina=on Example
If we have 3 colored marbles: There is a formula to figure out
one RED, one BLUE, and the total number of
one GREEN, how many combina=ons for more
combina=ons using all three complex situa=ons
marbles are possible?
n!
n Cx =
Just 1: x!(n − x )!
RBG
n is the total # of objects
x is the total # of objects in the
arrangement
3! 3 ∗ 2 ∗1
3 C3 = = =1
3!(3 − 3)! (3 ∗ 2 ∗1)(0!)
Example
List all combina0ons of the leRers List all permuta0ons of the leRers
ABCD in groups of 3 ABCD in groups of 3
Combina0ons
• no repe==on of objects allowed
• order isn't important
Exercise
• You own 4 pairs of jeans, 12 clean T-shirts,
and 4 wearable pairs of sneakers.
• How many ou}it (jeans, T-shirt, and sneakers)
you can create?