Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

58
Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne http://www.comp.dit.ie/pbrowne/

Transcript of Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Page 1: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Computing Fundamentals 2Lecture 7 Statistics

Lecturer: Patrick Browne

http://www.comp.dit.ie/pbrowne/

Page 2: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Statistics

• Raw data are just lists of facts and numbers. The branch of mathematics that organizes, analyzes and interprets raw data is called statistics.

Page 3: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Recall: Permutations, Combinations• P(n,r) = n! / (n-r)!

• Permutations a, b, and c taken 2 at a time is

3*2/1=6 <sequence>

• <ab>,<ba>,<ac>,<ca>,<bc>,<cb>• C(n,r) = n! /r! (n-r)!

• Combinations of a, b, and c taken 2 at a time is

3*2/2*1=3. {ab},{ac},{bc} {set} • {ab} is the same combination as {ba}, but <ab>,<ba> are distinct permutations

Page 4: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Recall Probability Calculations

•Calculation of union, sum

•P(A B) = P(A) + P(B) – P(A B)

•Calculation of intersection, product

•P(A ∩ B) = P(A) × P(B|A)

•Conditional probability of A given E:

•P(A|E) = P(A E)/P(E)

•Test for independence

•P(A B) = P(A) × P(B)

Page 5: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Frequency Table

• One way of organizing raw data is to use a frequency table (or frequency distribution), which shows the number of times that an individual item occurs or the number of items that fall within a given range or interval.

Page 6: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Frequency Distribution

• Suppose that a sample consists of the heights of 100 male students

at XYZ University. We arrange the data into classes or categories

and determine the number of individuals belonging to each class,

called the class frequency. The resulting table is called a frequency

distribution or frequency table

Page 7: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

• The first class or category, for example, consists of heights from 60

to 62 inches, indicated by 60–62, which is called class interval.

Since 5 students have heights belonging to this class, the

corresponding class frequency is 5. Since a height that is recorded

as 60 inches is actually between 59.5 and 60.5 inches while one

recorded as 62 inches is actually between 61.5 and 62.5 inches, we

could just as well have recorded the class interval as 59.5 – 62.5. In

the class interval 59.5 – 62.5, the numbers 59.5 and 62.5 are often

called class boundaries.

Frequency Distribution

Page 8: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

• The midpoint of the class interval, which can be taken as

representative of the class, is called the class mark. A graph for the

frequency distribution can be supplied by a histogram.

Frequency Distribution

Page 9: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Frequency table & class interval

3110

0105

2100

895

590

785

780

375

070

FrequencyTempRangeFrequency

0

2

4

6

8

10

Frequency

16

35

124

73

142

81

Frequency#tennents

Frequency

0

5

10

15

Frequency

Page 10: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Probability•Assume that all sample events are equally likely. We define classical probability that an event A will occur as•P(A) = #Simple Events in A #Simple Events in S•So P(A) is the number of ways in which A can occur, divided by the number of possible individual outcomes, assuming all are equally likely. Where S is the sample space.

Page 11: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Example• Tossing a coin twice:

– S = {HH, HT, TH, TT},• Probability 1/4 for each simple event.

– A = {Exactly One Head} = {HT,TH}• Then P(A) = 2/4 = 1/2

• Does this tell us how often A would occur if we repeated the experiment (“toss a coin twice”) many times?

Page 12: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Relative frequency•The probability of an event is the long run frequency of occurrence.•To estimate P(A) using the frequency approach, repeat the experiment n times (with n large) and compute x/n, where•x = # Times A occurred in the n trials.•The larger we make n, the closer x/n gets to P(A).

Page 13: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Relative frequency•If there have been 126 launches of the Space Shuttle, and two of these resulted in a catastrophic failure, we can estimate the probability that the next launch will fail to be 2/126 = 0.016.•The relative frequency allows us to determine the probability from actual data. It is more widely applicable than the classical approach, since it doesn't require us to specify a sample space consisting of equally likely simple events.

Page 14: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Relationships between probability and frequency

•Frequencies are relevant when modelling repeated trials, or repeated sampling from a population.

Page 15: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Mean

• The arithmetic mean is the sum of the values in a data collection divided by the number of elements in that data collection.

nix

Page 16: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Mean

• The arithmetic mean is the sum of the values in a data collection divided by the number of elements in that data collection.

x = ∑xi

n x = ∑fixi where f denotes frequency

∑fi

Page 17: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Range•The range measures dispersion. It is the difference between the lowest and highest values in the data. For example:•The highest CA = 48, lowest = 27 giving a range of 21. •The highest exam = 45 and lowest = 12 giving a range of 33. •There was wider variation in the students’ performance in the exam. than in the CA.

Page 18: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Variance & Standard Deviation

• List A: 12,10,9,9,10• List B: 7,10,14,11,8• The mean (x) of A & B is 10, but the

values in A are more closely clustered around the mean than those in B (or there is greater desperation or spread in B). We use the standard deviation to measure this spread (SD(A)≈1.1,SD(B) ≈2.4)

Page 19: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Standard Deviation

• The standard deviation measures the spread of the data about the mean value.

• It is useful in comparing data which may have the same mean but a different range. The range measure of dispersion and is the difference between the lowest and highest values in the data.

Page 20: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Variance & Standard Deviation

• The variance is always positive and is zero only when all values are equal.

variance = ∑(xi - x )2

n

standard deviation = variance

n

xx

n

xxxxxx it222

22

1 )()(...)()(

22

222

22

1 ...x

n

xx

n

xxx it

Alternatively

Page 21: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Variance of a frequency distribution

Page 22: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Median

• The median is the middle value. If the elements are sorted the median is:

• Median = valueAt[(n+1)/2] odd • Median = average(valueAt[n/2],

valueAt[n/2+1]) even

• For odd and even n respectively.

• Example {1,2,3,4,5} , Median = 3

• Example {1,2,3,4,5,6}, Median = 3.5

Page 23: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Mode

• The mode is the class or class value which occurs most frequently.

• mode([1, 2, 2, 3, 4, 7, 9]) = 2

• We can have bimodal or multimodal collections of data.

The height of the bars is the number of cases in the category

Page 24: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Bernouilli Trials

• Independent repeated trial with two outcomes are called Bernouilli Trials. The probability of k successes in a binomial experiment is:

knkqpk

nkP

)(

• Where n is the number of trials and (n-k) is the number of failure and p, q are probabilities of events.

Page 25: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Bernouilli Trials: Example

• Probability John hits target: p=1/4, • Probability John does not hit target: q=3/4, • John fires 6 times, n=6,: • What is the probability that John hits the target 2

times out of 6?

297.04

3

4

1

2

6)2(

42

P

knkqpk

nkP

)(

Page 26: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Bernoulli Trials: Example

• Probability John hits target: p=1/4,

• John fires 6 times, n=6,:

• What is the probability John hits the target at least once?

82.04096

7291)0(,

4096

729

4

3

4

1

0

6)0(

60

XPP

Probability that John does not hit target

Probability that John hits target at least once

No success (0), all failures,

Anything to the power of 0 is 1

Only 1 way to pick 0 from 6

0 to the power 0 is undefined, anything else to the power of zero is 1.

EXCEL =1-((3/4)^6)

knkqpk

nkP

)(

Page 27: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Bernoulli Trials: Example

• Probability that Mary hits target: p=1/4,

• Mary fires 6 times, n=6,:

• What is the probability Mary hits the target more than 4 times?

0046.04

1

4

3

4

1

5

6)6()5(

615

PP

In EXCEL =(6)*((1/4)^5)*((3/4)^1)+(1/4)^6

Page 28: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Random variables and probability distributions.

• Suppose you toss a coin two times. There are four possible outcomes: HH, HT, TH, and TT. Let the variable X represents the number of heads that result from this experiment. The variable X can take on the values 0, 1, or 2. In this example, X is a random variable; because its value is determined by the outcome of a statistical experiment.

Page 29: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Random variables and probability distributions.

• A probability distribution is a table or an equation that links each outcome of a statistical experiment with its probability of occurrence. The table below, which associates each outcome (the number of heads) with its probability. This is an example of a probability distribution.

• S={HH,HT,TH,TT}• A=number of heads

{0,1,2}

Page 30: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Random Variable

• A random variable X on a finite sample space S is a function (or mapping) from S to a number R in S’.

• Let S be sample space of outcomes from tossing two coins. Then mapping a is;

• S={HH,HT,TH,TT} (assume HT≠TH)• Xa(HH)=1, Xa(HT)=2, Xa(TH)=3, Xa(TT)=4 • The range (or image) of the function Xa is:• S’={1,2,3,4}

Page 31: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Random Variable

• Let S be sample space of outcomes from tossing two coins, where we are interested in the number of heads. Mapping b is:

• S={HH,HT,TH,TT}• Xb(HH)=2, Xb(HT)=1, Xb(TH)=1, Xb(TT)=0

• The range (image) of Xb is:

• S’’={0,1,2}

Page 32: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Random Variable

• A random variable is a function that maps a finite sample space into to a numeric value. The numeric value has a finite probability space of real numbers, where probabilities are assigned to the new space according to the following rule:

pointi = P(xi)= sum of probabilities of points in S whose range is xi.

Recall function F : Domain -> Range (Image)

Page 33: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Random Variable

• The function assigning pi to xi can be given as a table called the distribution of the random variable.

• pi = P(xi)= number of points in S whose image is xi

number of points in S

(i = 1,2,3...n) gives the distribution of X

Page 34: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Random Variable

• The equiprobable space generated by tossing pair of fair dice, consists of 36 ordered pairs(1):

• S={<1,1>,<1,2>,<1,3>...<6,6>}• Let X be the random variable which

assigns to each element of S the sum of the two dice integers: 2,3,4,5,6,7,8, 9,10,11,12

Page 35: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Random Variable

• Continuing with the sum of the two dice.• There is only one point whose image is 2, giving

P(2)=1/36.• There are two points whose image is 3, giving

P(3)=2/36. (<1,2>≠<2,1>, but their sums are =)• Below is the distribution of X.

1/362/363/364/365/366/365/364/363/362/361/36pi

12111098765432xi

=36/36

Page 36: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Example: Random Variable• A box contains 9 good items and 3 defective items (total 12

items). Three items are selected at random from the box. Let X be the random variable that counts the number of defective items in a sample. X has a range space Rx = {0,1,2,3}.

– The sample space 12-choose-3 = 220 different samples of size 3.

– There are 9-choose-3 = 84 samples of size 3 with 0 defective items.

– There are 3 * 9-choose-2 = 108 samples of size 3 with 1 defective.

– There are 3-choose-2 * 9 = 27 samples of size 3 with 2 defective.

– There 3-choose-3 = 1 samples of size 3 with 3 defective items.

– Where n-choose-r means the number of combinations (sets):

84108 27 1-----220

r

n

=COMBIN(12,3))

Page 37: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Example: Random Variable

• A box contains 9 good items and 3 defective items (total 12 items). Three items are selected at random from the box. Let X be the random variable that counts the number of defective items in a sample. X can have values 0-3.

• Below is the distribution of X.

1/22027/220108/22084/220pi

3210xi

3

12/

3

93

iii

xxp

= 220/220

84108 27 1-----220

Page 38: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Functions of a Random Variable

• If X is a random variable then so is Y=f(X).

• P(yk) = sum of probabilities xi, such that yk=f(xi)

Page 39: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Expectation and variance of a random variable

• Let X be a discrete random variable over sample space S.

• X takes values x1,x2,x3,... xt with respective probabilities p1,p2,p3,... pt

• An experiment which generates S is repeated n times and the numbers x1,x2,x3,... xt occur with frequency f1,f2,f3,... ft (fi=n)

• If n is large then

one expects

ttp

n

fp

n

fp

n

f ,...2

2,1

1

Page 40: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Expectation of a random variable

• So becomes

• The final formula is the population mean, expectation, or expected value of X is denoted as or E(X).

tt

tt

tt

pxpxpx

xn

fx

n

fx

n

fn

xfxfxfx

...2211

...22

11

...2211

i

ii

f

xfx

Page 41: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Variance of a random variable

• The variance of X is denoted as 2 or Var(X).

2 2

• The standard deviation is

t

tt

tt

pxpxpx

xxn

fxx

n

fxx

n

fn

xxfxxfxxf

22...2

221

21

2...

22

221

1

