Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Knowledge of All > DS_Interview_Prep > Flashcards

DS_Interview_Prep Flashcards

1
Q

Bayes’ Rule

A

P(A|B) = P(B|A)P(A) / P(B)

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

Conditional Probability

A

The probability of event A given that event B has occurred.

Mechanism for solve: Bayes’ Rule

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

Conditional Independence Formula and Definition

A

P(A AND B | C) = P(A|C)P(B|C)

Given that event C has occurred, knowing that event B has also occurred tells us nothing about the probability of event A having occurred.

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

Bayes’ Rule: Name of P(A)

A

Prior

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

Bayes’ Rule: Name of P(B|A)

A

Likelihood

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

Bayes’ Rule: Name of P(A|B)

A

Posterior

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

Law of Total Probability Formula and Definition

A

P(A) =SUM( P(A|B_n)P(B_n) ) for n in N

The probability of event A occurring can be modeled as the weighted sum of conditional probabilities based on each possible scenario having occurred.

Mechanism for solving questions of assessing a probability involving a “tree of outcomes” upon which the probability depends.

Ex. Probability that a customer makes a purchase, conditional on which customer segment that customer falls within.

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

Permutations (Formula and Definition)

A

n_P_r = n! / (n-r)!

Mechanism for being able to select all or part of a set of objects, with regard to the order of the arrangement.

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

Combinations (Formula and Definition)

A

C(n,r) = n! / r!(n-r)!

Mechanism for being able to select all or part of a set of objects, WITHOUT regard to the order of the arrangement.

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

Random Variables

A

Quantity with an associated probability distribution.

Probability distribution can be discrete (countable range) or continuous (uncountable range)

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

Probability Mass Function (PMF)

A

Mechanism for understanding the likelihood of a discrete random variable taking on a GIVEN value.

Probability distribution associated with a discrete random variable.

Sums to 1.

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

Probability Density Function (PDF)

A

Mechanism for understanding the likelihood of a continuous random variable falling within a specific RANGE of values.

Probability distribution associated with a continuous random variable.

Integrates to 1.

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

Cumulative Distribution Function (CDF)

A

Mechanism for understanding the likelihood that a random variable will be less than or equal to a specified value.

Discrete: Formed by summing values

Continuous: Formed by integrating values

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

Joint Probability Distribution

A

Mechanism for understanding the probability of two or more random variables occurring together.

Discrete = Joint Probability Mass Function (JPMF)

Continuous = Joint Probability Density Function (JPDF)

Sums or integrates to 1.

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

Marginal Probability Distribution

A

Mechanism for deriving the probability distribution of a single variable from a set of random variables without considering the other variables in the set.

Discrete = Marginal Probability Mass Function (MPMF)

Continuous = Marginal Probability Density Function (MPDF)

Derived from a Joint Probability Distribution.

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

Conditional Probability Distribution

A

Mechanism for understanding the probability distribution of one random variable given that another random variable has already occurred.

17
Q

Binomial Distribution

A

Mechanism for counting some number of successful events where the outcome of each event is binary.

PMF
MEAN
VARIANCE

Ex. Coin Flip, User Signups,

Discrete Distribution

18
Q

Poisson Distribution

A

Mechanism for understanding the probability of the number of events occurring within a particular fixed interval where the known, constant rate of each event’s occurrence is lamdba.

PMF
MEAN
VARIANCE

Ex. Number of visits to a website in a certain period of time, number of defects on an assembly line

Discrete Distribution

19
Q

Uniform Distribution

A

Mechanism for modeling a constant probability between values on the interval a to b.

Ex. Random Number Generator, Hypothesis Testing Cases

PDF
MEAN
VARIANCE

Continuous Distribution

20
Q

Exponential Distribution

A

Mechanism for understanding the probability of the interval length between events of a Poisson process having a set rate parameter of lambda.

Ex. Wait Times until a customer makes a purchase, time until a default in credit occurs, etc.

PDF
MEAN
VARIANCE

Continuous Distribution

21
Q

Normal/Gaussian Distribution

A

Mechanism for modeling natural phenomenon. Distribution takes on the shape of a “bell-curve” depicting events closer to the average as more common and less common moving away from the average.

Ex. Heights of people, test scores, errors in measurement, waiting times in lines, etc.

PDF
MEAN
VARIANCE

Continuous Distribution

22
Q

Central Limit Theorem

A

Theorem in statistics wherein if we randomly sample many times from a population of independent samples having finite variance, the means of these random samples will form a normal distribution with the same mean.

Sampling distribution of means approaches normal distribution with increasing sample size.

Conditions for the CLT:
1. Random Sampling
2. Independent Samples
3. Finite Variance

Mechanism for?

23
Q

Markov Chains

A

Process in which there is a finite set of states, and the probability of being in a particular state is only dependent on the previous state. Probability from transitioning from one state to another is given by a transition matrix P.

Used to model the dynamics of a system in order to understand long-term behavior

24
Q

Empirical Rule

A

Applicable for the Normal/Gaussian Distribution

68-95-99.7 of data falling between the 1-2-3 standard deviations.

25
Q

Markov Property

A

Given the current state in a Markov Chain, the past and future states it will occupy are conditionally independent.

State is said to be “Markovian” if it satisfies the Markov Property.

26
Q

What is the difference between “least squares” and “residual sum of squares (RSS)”?

A

TODO

27
Q

Law of Large Numbers

A

Sample mean approaches population mean as sample size increases

28
Q

Sampling Distribution of Means

A

Describes the probability distribution of all possible means you could get if you draw multiple random samples of size n from a population

29
Q

Q: Difference between a Z-test and a t-Test?

A

Z-test = Use when you know the population standard deviation. (Never used in practice)F

t-Test = Use when you have an estimate of the population standard deviation.

30
Q

Q: Why do p-values not describe the “error rate” of a hypothesis test?

A

TODO

31
Q
A

Knowledge of All (8 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions