Scribd
Upload
30 views

Applied Probability: Course Lecturer Rajeev Surati Tina Kapur PH.D

This document provides an overview of an applied probability course. It discusses the course lecturers, agenda, purpose of the course, and grading policy. The course will cover topics like algebra of events, conditional probability, random variables, Gaussian random variables, maximum likelihood estimation, and an exam. It aims to teach students how to deal with real-world problems involving uncertainty. Examples discussed include image segmentation, instant messaging, network modeling, and steam pipe failure.

Uploaded by

shukry-sshi-4091
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
30 views

Applied Probability: Course Lecturer Rajeev Surati Tina Kapur PH.D

This document provides an overview of an applied probability course. It discusses the course lecturers, agenda, purpose of the course, and grading policy. The course will cover topics like algebra of events, conditional probability, random variables, Gaussian random variables, maximum likelihood estimation, and an exam. It aims to teach students how to deal with real-world problems involving uncertainty. Examples discussed include image segmentation, instant messaging, network modeling, and steam pipe failure.

Uploaded by

shukry-sshi-4091
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 18

Applied Probability

Course Lecturer
Rajeev Surati Ph.D.
Tina Kapur Ph.D.
Agenda
• Purpose of Course with Motivating
Examples
• Go Over Outline of course and Grading
Policy
• Algebra of Events and start on conditional
Probability
Purpose of Course
• Focus has been on solving Deterministic
Computational Problems
• This course is about how to deal with
solving real world problems that involve
uncertainty
• 4 motivating examples on why its worth
studying
1st Example: Seamless Video Wall
Brain Cancer Image
Segmentation
• Image segmentation
based on probabilistic
methods can be used in
invasive surgery
applications. Tina is an
expert on this and has
made some problem set
to let you try your own
hand at it.
Instant Messaging
• What do you do when someone asks you to
show that the system you have built is
scalable and robust?
• Network Modeling: Poisson Processes,
Queueing Theory
Power Plant Steam Pipe Failure
Course Info
Monday: Algebra of Events, Conditional Probabability
Tuesday: Conditional continued, Bayes Theorem
Thursday: Random Variables
Friday: Gaussian Random Variables
Monday: ML Estimation
Tuesday: MLE Segmentation
Wednesday: Exam
Thursday: Exam Results
Friday: Ravi Sundaram: Former Head of Mapping Group at
Akamai
Grading
• 6 Problem Sets, 1 Final Exam
• 75% Problems Sets, 25% Exam
Algebra of Events

A Events are collections of points or


B areas in a space.
C

The collection of all points in the entire


space is called U , the universal set or
the universal event.
Alebra of Events Continued
Event A’, the complement of event A, is
the collection of all points in the universal
A A’ set which are not included in event A. The
null set contains no points and is the
complement of the universal set.

The intersection of two events A and B


B A is the collection of all points which are
contained both in A and B notated AB.
Algebra of Events continued…
The union of two events A
and B is the collection of all
A B points which are either in A
or in B or in both. For the
union of events A and b we
shall use the notation A + B

Two events A and B are Equal if every point in U


which is in A is also in B and every point of U not
in A’ is alson in B’; rather A includes B and B
includes A.
7 Axioms of Algebra of Events
A+B=B+A Commutative Law
A + (B + C) = (A + B) + C Associative Law
A(B+C) = AB + AC Distributive Law
(A’)’ = A
(AB)’ = A’ + B’ DeMorgan’s Law
AA’ = 
AU = A
Some Derivable Relations

A+A=A
A + AB = A
A + A’B = A + B
A + A’ = U
A+U=U
A 
Mutually Exclusive and
Collectively Exhaustive

A set of events are mutually


A B exclusive if the set of events do
not intersect

A set of events are collectively


C exhaustive if the sum up to U
A
B e.g. A + B + C = U
Sample Spaces
Sample Space:The finest-grain mutually exclusive,
collectively exhaustive listing of all possible outcomes of
a model of an experiment.

Sequential Sample Space


 H n   Heads 
Event  : 
 n  Tails 
T
 on the nth
toss of the coin.
H1H 2
H1H 2 Is finest grain event
H1
type for two tosses
H1T2
H1 Is coarser grain event for
T1H 2 two tosses
T1

H1T2
3 Axioms of Probability Measure
Measure of events in a sample space

• For Any Event A, P(A) >= 0


• P(U) = 1 (Normalization)
• If AB = , then P(A+B) = P(A) + P(B)

From this and the prior Axioms one can determine the probability
measure of an event by simply summing up all the measures for
each of the finest grain events that the event consists of.
Conditional Probability; an
intuitive Taste

A
P( AB )
B P( A | B ) 
P( B)

You might also like