Probability in Data Science Flashcards

1
Q

Probability Space

A

Consists of sample space, event space and probability

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Sample Space

A

Represented by the Greek letter omega, it represents all possible outcomes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Event Space

A

This represents every possible combination of elementary events.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Three Axioms

A

1) P(A) always has to be positive.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Mutually Exclusive

A

If the events can’t happen simultaneously.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

P(A u B)

A

If mutually exclusive/independent, P(A) + P(B) - P(A n B).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

P(A n B)

A

If independent, P(A) * P(B)
If dependent, P(A|B)/P(B) or P(B|A)/P(A)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Mutual independence vs pairwise independence

A

If something is mutually independent it is also pairwise independent.
Pairwise independent tests the probability of pairs to see if they are independent with P(A n B) = P(A)P(B), whilst mutually independency tests all values to check that everything is independent together.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

How to partition sample space

A

Lets say we have an event A with a sample space B, and that A ⊆ B. If we were to divide B into multiple partitions, lets say {B_1, B_2, … , B_5}, we can use these to figure out the probability of A. This is done by:
P(A) =
Σ_n P(A and B_n) =
ΣP(A|B_n)P(B_n).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Bayes Theorem

A

P(A | B) = P(B | A) x P(A) / P(B)
We could rewrite P(B) as:
P(B | A) x P(A) + P(B | ¬A) x P(¬A)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Bayesian Network

A

A probabilistic graphical model that represents a set of variables and their conditional dependencies via a Directed Acyclic Graph.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Base Rate Fallacy

A

P(A | B) != P(B | A)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly