Incremental calculation of weighted mean and variance

Size: px
Start display at page:

Download "Incremental calculation of weighted mean and variance"

Transcription

1 Icremetal calculatio of weighted mea ad variace Toy Fich Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically stable calculatio of the mea ad stadard deviatio, which are also suitable for icremetal o-lie calculatio. I the geeralize these formulae to weighted meas ad stadard deviatios. I upick the difficulties that arise whe geeralizig further to ormalized weights. Fially I show that the epoetially weighted movig average is a special case of the icremetal ormalized weighted mea formula, ad derive a formula for the epoetially weighted movig stadard deviatio. Simple mea Straightforward traslatio of equatio ito code ca suffer from loss of precisio because of the differece i magitude betwee a sample ad the sum of all samples. Equatio 4 calculates the mea i a way that is more umerically stable because it avoids accumulatig large sums. µ i ) + i ) ) This formula also provides us with some useful idetities. Simple variace + )µ ) 3) µ + µ ) 4) µ µ µ ) 5) µ µ µ ) µ + µ )µ µ ) 6) The defiitio of the stadard deviatio i equatio 7 below requires us to already kow the mea, which implies two passes over the data. This is t feasible for olie algorithms that eed to produce icremetal results after each sample becomes available. Equatio solves this problem sice it allows us to calculate the stadard deviatio from two ruig sums. σ i µ) 7) i i µ + µ ) 8)

2 3 Icremetal variace i µ i + µ 9) i µµ + µ 0) i µ ) ) ) i i ) Kuth otes [] that equatio is proe to loss of precisio because it takes the differece betwee two large sums of similar size, ad suggests equatio 4 as a alterative that avoids this problem. However he does ot say how it is derived. I the followig, equatio 0 is derived from the previous step usig equatio 5. Let S σ 3) i µ ) 4) i µ 5) S S i µ i + )µ 6) µ + )µ 7) µ + µ µ ) 8) µ + µ µ )µ + µ ) 9) µ + µ )µ + µ ) 0) µ + µ µ µ + µ µ ) µ µ + µ µ ) µ ) µ ) 3) S S + µ ) µ ) 4) σ S / 5) Mathworld [] has a alterative derivatio of a similar formula, which i our otatio is as follows. S i µ ) 6) i µ ) µ µ )) 7) i µ ) + µ µ ) i µ )µ µ ) 8) Simplify the first summatio: i µ ) µ ) + i µ ) 9) µ ) + S 30) S + µ µ ) 3)

3 Simplify the secod summatio: Simplify the third summatio: µ µ ) µ µ ) 3) i µ )µ µ ) µ µ ) i µ ) 33) ) µ µ ) µ + i µ ) ) µ µ ) µ )µ + i µ µ ) µ )µ + )µ ) 36) µ µ ) µ ) 37) µ µ ) 38) Back to the complete formula: S S + µ µ ) + µ µ ) µ µ ) 39) S + µ µ ) µ µ ) 40) S + )µ µ ) 4) We ca use equatios 6 ad 5 to show this is equivalet to equatio 4. S S + )µ µ ) 4) S + µ µ ) µ ) 43) S + µ ) µ ) 44) 4 Weighted mea The weighted mea is defied as follows. 34) 35) µ w i i w i 45) It is equivalet to the simple mea whe all the weights are equal, sice µ w i w w i i 46) w If the samples are all differet, the weights ca be thought of as sample frequecies, or they ca be used to calculate probabilities where p i w i / w i. The followig derivatio of the icremetal formula equatio 53) follows the same patter as the derivatio of equatio 4. For brevity we also defie as the sum of the weights. µ w i 47) w i i 48) ) w + w i i 3 49)

4 Useful idetities derived from this formula are: 5 Weighted variace w + W µ ) 50) w + w )µ ) 5) µ + w w µ ) 5) µ + w µ ) 53) µ µ ) w µ ) 54) µ µ ) w µ 55) µ w µ µ ) µ + µ w w µ µ ) 56) w µ ) 57) Similarly, we derive a umerically stable formula for calculatig the weighted variace equatio 68) usig the same patter as the derivatio of the uweighed wersio equatio 4). σ w i i µ) w i i µ 58) Let S σ 59) w i i µ 60) S S 6 Variable weights w i i µ w i i + W µ 6) w µ + W µ 6) w µ + w )µ 63) w µ ) + W µ µ ) 64) w µ ) + W µ µ )µ + µ ) 65) w µ + µ )µ + µ ) ) 66) w µ ) µ ) 67) S S + w µ ) µ ) 68) σ S / 69) I the previous three sectios, I have assumed that weights are costat oce assiged. However a commo requiremet is to ormalize the weights, such that W w i 70) If we are repeatedly addig ew data to our workig set, the we ca t have both costat weights ad ormalized weights. To allow us to keep weights ormalized, we eed to allow the weight of each 4

5 sample to chage as the set of samples chages. To idicate this we will give weights two idices, the first idetifyig the set of samples usig the sample cout as we have bee doig for µ etc.) ad the secod beig the ide of the sample i that set. We will ot make ay assumptios about the sum of the weights, that is we will ot require them to be ormalized. For eample, w,i, µ w,i i 7) Havig doe this we eed to re-eamie some of the logical steps i the previous sectios to esure they are still valid. I equatios 49 5, we used the fact that i the fied-weight settig, w i i W µ w )µ 7) I the ew settig, this equality is fairly obviously o loger true. For eample, if we are keepig weights ormalized the W.) Fortuately there is a differet middle step which justifies equatio 7 whe weights vary, so the results of sectio 4 remai valid. w,i i w, )µ 73) w,i i w,i i w,i w,i w i,i w,j w,i w w,i i,i w,i i w,i w,i 74) 75) w,i w i 76),i w,j w,i where j 77) This says that for the weighted mea formulae to remai valid the ew ad old weights should be cosistet. Equatio 75 says that we get the same result whe we calculate the mea of the previous workig set whether we use the old weights or the ew weights. Equatio 77 says that whe we ormalize the weights across the previous set up to ) we get the same set of weights whether we start from the old weights or the ew oes. This requiremet is t eough by itself to make the weighted variace formulae work, so we will eamie it agai below. 7 The epectatio fuctio At this poit it is worth defiig some better otatio to reduce the umber of summatios we eed to write. The epectatio fuctio is a geeralized versio of the mea, whose argumet is some arbitrary fuctio of each sample. E f)) w,i f i ) 78) E k) k 79) E af)) ae f)) 80) E f) + g)) E f)) + E g)) 8) µ E ) 8) σ E µ ) ) 83) E + µ µ ) 84) E ) + µ µ E ) 85) 5

6 E ) µ 86) E ) E ) 87) The icremetal formula is derived i the usual way. Equatio 9 is particularly useful. E f)) w,i f i ) 88) 8 Variable-weight variace w, f ) + w,i f i ) 89) w, f ) + w, ) w,if i ) w,i 90) w, f ) + w, ),if i ) w,i 9) w, f ) + w, )E f)) 9) E f)) E f)) + w, f ) E f))) 93) I equatios 6 63 we made the followig assumptios which are ot true whe weights ca vary. w,i i µ w,i i + W µ w, µ + W µ w, µ + w, )µ If we try to re-do the short derivatio of the icremetal stadard deviatio formula startig from S S the we soo get stuck. Fortuately the loger derivatio shows how to made it work. S σ 94) E µ ) ) 95) Simplify the first term: E [ µ ] [µ µ ]) ) 96) E [ µ ] + [µ µ ] [ µ ][µ µ ] ) 97) E [ µ ] ) + E [µ µ ] ) E [ µ ][µ µ ]) 98) E [ µ ] ) w, [ µ ] + w, )E [ µ ] ) 99) Simplify the secod term: Simplify the third term: w, [ µ ] + w, ) S W 00) w, S + [µ µ ] 0) W w, E [µ µ ] ) [µ µ ] 0) E [ µ ][µ µ ]) [µ µ ] E [ µ ] 03) 6

7 Back to the complete formula: [µ µ ] w, [ µ ] + w, )E [ µ ]) 04) [µ µ ] w, [ µ ] + w, )[E ) E µ )]) 05) [µ µ ] w, [ µ ] + w, )[µ µ ]) 06) [µ µ ]w, [ µ ] 07) [µ µ ] 08) S w, S + [µ µ ] + [µ µ ] [µ µ ] 09) W w, w, S + [µ µ ] w, [µ µ ] 0) W w, w, w, S + w, ) [µ µ ] ) W w, w, W S + w, )[µ µ ] µ ) ) S w, W S + w, µ ) µ ) 3) This is the same as equatio 68, ecept for the multiplier W w, W which captures the chage i weights betwee the old ad ew sets. w,,i W w w,j,i w,j where j 4) Now that we kow the rescalig trick which makes it work, we ca write dow the short versio. S w, S W E ) µ ) W w, ) E ) µ ) 5) E ) µ ) W E ) + w, + w, )µ 6) w, µ + w, )µ 7) w, µ ) + W µ µ ) 8) w, µ ) + W µ µ )µ + µ ) 9) w, µ + µ )µ + µ ) ) 0) w, µ ) µ ) ) 9 Epoetially-weighted mea ad variace Startig from equatio 53, let s set w, / to a costat 0 < α < ad let a α. This produces the stadard formula for the epoetially weighted movig average. µ µ + α µ ) ) α)µ + α 3) aµ + a) 4) I the followig it s more coveiet to use a lower boud of 0 istead of, i.e. 0 i. We are goig to show that the weights are reormalized each time a datum is added. First, we epad out the iductive defiitio of the mea. µ aµ + a) 5) a µ + a a) + a) 6) 7

8 a 3 µ 3 + a a) + a a) + a) 7) µ a 0 + a i a) i 8) This allows us to write dow the weights directly. Note that w, is idepedet of. w,0 a 9) w,i a i a), for i 30) w, a α 3) Sice w, α w, / we ca see that., that is, the weights are always ormalized. We ca get the same result by summig the geometric series. a i a j a a w,i j0 3) a i a) a 33) w,0 + These weights satisfy the cosistecy requiremet because w,j aw,j w,j w,i aw,i w,i w,i a + a ) 34) We ca use the epectatio fuctio to write dow the aïve formula for the variace. 35) E f)) E f)) + w, f ) E f))) 36) E f)) + αf ) E f))) 37) E ) E ) + α E )) 38) σ E ) µ 39) So usig the formula from the previous sectio we ca write the icremetal versio: S w, W S + w, µ ) µ ) 40) S α S + α µ ) µ ) 4) σ S S as + a) µ ) µ ) 4) This latter form is slightly more coveiet for code: diff : - mea icr : alpha * diff mea : mea + icr variace : - alpha) * variace + diff * icr) Refereces α)s + α µ ) ) 43) [] Doald E. Kuth. Semiumerical Algorithms, volume of The Art of Computer Programmig, chapter 4.., page 3. Addiso-Wesley, Bosto, third editio, 998. [] Eric W. Weisstei. Sample variace computatio. From Mathworld, a Wolfram web resource, 8

AQA Statistics 1. Numerical measures. Section 2: Measures of spread

AQA Statistics 1. Numerical measures. Section 2: Measures of spread Notes ad Eamples AQA Statistics 1 Numerical measures Sectio : Measures of spread Just as there are several differet measures of cetral tedecy (averages), there are a variety of statistical measures of

More information

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

More information

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean 1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.

More information

Section IV.5: Recurrence Relations from Algorithms

Section IV.5: Recurrence Relations from Algorithms Sectio IV.5: Recurrece Relatios from Algorithms Give a recursive algorithm with iput size, we wish to fid a Θ (best big O) estimate for its ru time T() either by obtaiig a explicit formula for T() or by

More information

Module 4: Mathematical Induction

Module 4: Mathematical Induction Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

Combining Multiple Averaged Data Points And Their Errors

Combining Multiple Averaged Data Points And Their Errors Combiig Multiple Averaged Data Poits Ad Their Errors Ke Tatebe August 10, 005 It is stadard practice to average measured data poits i order to suppress statistical errors i the fial results. Here, the

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties of MLE: consistency, asymptotic normality. Fisher information. Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

More information

Z-TEST / Z-STATISTIC: used to test hypotheses about. µ when the population standard deviation is unknown

Z-TEST / Z-STATISTIC: used to test hypotheses about. µ when the population standard deviation is unknown Z-TEST / Z-STATISTIC: used to test hypotheses about µ whe the populatio stadard deviatio is kow ad populatio distributio is ormal or sample size is large T-TEST / T-STATISTIC: used to test hypotheses about

More information

THE ABRACADABRA PROBLEM

THE ABRACADABRA PROBLEM THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected

More information

The second difference is the sequence of differences of the first difference sequence, 2

The second difference is the sequence of differences of the first difference sequence, 2 Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for

More information

8.1 Arithmetic Sequences

8.1 Arithmetic Sequences MCR3U Uit 8: Sequeces & Series Page 1 of 1 8.1 Arithmetic Sequeces Defiitio: A sequece is a comma separated list of ordered terms that follow a patter. Examples: 1, 2, 3, 4, 5 : a sequece of the first

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13 EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may

More information

Confidence Intervals for One Mean with Tolerance Probability

Confidence Intervals for One Mean with Tolerance Probability Chapter 421 Cofidece Itervals for Oe Mea with Tolerace Probability Itroductio This procedure calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) with

More information

The Euler Totient, the Möbius and the Divisor Functions

The Euler Totient, the Möbius and the Divisor Functions The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA 01075 1 Ackowledgemets This work was supported by the Mout Holyoke College fellowship

More information

Review for College Algebra Final Exam

Review for College Algebra Final Exam Review for College Algebra Fial Exam (Please remember that half of the fial exam will cover chapters 1-4. This review sheet covers oly the ew material, from chapters 5 ad 7.) 5.1 Systems of equatios i

More information

Confidence Intervals for One Mean

Confidence Intervals for One Mean Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a

More information

Fourier Series and the Wave Equation Part 2

Fourier Series and the Wave Equation Part 2 Fourier Series ad the Wave Equatio Part There are two big ideas i our work this week. The first is the use of liearity to break complicated problems ito simple pieces. The secod is the use of the symmetries

More information

when n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on.

when n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on. Geometric eries Before we defie what is meat by a series, we eed to itroduce a related topic, that of sequeces. Formally, a sequece is a fuctio that computes a ordered list. uppose that o day 1, you have

More information

7. Convergence in Probability Lehmann 2.1; Ferguson 1

7. Convergence in Probability Lehmann 2.1; Ferguson 1 7. Covergece i robability ehma 2.1; Ferguso 1 Here, we cosider sequeces X 1, X 2,... of radom variables istead of real umbers. As with real umbers, we d like to have a idea of what it meas to coverge.

More information

Lesson 15 ANOVA (analysis of variance)

Lesson 15 ANOVA (analysis of variance) Outlie Variability -betwee group variability -withi group variability -total variability -F-ratio Computatio -sums of squares (betwee/withi/total -degrees of freedom (betwee/withi/total -mea square (betwee/withi

More information

Sampling distributions and Estimation

Sampling distributions and Estimation Samplig distributios ad Estimatio Suppose we have a populatio about which we wat to kow some characteristic, e.g. height, icome, votig itetios. If it is a large populatio, it may be difficult to look at

More information

A Gentle Introduction to Algorithms: Part II

A Gentle Introduction to Algorithms: Part II A Getle Itroductio to Algorithms: Part II Cotets of Part I:. Merge: (to merge two sorted lists ito a sigle sorted list.) 2. Bubble Sort 3. Merge Sort: 4. The Big-O, Big-Θ, Big-Ω otatios: asymptotic bouds

More information

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern. 5.5 Fractios ad Decimals Steps for Chagig a Fractio to a Decimal. Simplify the fractio, if possible. 2. Divide the umerator by the deomiator. d d Repeatig Decimals Repeatig Decimals are decimal umbers

More information

1 The Binomial Theorem: Another Approach

1 The Binomial Theorem: Another Approach The Biomial Theorem: Aother Approach Pascal s Triagle I class (ad i our text we saw that, for iteger, the biomial theorem ca be stated (a + b = c a + c a b + c a b + + c ab + c b, where the coefficiets

More information

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,

More information

Revising algebra skills. Jackie Nicholas

Revising algebra skills. Jackie Nicholas Mathematics Learig Cetre Revisig algebra skills Jackie Nicholas c 005 Uiversity of Sydey Mathematics Learig Cetre, Uiversity of Sydey 1 1 Revisio of Algebraic Skills 1.1 Why use algebra? Algebra is used

More information

Chapter 9 Solutions Page 1 of 29 CHAPTER 9 EXERCISE SOLUTIONS

Chapter 9 Solutions Page 1 of 29 CHAPTER 9 EXERCISE SOLUTIONS Chapter 9 Solutios Page 1 of 29 CHAPTER 9 EXERCISE SOLUTIONS 9.1 a. Statistic because it is a sample value. b. Parameter because it is a populatio value. c. Statistic because it is a sample value d. Parameter

More information

Soving Recurrence Relations

Soving Recurrence Relations Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree

More information

A probabilistic proof of a binomial identity

A probabilistic proof of a binomial identity A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two

More information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

More information

4.1 Sigma Notation and Riemann Sums

4.1 Sigma Notation and Riemann Sums 0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas

More information

Handout: How to calculate time complexity? CSE 101 Winter 2014

Handout: How to calculate time complexity? CSE 101 Winter 2014 Hadout: How to calculate time complexity? CSE 101 Witer 014 Recipe (a) Kow algorithm If you are usig a modied versio of a kow algorithm, you ca piggyback your aalysis o the complexity of the origial algorithm

More information

Mgr. ubomíra Tomková. Limit

Mgr. ubomíra Tomková. Limit Limit I mathematics, the cocept of a "limit" is used to describe the behaviour of a fuctio as its argumet either gets "close" to some poit, or as it becomes arbitrarily large; or the behaviour of a sequece's

More information

5.3 Annuities. Question 1: What is an ordinary annuity? Question 2: What is an annuity due? Question 3: What is a sinking fund?

5.3 Annuities. Question 1: What is an ordinary annuity? Question 2: What is an annuity due? Question 3: What is a sinking fund? 5.3 Auities Questio 1: What is a ordiary auity? Questio : What is a auity due? Questio 3: What is a sikig fud? A sequece of paymets or withdrawals made to or from a accout at regular time itervals is called

More information

Derivation of the Poisson distribution

Derivation of the Poisson distribution Gle Cowa RHUL Physics 1 December, 29 Derivatio of the Poisso distributio I this ote we derive the fuctioal form of the Poisso distributio ad ivestigate some of its properties. Cosider a time t i which

More information

Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett

Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu> (March 16, 004) Factorig x 1: cyclotomic ad Aurifeuillia polyomials Paul Garrett Polyomials of the form x 1, x 3 1, x 4 1 have at least oe systematic factorizatio x 1 = (x 1)(x 1

More information

LEARNING OBJECTIVES. 2.1 Derivation by Recursion: F/P factor. 2.1 Basic Derivations: F/P factor. 2.1 P/F factor discounting back in time

LEARNING OBJECTIVES. 2.1 Derivation by Recursion: F/P factor. 2.1 Basic Derivations: F/P factor. 2.1 P/F factor discounting back in time LEARNING OBJECTIVES Developed By: Dr. Do Smith, P.E. Departmet of Idustrial Egieerig Texas A&M Uiversity College Statio, Texas Executive Summary Versio Chapter 2 Factors: How Time ad Iterest Affect Moey.

More information

INFERENCE ABOUT A POPULATION PROPORTION

INFERENCE ABOUT A POPULATION PROPORTION CHAPTER 19 INFERENCE ABOUT A POPULATION PROPORTION OVERVIEW I this chapter, we cosider iferece about a populatio proportio p based o the sample proportio cout of successes i the sample p ˆ = cout of observatios

More information

2. Introduction to Statistics and Sampling

2. Introduction to Statistics and Sampling . Defiitios. Itroductio to Statistics ad Samplig.. Populatio.. Sample..3 Probability..4 Cotiuous vs. discrete variables we will cocetrate o cotiuous variables. Graphical Represetatio of a Fiite Sample

More information

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample

More information

ORDERS OF GROWTH KEITH CONRAD

ORDERS OF GROWTH KEITH CONRAD ORDERS OF GROWTH KEITH CONRAD Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really wat to uderstad their behavior It also helps you better grasp topics i calculus

More information

NPTEL STRUCTURAL RELIABILITY

NPTEL STRUCTURAL RELIABILITY NPTEL Course O STRUCTURAL RELIABILITY Module # 0 Lecture 1 Course Format: Web Istructor: Dr. Aruasis Chakraborty Departmet of Civil Egieerig Idia Istitute of Techology Guwahati 1. Lecture 01: Basic Statistics

More information

Normal Distribution.

Normal Distribution. Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued

More information

Lesson 12. Sequences and Series

Lesson 12. Sequences and Series Retur to List of Lessos Lesso. Sequeces ad Series A ifiite sequece { a, a, a,... a,...} ca be thought of as a list of umbers writte i defiite order ad certai patter. It is usually deoted by { a } =, or

More information

The Stable Marriage Problem

The Stable Marriage Problem The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,

More information

7. Sample Covariance and Correlation

7. Sample Covariance and Correlation 1 of 8 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 7. Sample Covariace ad Correlatio The Bivariate Model Suppose agai that we have a basic radom experimet, ad that X ad Y

More information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

Notes 8 Autumn Some discrete random variables

Notes 8 Autumn Some discrete random variables MAS 108 Probability I Notes 8 Autum 2005 Some discrete radom variables We ow look at five types of discrete radom variables, each depedig o oe or more parameters. We describe for each type the situatios

More information

Asymptotic Growth of Functions

Asymptotic Growth of Functions CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

5 Boolean Decision Trees (February 11)

5 Boolean Decision Trees (February 11) 5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected

More information

Linear Algebra II. Notes 6 25th November 2010

Linear Algebra II. Notes 6 25th November 2010 MTH6140 Liear Algebra II Notes 6 25th November 2010 6 Quadratic forms A lot of applicatios of mathematics ivolve dealig with quadratic forms: you meet them i statistics (aalysis of variace) ad mechaics

More information

MATH 3070 Introduction to Probability and Statistics Lecture notes Relationships: Simple Regression

MATH 3070 Introduction to Probability and Statistics Lecture notes Relationships: Simple Regression Objectives: MATH 3070 Itroductio to Probability ad Statistics Lecture otes Relatioships: Simple Regressio 1. Lear the equatio for simple regressio 2. Compute the regressio equatio for a give data set Simple

More information

3. Continuous Random Variables

3. Continuous Random Variables Statistics ad probability: 3-1 3. Cotiuous Radom Variables A cotiuous radom variable is a radom variable which ca take values measured o a cotiuous scale e.g. weights, stregths, times or legths. For ay

More information

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio

More information

Definition 1. The prime counting function is π(x) = #{primes, p p < x}. Definition 2. The Logarithmic Integral is. dt log t.

Definition 1. The prime counting function is π(x) = #{primes, p p < x}. Definition 2. The Logarithmic Integral is. dt log t. 62-113 Exploratios i Number Theory Defiitio 1. The prime coutig fuctio is π(x) = #{primes, p p < x}. Defiitio 2. The Logarithmic Itegral is Li(x) := x dt log t x x log x. The followig famous result is

More information

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation HP 1C Statistics - average ad stadard deviatio Average ad stadard deviatio cocepts HP1C average ad stadard deviatio Practice calculatig averages ad stadard deviatios with oe or two variables HP 1C Statistics

More information

Hypothesis Tests Applied to Means

Hypothesis Tests Applied to Means The Samplig Distributio of the Mea Hypothesis Tests Applied to Meas Recall that the samplig distributio of the mea is the distributio of sample meas that would be obtaied from a particular populatio (with

More information

Section 1.6: Proof by Mathematical Induction

Section 1.6: Proof by Mathematical Induction Sectio.6 Proof by Iductio Sectio.6: Proof by Mathematical Iductio Purpose of Sectio: To itroduce the Priciple of Mathematical Iductio, both weak ad the strog versios, ad show how certai types of theorems

More information

Sequences and Series

Sequences and Series CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their

More information

Chapter 7: Confidence Interval and Sample Size

Chapter 7: Confidence Interval and Sample Size Chapter 7: Cofidece Iterval ad Sample Size Learig Objectives Upo successful completio of Chapter 7, you will be able to: Fid the cofidece iterval for the mea, proportio, ad variace. Determie the miimum

More information

Alternatives To Pearson s and Spearman s Correlation Coefficients

Alternatives To Pearson s and Spearman s Correlation Coefficients Alteratives To Pearso s ad Spearma s Correlatio Coefficiets Floreti Smaradache Chair of Math & Scieces Departmet Uiversity of New Mexico Gallup, NM 8730, USA Abstract. This article presets several alteratives

More information

5: Introduction to Estimation

5: Introduction to Estimation 5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample

More information

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5 Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

More information

Investigating Recursion Relations with Geometric Sequences

Investigating Recursion Relations with Geometric Sequences From Fiboacci to Fotrot: Ivestigatig Recursio Relatios with Geometric Sequeces 3 4 6 7 8 9 0 The Algebra Stadard from the Priciples ad Stadards for School Mathematics (NCTM, 000) states that all studets

More information

Learning outcomes. Algorithms and Data Structures. Time Complexity Analysis. Time Complexity Analysis How fast is the algorithm? Prof. Dr.

Learning outcomes. Algorithms and Data Structures. Time Complexity Analysis. Time Complexity Analysis How fast is the algorithm? Prof. Dr. Algorithms ad Data Structures Algorithm efficiecy Learig outcomes Able to carry out simple asymptotic aalysisof algorithms Prof. Dr. Qi Xi 2 Time Complexity Aalysis How fast is the algorithm? Code the

More information

The Discrete Fourier Transform

The Discrete Fourier Transform The Discrete Fourier Trasform Fracis J. Narcowich October 4, 2005 1 Motivatio We wat to umerically approximate coefficiets i a Fourier series. The first step is to see how the trapezoidal rule applies

More information

CHAPTER TWO PLANES AND LINES IN R 3

CHAPTER TWO PLANES AND LINES IN R 3 5 CHAPTER TWO PLANES AND LINES IN R 3.1 INTRODUCTION I this chapter we will use vector methods to derive equatios for plaes ad lies i three dimesioal space R 3. The derived equatios will be vector equatios

More information

Solving Logarithms and Exponential Equations

Solving Logarithms and Exponential Equations Solvig Logarithms ad Epoetial Equatios Logarithmic Equatios There are two major ideas required whe solvig Logarithmic Equatios. The first is the Defiitio of a Logarithm. You may recall from a earlier topic:

More information

Estimating the Mean and Variance of a Normal Distribution

Estimating the Mean and Variance of a Normal Distribution Estimatig the Mea ad Variace of a Normal Distributio Learig Objectives After completig this module, the studet will be able to eplai the value of repeatig eperimets eplai the role of the law of large umbers

More information

Maximum Likelihood Estimators.

Maximum Likelihood Estimators. Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio

More information

INTERVAL ESTIMATION OF THE POPULATION PROPORTION π

INTERVAL ESTIMATION OF THE POPULATION PROPORTION π ESTIMATION AND TESTING POPULATION PROPORTIONS 1 INTERVAL ESTIMATION OF THE POPULATION PROPORTION π Recall the biomial experimet i which we radomly select idividuals from a populatio ad record, for each

More information

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows: Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network

More information

Section 9.2 Series and Convergence

Section 9.2 Series and Convergence Sectio 9. Series ad Covergece Goals of Chapter 9 Approximate Pi Prove ifiite series are aother importat applicatio of limits, derivatives, approximatio, slope, ad cocavity of fuctios. Fid challegig atiderivatives

More information

Riemann Sums y = f (x)

Riemann Sums y = f (x) Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, o-egative fuctio o the closed iterval [a, b] Fid

More information

Section 7-3 Estimating a Population. Requirements

Section 7-3 Estimating a Population. Requirements Sectio 7-3 Estimatig a Populatio Mea: σ Kow Key Cocept This sectio presets methods for usig sample data to fid a poit estimate ad cofidece iterval estimate of a populatio mea. A key requiremet i this sectio

More information

A Simplified Binet Formula for k-generalized Fibonacci Numbers

A Simplified Binet Formula for k-generalized Fibonacci Numbers A Simplified Biet Formula for k-geeralized Fiboacci Numbers Gregory P. B. Dresde Departmet of Mathematics Washigto ad Lee Uiversity Lexigto, VA 440 dresdeg@wlu.edu Abstract I this paper, we preset a particularly

More information

1 Hypothesis testing for a single mean

1 Hypothesis testing for a single mean BST 140.65 Hypothesis Testig Review otes 1 Hypothesis testig for a sigle mea 1. The ull, or status quo, hypothesis is labeled H 0, the alterative H a or H 1 or H.... A type I error occurs whe we falsely

More information

Parametric Density Estimation:

Parametric Density Estimation: Parametric Desity stimatio: Maimum Likelihood stimatio Itroducto Bayesia Decisio Theory i previous lectures tells us how to desig a optimal classifier if we kew: P(c i ) (priors) P( c i ) (class-coditioal

More information

Randomized Algorithms I, Spring 2016, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 29, 2016)

Randomized Algorithms I, Spring 2016, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 29, 2016) Radomized Algorithms I, Sprig 0, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 9, 0). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black

More information

The Binomial Theorem

The Binomial Theorem The Biomial Theorem Itroductio You should be familiar with the followig formula: x + y 2 = x 2 + 2xy + y 2 The biomial theorem explais how to get a correspodig expasio whe the expoet is a arbitrary atural

More information

CHOOSING A SMOOTHING PARAMETER FOR A CURVE FITTING BY MINIMIZING THE EXPECTED PREDICTION ERROR

CHOOSING A SMOOTHING PARAMETER FOR A CURVE FITTING BY MINIMIZING THE EXPECTED PREDICTION ERROR CHOOSING A SMOOTHING PARAMETER FOR A CURVE FITTING BY MINIMIZING THE EXPECTED PREDICTION ERROR by Cristia Marioiu Abstrac.The value of the smoothig parameter for a curve fittig ca be chose by miimizig

More information

One-sample test of proportions

One-sample test of proportions Oe-sample test of proportios The Settig: Idividuals i some populatio ca be classified ito oe of two categories. You wat to make iferece about the proportio i each category, so you draw a sample. Examples:

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio

More information

Section 11.3: The Integral Test

Section 11.3: The Integral Test Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult

More information

Case Study. Normal and t Distributions. Density Plot. Normal Distributions

Case Study. Normal and t Distributions. Density Plot. Normal Distributions Case Study Normal ad t Distributios Bret Halo ad Bret Larget Departmet of Statistics Uiversity of Wiscosi Madiso October 11 13, 2011 Case Study Body temperature varies withi idividuals over time (it ca

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS

More information

A Recursive Formula for Moments of a Binomial Distribution

A Recursive Formula for Moments of a Binomial Distribution A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,

More information

10 Moment generating functions

10 Moment generating functions 10 MOMENT GENERATING FUNCTIONS 119 10 Momet geeratig fuctios If X is a radom variable, the its momet geeratig fuctio is { φ(t) = φ X (t) = E(e tx x ) = etx P(X = x) i discrete case, etx f X (x)dx i cotiuous

More information

Continuous Random Variables

Continuous Random Variables Cotiuous Radom Variables Math 394 1 (Almost bullet-proof) Defiitio of Expectatio Assume we have a sample space Ω, with a σ algebra of subsets F, ad a probability P, satisfyig our axioms. Defie a radom

More information

HW 1 Solutions Math 115, Winter 2009, Prof. Yitzhak Katznelson

HW 1 Solutions Math 115, Winter 2009, Prof. Yitzhak Katznelson HW Solutios Math 5, Witer 2009, Prof. Yitzhak Katzelso.: Prove 2 + 2 2 +... + 2 = ( + )(2 + ) for all atural umbers. The proof is by iductio. Call the th propositio P. The basis for iductio P is the statemet

More information

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

More information

if A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S,

if A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S, Lecture 5: Borel Sets Topologically, the Borel sets i a topological space are the σ-algebra geerated by the ope sets. Oe ca build up the Borel sets from the ope sets by iteratig the operatios of complemetatio

More information

USING STATISTICAL FUNCTIONS ON A SCIENTIFIC CALCULATOR

USING STATISTICAL FUNCTIONS ON A SCIENTIFIC CALCULATOR USING STATISTICAL FUNCTIONS ON A SCIENTIFIC CALCULATOR Objective:. Improve calculator skills eeded i a multiple choice statistical eamiatio where the eam allows the studet to use a scietific calculator..

More information

x : X bar Mean (i.e. Average) of a sample

x : X bar Mean (i.e. Average) of a sample A quick referece for symbols ad formulas covered i COGS14: MEAN OF SAMPLE: x = x i x : X bar Mea (i.e. Average) of a sample x i : X sub i This stads for each idividual value you have i your sample. For

More information

Chapter 7. Inference for Population Proportions

Chapter 7. Inference for Population Proportions Lecture otes, Lag Wu, UBC 1 Chapter 7. Iferece for Populatio Proportios 7.1. Itroductio I the previous chapter, we have discussed the basic ideas of statistical iferece. To illustrate the basic ideas,

More information

Winter Camp 2012 Sequences Alexander Remorov. Sequences. Alexander Remorov

Winter Camp 2012 Sequences Alexander Remorov. Sequences. Alexander Remorov Witer Camp 202 Sequeces Alexader Remorov Sequeces Alexader Remorov alexaderrem@gmail.com Warm-up Problem : Give a positive iteger, cosider a sequece of real umbers a 0, a,..., a defied as a 0 = 2 ad =

More information

4.1 Polynomial Functions and Models

4.1 Polynomial Functions and Models 41 Polyomial Fuctios ad Models Sectio 41 Notes Page 1 Polyomial Fuctio: a x a 1 x a x a 1 1 o The i the formula above is called the degree, ad this is the largest expoet of the polyomial A polyomial ca

More information

Estimation COMP 245 STATISTICS. Dr N A Heard. 1 Parameter Estimation Introduction Estimators... 2

Estimation COMP 245 STATISTICS. Dr N A Heard. 1 Parameter Estimation Introduction Estimators... 2 Estimatio COMP 45 STATISTICS Dr N A Heard Cotets 1 Parameter Estimatio 1.1 Itroductio........................................ 1. Estimators......................................... Poit Estimates 3.1 Itroductio........................................

More information