2...2211

)()()(

)()()(

)()()(variance

)(XVar

Page 42: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Expected value, Variance, Standard Deviation

• E(X)= μ = μx =∑xipi

• Var(X)= 2 = 2x =∑(xi - μ)2pi

• SD(X)= x = )(XVar

Page 43: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Example : Random Variable & Expected Value

• A box contains 9 good items and 3 defective items. Three items are selected at random from the box. Let X be the random variable that counts the number of defective items in a sample. X can have values 0-3.

• Below is the distribution of X.

1/22027/220108/22084/220pi

3210xi

3

12/

3

93

iii

xxp

Page 44: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Example : Random Variable & Expected Value

μ is the expected value of defective items in in a sample size of 3.

μ=E(X)= 0(84/220)+1(108/220)+2(27/220)+3(1/220)=132/220=?• Var(X)=

02(84/220)+12 (108/220)+22 (27/220)+32 (1/220) - μ 2 =?

• SD(X) sqrt(μ2)=?

1/22027/220108/22084/220pi

3210xi

Page 45: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Fair Game1?

• If a prime number appears on a fair die the player wins that value. If an non-prime appears the player looses that value. Is the game fair?(E(X)=0)

• S={1,2,3,4,5,6}

• E(X) = 2(1/6)+3(1/6)+5(1/6)+(-1)(1/6)+(-4)(1/6)+(-6)(1/6)= -1/6

• Note: 1 is not prime

1/61/61/61/61/61/6pi

-6-4-1532xi

Page 46: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Fair Game2?

• A player gambles on the toss of two fair coins. If 2 heads occur the player wins 2 Euro. If 1 head occurs he wins 1 Euro. If no heads occur he looses 3 Euro. Is the game fair?(E(X)=0)

• S={HH,HT,TH,TT}, • X(HH) = 2, X(HT)=X(TH)=1, X(TT)=-3

• E(X) = 2(1/4)+1(2/4)-3(1/4) = 0.25

Page 47: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Mean(μ), Variance(2), Standard Deviation()

xi2 3 11

pi 1/3 1/2 1/6

μ=Exipi = 2(1/3) + 3(1/2) + 11(1/6) = 4

E(X2) =Exipi= 2(1/3) + 3(1/2) + 11(1/6) = 26

2= Var(X) = E(X2) – μ2 = 26 – 42 = 10

= sqrt(Var(X)) = sqrt(10) =3.2

Page 48: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Mean(μ), Variance(2), Standard Deviation()

xi2 3 11

pi 1/3 1/2 1/6

μ=Exipi = 2(1/3) + 3(1/2) + 11(1/6) = 4

E(X2) =Exipi= 2(1/3) + 3(1/2) + 11(1/6) = 26

2= Var(X) = E(X2) – μ2 = 26 – 42 = 10

= sqrt(Var(X)) = sqrt(10) =3.2

Page 49: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Distribution Example(1)• Five cards are numbered 1 to 5. Two

cards are drawn at random. Let X denote the sum of the numbers drawn. Find (a) the distribution of X and (b) the mean, variance, and standard deviation.

• There are C(5,2) = 10 ways of drawing two cards at random.

Page 50: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Distribution Example(2)• Ten equiprobable sample points with their

corresponding X-values are

points

1,2 1,3 1,4 1,5 2,3 2,4 2,5 3,4 3,5 4,5

xi3 4 5 6 5 6 7 7 8 9

Page 51: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Distribution Example(3)• The distribution is:

xi3 4 5 6 5 6 7 7 8 9

pi0.1 0.1 0.2 0.2 0.2 0.2 0.2 0.2 0.1 0.1

Page 52: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Distribution Example(4)• The distribution is:

xi3 4 5 6 5 6 7 7 8 9

pi0.1 0.1 0.2 0.2 0.2 0.2 0.2 0.2 0.1 0.1

• The mean is: 3(0.1)..+..9(0.1)=6

• The E(X2) is 32(0.1)..+..92(0.1) = 39

• The variance is 39 – 62 = 3

• The SD is sqrt(3) = 1.7

Page 53: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Examples

• Two fair dice are thrown. If the sum of the

faces is 4, what is the probability that one

of the dice shows a 3?

Page 54: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Examples• A fair coin is thrown three times.

Consider the following events– A={first toss is a head}– B={second toss is head}– C={exactly 2 heads tossed in a row}

• Are the following events independent?– A and C– B and C

Page 55: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Examples• What is meant by repeated trials? • If fair coin is tossed 6 times, what is the

probability of exactly two heads occurring?

Page 56: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Examples• The probabilities of three runners A, B

or C winning a race are:– P(a) = 1/2,– P(b) = 1/3,– P(c) = 1/6.

• If two races are run, what is the probability of C winning the first race and A winning the second race?

Page 57: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Examples•A player tosses two fair coins. The player wins €2 if two heads occur, and wins €1 if one head occurs. The player loses €3 if no heads occur. Find the expected value of the game. How would you test whether or not the game is fair? Is the game fair?

Page 58: Computing Fundamentals 2 Lecture 7 Statistics Lecturer: Patrick Browne

Examples• Five cards are numbered 1 to 5. Two

cards are drawn at random. Let X denote the sum of the numbers drawn. Find (a) the distribution of X and (b) the mean, variance, and standard deviation of X.