COORDINATION OF PPS SAMPLES OVER TIME

Size: px
Start display at page:

Download "COORDINATION OF PPS SAMPLES OVER TIME"

Transcription

1 COORDINATION OF PPS SAMPLES OVER TIME Esbjörn Ohlsson, Stockholm Unversty Mathematcal Statstcs, Stockholm Unversty, S Stockholm, Sweden esbj@matematk.su.se ABSTRACT Probablty proportonal to sze (PPS) samplng fnds applcaton n busness surveys both for the frst stage of a mult-stage desgn, and for drect samplng of busnesses from a lst frame. In both cases there s a need to update samples from tme to tme, whle retanng as many unts as possble from the old sample. In the second type of applcaton there s also a need for negatve coordnaton of surveys to get an even dstrbuton of response burden. Further requrements on the samplng procedures are smplcty n applcaton and n estmaton of varance. We present varous permanent random number technques that meet these requrements and compare them to a few other methods, and present a smulaton study on expected overlap. Key Words: Postve Coordnaton, Negatve Coordnaton, Overlap Control, Permanent Random Numbers 1. THE PROBLEM Applcatons of PPS samplng n busness surveys can be splt nto two man categores: (a) samplng from area frames wth a mult-stage desgn and (b) samplng ultmate unts drectly from a lst frame. The classcal stuaton for (a) s a mult-stage sample where prmary samplng unts are drawn wth probablty proportonal to some measure of the unt's sze (PPS). Typcally, due to extensve stratfcaton, just a few unts are selected n each stratum. As an example we consder a master sample of stretches of road, mantaned by the Swedsh Natonal Road Admnstraton. Even though the frst stage sample sze s 84, extensve stratfcaton results n stratum sample szes n=1, throughout. In each sampled unt, nvestments are made, e.g. on equpment to measure traffc flow, and ths, of course, s a strong argument for retanng the sample over the years. Another argument s that the man nterest n samples from ths frame s n estmates of change over tme, for whch retanng the same unts mproves precson. The szes of the unts are based on a rotatng census that gves estmates of traffc mleage per year for one thrd of the unts each year. Snce these szes changes substantally over the years, there s a regular need to update the samples, f not every thrd year so at least each decade. Else, there would fnally be a great loss n effcency n the estmates from surveys usng the master sample. Furthermore, at rregular ntervals there are changes n the classfcaton of roads that underles the stratfcaton: e.g., roads may change from county to natonal or even European hghway status. Also, there are some new roads (brths) and roads that are no longer n the populaton (deaths). We conclude that n ths survey, as n most repettve surveys, there s a need for updatng the sample to account for new szes, stratum/classfcaton changes plus brths and deaths, whle retanng as many unts as possble from the old sample. In ths example, the wthn strata sample szes were n=1, as s the case wth several major surveys such as the US Consumer Expendture Survey and the US Current Populaton Survey. Ths mght explan why ths case has receved consderable attenton n the lterature see e.g., Keyftz (1951), Ksh and Scott (1971) and Causey, Cox and Ernst (1985). Several newer references can be found n the overvew by Ernst (1999). In the present paper we wll put a specal emphass on the case n=1, but we wll also consder PPS samples of other. The second type of applcaton of PPS samplng s the case where we have a lst frame wth ultmate samplng unts, often n the form of a busness regster. The most common desgn n ths case seems to be a stratfed smple random sample (STSI). Sample coordnaton wth ths knd of desgn was dscussed extensvely at the 1993 ICES meetng, see Ohlsson (1995) and Srnath and Carpenter (1995). It s also a topc at the ICES II meetng, see McKenze and Gross (1999) and Royce (1999). In these cases, there s both stratfcaton by ndustry and by sze. The PPS alternatve means that the stratfcaton by ndustry s kept whle stratfcaton by sze s replaced by PPS samplng. One advantage of ths knd of desgn s that the sze measure s more extensvely exploted. 255

2 One example of a PPS desgn of ths second knd s the sample of outlets for the Swedsh CPI. In an nvestgaton of the sample of retal traders for the Swedsh Consumer Prce Index, Ålenus (1990) consdered the sample of n=41 department stores out of N=259 unts n that ndustral stratum, wth prces of two dfferent commodtes as target varables. Wth a standard sze stratfcaton, usng four strata, STSI gave twce the varance of PPS samplng. Even when the STSI desgn was refned to use 41 strata and a rato estmator was used (treatng sze as an auxlary varable), STSI gave around 25 percent larger varance than PPS. For the NASS Crops Survey, Baley & Kott (1997) found PPS samplng to be more effcent than STSI for most crops. The concluson s that there are busness surveys for whch a PPS desgn s preferable to STSI from an effcency pont of vew. Furthermore, f the PPS samplng procedure s smple to mplement, a PPS desgn s smpler to admnstrate, wth much fewer strata to construct, allocate and mantan. Even f we do not clam PPS to be generally preferable to STSI, t should be consdered a strong canddate for busness survey desgns. A necessary condton for ths s that the PPS procedure nvolved s smple to use n practce. Smple and effcent PPS procedures are the man topc of ths paper. 2. SPECIFICATION FOR PPS COORDINATION There are an mmense number of PPS procedures avalable n the lterature, see Brewer & Hanf (1983). Most of these are not proper for sample coordnaton, though. In fact, we beleve that lack of smple, effcent PPS procedures that can produce coordnated samples may be a reason for the extensve use of STSI nstead of PPS samplng. We now specfy n more detal our requrements on a smple and effcent PPS samplng procedure wth capablty of handlng sample coordnaton. The (stratum) populaton s U=1,2,,N. In the frame (whch s supposed to be a lst even n case a) there s a nonnegatve auxlary varable p 1, p 2,,p N. In applcatons, p s usually a measure of the sze of unt. We assume that the p :s have been normed so that p = 1, wthn each stratum. Särndal, Swensson and Wretman (1992, p. 90) gve a lst on desrable propertes of a PPS procedure. Appled to the stuaton wth two samples that are to be coordnated, ther frst two propertes gve us the followng three requrements: () Relatve smplcty n applcaton. () For the frst sample π = Pr( s) = np, U. () For the second sample π = Pr( s ) = n p, U '. Here π = Pr( s) denotes actual ncluson probablty of unt n the frst sample s. All quanttes relatng to the second sample s' wll be equpped wth a prme, as n p. Särndal et al. add three condtons that enable varance estmaton wth the Sen-Yates-Grundy estmator. In a later artcle, Särndal (1996) argues for the use of procedures that allow smple, sngle-sum varance estmaton. We agree wth ths pont of vew and get (v) Avalablty of a varance estmator, preferably expressed as a sngle sum. (Not relevant for n=1.) Fnally, we add three condtons that are partcular for the problem of overlap control. Note that the expected number of unts n common to two samples s Pr( s, s ) (1) (v) Possblty of postve sample coordnaton of two or more samples wth dfferent sze measures p, dfferent strata and dfferent n, preferably wth maxmzaton of the expected sample overlap n (1). 256

3 (v) Possblty of negatve sample coordnaton, of two or more samples wth dfferent sze measures p, dfferent strata and dfferent n, preferably wth mnmzaton of the expected sample overlap n (1). (v) On each occason, all strata are sampled ndependent of each other. For the second sample ths means that Pr( s, j s ) = Pr( s ) Pr( j s ) whenever and j are n dfferent strata. As noted by Ernst (1999), condton (v) s not satsfed by most overlap procedures that allow for dfferent stratfcaton. Ths condton s mportant for obtanng unbased varance estmates and, above all, for the possblty to apply the sample overlap procedure repeatedly. Särndal et al. (1992, p. 90) remark that t s not easy to devse a (fxed-sze) procedure havng the propertes desrable for PPS samplng, even at a sngle occason. It s thus futle to hope for a procedure for samplng on two occasons, wth overlap control, that fulfls all our requrements ()-(v). Instead, we have to look for procedures that are reasonably good at ()-(v). We start out wth a procedure that s not fxed-sze,.e. t gves a random sample sze. 3. POISSON SAMPLING AND THE IDEA OF PRN In Posson samplng, each unt s gven an ndependent, unformly dstrbuted random number X on the nterval (0,1). Unt s ncluded n the sample s f X np. Posson samplng can be used for sample coordnaton by savng the X as permanent random numbers (PRN). Ths dea s due to Brewer, Early and Joyce (1972) and means that when a second sample s to be drawn, we use the same random numbers as n the frst, but we update the szes p, the stratfcaton, and the sample sze n. Note that the quanttes p and n relates to the stratum where s located n the second desgn, whch may or may not be the same as n the frst desgn. (For smplcty n notaton, we refran from usng stratum sub-ndexes.) A vrtue of Posson samplng s that t s very smple to apply,.e. requrement () met. Further, t s readly seen that ths procedure s strctly PPS so that () and () are fulflled. A sngle-sum varance estmator (v) s avalable, see Brewer and Hanf (1983, p. 83). The probablty of ncludng unt n two samples drawn wth PRN Posson samplng s obvously Pr( s, s ) = mn( np, n p ) (2) Ths s of course the largest possble probablty, yeldng a strct maxmum (1). Negatve coordnaton can be acheved by shftng the PRN an amount c to the rght before the selecton of the second sample, gvng new random * numbers X = X + c. If m samples are to be negatvely coordnated, the choce c = 1/ m should gve a small sample overlap. In partcular, f the target ncluson probabltes np are less than 1/m for all unts n all m desgns, the * expected overlap s 0. In the case of m=2, an alternatve s to use antthetc random numbers, X = 1 X whch gves mnmum expected sample overlap for any target probabltes. We conclude that both (v) and (v) are satsfed. Fnally, all unts are sampled ndependently and n partcular (v) s met. It may appear as f we have found the optmal procedure for PPS sample coordnaton. However, Posson samplng has the drawback of gvng a random sample sze (wth expected value n). Ths has two mplcatons: The frst s that there s a rsk for n=0 n some stratum. Snce the random sample sze s approxmately Posson dstrbuted, the probablty of ths to happen when we have H strata, all wth sample sze n, s ( ) H 1 e n 1. In order for ths quantty to be neglgble we must avod small n, where the magntude of small of course depends on H. The concluson s that Posson samplng can not be used n all stuatons, and n partcular not n those wth n=1 or 2. Even when the probablty of some zero sample sze s neglgble, the randomness n sample sze may serously dsturb the ntended sample allocaton over strata, wth a loss n effcency of the estmates. 257

4 The second, less serous, drawback of the random sample sze s that t should be clear that nference should be made condtonal on the sample sze actually obtaned. Condtonal on the actual sample sze, the probabltes of ncluson are no longer exactly PPS and they are n fact very hard to compute, see Ares (1999). 4. FIXED SIZE PROCEDURES We now look at fxed-sze alternatves to Posson samplng, startng wth the case n=1. In ths secton we restrct the attenton to PRN procedures. Collocated samplng, by Brewer et al (1972), cannot be used to coordnate samples wth dfferent stratfcaton, and wll therefore not be consdered here. 4.1 The case n=1 A samplng desgn s a probablty dstrbuton on all possble sets of samples. Wth ths defnton, PPS samplng wth fxed sze n=1 s unque. The tradtonal samplng procedure for realzng a PPS sze one sample uses just one random number. For the applcaton of PRN sample coordnaton, we need a procedure that uses ndvdual random numbers for all unts. Such a procedure s Exponental samplng, presented n Ohlsson (1996). Startng wth a set of PRN, { X ; = 1,2,... N}, we compute the transformed random numbers ξ = log( 1 X )/ p, whch are exponentally dstrbuted wth mean 1 / p. The unt wth the smallest ξ s selected for the sample. By a wellknown result from probablty theory, the probablty of selectng unt s p, as requred. Coordnaton of samples s acheved by usng PRN as descrbed for Posson samplng above. Exponental samplng does not reach the optmal expected overlap n (v) and (v), but s not too far away, see the numercal examples below. A formula for expected overlap for postve coordnaton was gven n Ohlsson (1996). Snce ths procedure s very smple to mplement, () s fulflled along wth ()-(); (v) s not relevant snce n=1. We just mentoned that (v)-(v) are fulflled. Fnally, t s not hard to see that (v) s satsfed. We conclude that Exponental samplng s a strong canddate for coordnated PPS samplng when n= The case n>1 Unlke the n=1 case, PPS samplng wth n>1 can be done n several dfferent ways. Most of these can not be used n connecton wth PRN, snce ths requres procedures that use ndvdual random numbers for the unts. A natural dea s to extend Exponental samplng to n>1, by selectng the unts wth the n smallest transformed random numbers. Unfortunately, ths yelds so called successve samplng (Cochran, 1977, Secton 9A.8) whch s not strctly PPS. The actual ncluson probabltes may be qute far from the target values. Cochran (1977) presents several technques for handlng ths problem, of whch we consder Brewer s method for n=2. In our context, ths method can be appled by drawng the frst unt as n Exponental samplng, but wth transformed random numbers ( X ) log 1 ξ = (3) p (1 p ) /(1 2 p ) After removng the unt drawn n the frst round, a second unt s drawn wth the transformed random numbers of Exponental samplng ξ = log( 1 X )/ p. Cochran (1977, Secton 9A.8) shows that these two steps yeld a sze n=2 sample wth the requred ncluson probabltes,.e. meets () and (). The procedure s relatvely smple (), and has the same propertes as Exponental samplng as regards (v)-(v). It also allows unbased varance estmaton wth the Sen-Yates-Grundy estmator. Ths s not a sngle-sum estmator, though, so (v) s not completely met. The extenson of Brewer s method to n>2 by Sampford (1967) s rather complcated and wll not be consdered here. Ohlsson (1990 and 1998) gave an alteraton of Posson samplng called Sequental Posson samplng (SPS). Ths procedure uses the transformed random numbers ξ = X / p and selects the n unts wth the smallest such numbers. 258

5 The sample wll be close to a Posson sample, snce the latter selects the unts wth ξ n. Not surprsng, the propertes are approxmately the same as those of Posson samplng, but the sze s fxed. The procedure s very smple (), admts smple-sum varance estmaton (v) and yelds ndependent strata (v). It s approxmately PPS, n the meanng of () and (), a fact whch s motvated by asymptotcs and smulaton n Ohlsson (1998). Even though sample coordnaton s not optmal, n terms of maxmum and mnmum expected overlap n (v) and (v), respectvely, we can expect the overlap not to be too far from the optmum of Posson samplng. The case of postve coordnaton s nvestgated n a smulaton study n the next chapter. Rosén (1997) gave an alteraton of SPS, called Pareto samplng (PAS), wth transformed random numbers of odds rato type X /(1 X ) ξ = (4) np /(1 np ) The propertes are smlar to those of SPS, but PAS s somewhat closer to the target ncluson probabltes n () and (). The closeness to the optmum n (v) s nvestgated n the smulaton study below. 5. COMPARISON WITH OTHER PROCEDURES 5.1 The case n=1 In the lterature, there are several (non-prn) procedures for postve coordnaton (maxmzng overlap) of two PPS sze n=1 samples. The poneerng procedure by Keyftz (1952) assumes the same stratfcaton for both samples. Condtonal on the frst sample, Keyftz method focuses on the second sample. Suppose unt was selected n the frst sample. Keyftz method retans ths unt n sample f t s ncreasng,. e. p p. Else, the unt s retaned wth probablty p / p. If the unt s rejected, one of the ncreasng unts are selected wth probablty proportonal to the ncrements ( p p ). It s easly verfed that ths smple procedure s strctly PPS and s optmal n terms of maxmzng expected sample overlap, when we have the same stratfcaton for both samples. Keyftz' procedure can be extended to the case wth (somewhat) changng strata. We wll descrbe ths procedure for a sngle new stratum. Frst dentfy an old stratum whch wll be consdered as the predecessor of our new stratum. Unts comng from other old strata, mmgrants, are treated as brths,.e., they are assgned the value p = 0. Any frst sample selecton among mmgrants s gnored. Then the orgnal Keyftz algorthm s appled to the new stratum, but the frst two steps are only appled to an eventual ntal selecton that s not an mmgrant. Ksh and Scott (1971) note that ths procedure can be far from optmal n terms of expected overlap unless we have very small dfferences n the stratfcaton of the two samples. They provde three methods (besde the extended Keyftz procedure) for the case wth arbtrary stratfcaton of the two samples. We shall consder only Method II, whch s clamed by Ksh and Scott to gve the largest overlap of the three, wthout beng very complcated. The procedure s an elaborated extenson of Keyftz method. For a descrpton, we refer to the orgnal artcle. The procedure has the dsadvantage of dstortng the ndependence between the strata,.e., t does not fulfl requrement (v). As already noted, ths mples that the procedure can not be appled repeatedly to the same survey. Lke Keyftz procedure, Ksh and Scott only concerns the second sample, so that () s trval. In ther secton 6.2, Ksh and Scott (1971) prove that the procedure fulfls (). The proof reles on the ndependence of the ntal strata, though. A consequence of the dependence of the new strata s therefore that the procedure s not strctly vald for repeated use,.e., () s only vald the frst tme the method s appled. The expected overlap s qute close to optmum, see Secton

6 5.2 The case n>1 Causey, Cox and Ernst (1985) suggested a procedure whch maxmzes (or mnmzes) the expected overlap, subject to the constrants of havng the requred target probabltes n both samples,.e. condtons () and (). The problem s solved by lnear programmng methods. By desgn, ths procedure fulfls our requrement ()-() and s optmal n terms of our choce of (v) or (v). Ernst and Ikeda (1995) note two dffcultes wth the procedure whch can make t unusable n practce. One s that (v) s not fulflled, wth the same dffculty as for Ksh and Scott to apply the procedure repeatedly for the same survey, especally f n>1. The second dffculty s that the transportaton problem may be too large to solve n practce. In any case, () s not fulflled. Ernst (1999) revews several alteratons of the Causey, Cox and Ernst procedure, non of whch fulflls all our requrements. Sunter (1989) presents an nterestng procedure that s applcable for maxmzng overlap of two samples wth any sample sze n. It s a generalzaton of Keyftz procedure. Lke the latter, Sunter s procedure was not prmarly desgned for handlng stratum changes and can be expected to gve an overlap far from maxmum when we have large stratum dfferences between the two samples. 6. NUMERICAL EXAMPLES Below we report results from two numercal studes, one for n=1 and one for n=2 to The case n=1 The frst study concerns expected overlap of dfferent procedures for maxmzng overlap n the case n=1. It s based on the so called MU284 populaton of 284 Swedsh muncpaltes presented n Appendx B of Särndal et al. (1992). See Draw probabltes are ether equal or proportonal to the number of nhabtants, for the frst sample we use fgures from 1975 ( P75), and for the second sample those of 1985 ( P85). Frst sample strata are ether defned by the regonal REG varable, gvng 8 strata of szes between 15 and 56, or by the CL varable, wth 50 small strata wth szes between 5 and 8. The expected overlap was computed exactly (no smulaton) for PRN Exponental samplng (EXP), the extended Keyftz (KEY), the Ksh and Scott (K&S), and the Cox-Causey-Ernst (CCE) procedure. As benchmarks we use (a) the case wthout any overlap control, wth both samples drawn ndependently (IND) and (b) the non-achevable upper lmt (2), added over the strata. For further detals on the study, see Ohlsson (1996). Table 0. MU284 populaton. Expected overlap n eght regonal (REG) strata. Unequal probabltes. 50% of the unts move from each stratum to an adjacent stratum. Stratum N h IND EXP KEY K&S CCE Lmt Sum Percent

7 For the remanng set-ups, we present no stratum detals but just the sum n percent of the number of sampled unts. Table 1. n=1. MU284 populaton. Expected overlap n percent of total sample sze. No changes n strata. Strata Prob IND EXP KEY K&S CCE Lmt Medum (REG) Unequal Equal Small (CL) Unequal Table 2. n=1. MU284 populaton. Expected overlap n percent of total sample sze. One unt changes stratum. Strata Prob IND EXP KEY K&S CCE Lmt Medum (REG) Unequal Equal Small (CL) Unequal Table 3. n=1. MU284 populaton. Expected overlap n percent of total sample sze. 50% of unts change stratum. Strata Prob IND EXP KEY K&S CCE Lmt Medum (REG) Unequal Equal Small (CL) Unequal Table 4. n=1. MU284 populaton. Expected overlap n percent of total sample sze. One thrd of the unts move to the next stratum, one sxth to the followng. Strata Prob IND EXP KEY K&S CCE Lmt Medum (REG) Unequal Equal Small (CL) Unequal Note: CCE (Causey-Cox-Ernst procedure) ntractable n two strata. Unequal case not treated. 6.2 The case n>1 For n=2, 3, 4 we have conducted a smulaton study of expected overlap for sequental Posson samplng (SEP), and Pareto samplng (PAR). For n=2, we also consder exponental samplng (EXP), n the form usng Brewer s recalculated draw probabltes. The benchmarks IND and Lmt are as n the precedng secton. We use data from a master frame of the Swedsh Natonal Road Admnstraton. The statstcal unts are stretches of road and the sze measure s derved from traffc mleage per year. The unts are stratfed accordng to regon and type of road, altogether 28 strata wth 2523 unts. We let 10% of the unts change strata between the two samplng occasons. A more detaled report of the study s gven n Ohlsson (1999). The data are avalable at the address The smulatons were run wth teratons. 261

8 Table 5. n=2. Road populaton. Expected overlap by stratum. Stratum no. N h IND EXP SEP PAR Lmt Sum For n=3 and 4 we only gve the sum over strata. Table 6. Road populaton. Expected overlap, aggregated over strata. 10% of unts change stratum. Sample sze IND EXP SEP PAR Lmt n n= n= n= Incluson probabltes The PRN technques for n>1 are only approxmately (asymptotcally) PPS. Numercal studes ndcate that the approxmaton s very good n many stuatons. Ohlsson (1990, 1998) reports a smulaton study on CPI data, where SEP s very close to beng unbased. Rosén (1998) studes exact actual ncluson probabltes (AIP) for SEP and PAR n an artfcal, but nevertheless nterestng, stuaton, vz. when all unts have the same ncluson probablty except for one odd unt. Even wth sample szes as small as n=2, the relatve error n the AIP for PAR s never larger than 2% and n most cases t s much smaller. SEP s a bt further from the target probablty. The AIPs were also computed n the smulaton study mentoned n Secton 6.2. The results are reported n Ohlsson (1999). Here agan PAR s qute close to the unbased case, wth SEP performng a lttle bt less good. 262

9 7. CONCLUSIONS We frst consder the problem of maxmzng overlap, whch s the concern of the numercal studes. Usng any of the procedures under consderaton gves a great ncrease n (expected) sample overlap, as opposed to drawng ndependent samples (IND). For n=1, the Ksh and Scott procedure s qute close to the optmal (n ths respect) Cox, Causey and Ernst procedure. When there are great dfferences between the strata of the two samples, Keyftz' procedure s rather far from the maxmum expected overlap. Exponental samplng s a bt away from the optmum, but much less so than Keyftz. Snce the K&S and CCE both suffer from the problem of dependent strata,.e. volate (v), and snce the former does not fulfll (v) and the latter volates (), we consder Exponental samplng a good compromse n the search for a procedure that fulflls ()-() and (v)-(v) n as far as possble. Of the mentoned procedures, Exponental samplng and CCE are the only ones that can be used for mnmzng overlap (v). Turnng to the case n>1, we concluded n Secton 5.2 that CCE can be unusable n practce and that Sunter s procedure can be expected to gve a low sample overlap when there are great dfferences n stratfcaton between the two samples. Ths leaves us wth the PRN procedures, whch are all equal n sample overlap n our smulaton studes. Snce PAR s a bt closer to the rght ncluson probabltes t s generally preferable to SEP. EXP s an alternatve for n=2, beng strctly unbased, but t suffers from a more complcated varance estmaton procedure. In any case, the varous PRN technques nvestgated here are smple and effcent for smultaneous negatve and postve sample coordnaton of any number of surveys, wth any draw probabltes and any stratfcaton. When n>1, they all allow for varance estmaton, and all but Exponental have an assocated sngle-sum varance estmator. In summary, the PRN technques fulfll ()-(v) even though they do not strctly maxmze/mnmze the expected sample overlap. The overall concluson s that PRN procedures, n.b. Exponental samplng for n=1 and maybe n=2, and Pareto samplng for n>1, are compettve as procedures for controllng sample overlap. 8. REFERENCES Ares, N. (1999). Comparsons Between Condtonal Posson Samplng and Pareto πps Samplng Desgns, Contrbuted paper, Bulletn of the Internatonal Statstcal Insttute, 52nd Sesson. Ålenus, M. (1990). Storleksstratferng eller pps-urval? En jämförande stude för KPI-data, F-METOD NR 25, Statstcs Sweden. (In Swedsh.) Baley, J. T. and Kott, P.S. (1997). An Applcaton of Multple Lst Frame Samplng for Mult-Purpose Surveys, ASA Proceedngs of the Secton on Survey Research Methods. Brewer, K.R.W., Early, L.J. and Joyce, S.F. (1972). Selectng several samples from a sngle populaton, Australan Journal of Statstcs, 14, Brewer, K.R.W., and Hanf, M. (1983). Samplng Wth Unequal Probabltes. Sprnger, New York. Causey, B. D., Cox, L. H. and Ernst, L. R. (1985), Applcaton of Transportaton Theory to Statstcal Problems, Journal of the Amercan Statstcal Assocaton, 80, Cochran, W. G. (1977). Samplng Technques 3d ed., New York: John Wley. Ernst, L. R. (1999), The Maxmzaton and Mnmzaton of Sample Overlap Problems: A Half Century of Results, Invted Paper, Bulletn of the Internatonal Statstcal Insttute, 52nd Sesson. Ernst, L. R. and Ikeda, M. M. (1995), A Reduced-Sze Transportaton Algorthm for Maxmzng the Overlap Between Surveys, Survey Methodology, 21,

10 Keyftz, N. (1951), Samplng wth Probabltes Proportonal to Sze, Journal of the Amercan Statstcal Assocaton, 46, Ksh, L. and Scott, A. (1971), Retanng Unts After Changng Strata and Probabltes, Journal of the Amercan Statstcal Assocaton, 66, McKenze, R. and Gross, B. (1999), Synchronzed Samplng at the Australan Bureau of Statstcs. In ths volume. Ohlsson, E. (1990), Sequental Posson Samplng from a Busness Regster and ts Applcaton to the Swedsh Consumer Prce Index, R & D Report 1990:6, Statstcs Sweden. Ohlsson, E. (1995), Coordnaton of Samples Usng Permanent Random Numbers, In Busness Survey Methods, New York: Wley, Ohlsson, E. (1996), Methods for PPS Sze One Sample Coordnaton, Research Report No. 194, Insttute of Actuaral Mathematcs and Mathematcal Statstcs, Stockholm Unversty. Ohlsson, E. (1998), Sequental Posson Samplng, Journal of Offcal Statstcs, 14, Ohlsson, E. (1999), Methods for PPS Sze One Sample Coordnaton, Research Report No. 210, Insttute of Actuaral Mathematcs and Mathematcal Statstcs, Stockholm Unversty. Rosén, B. (1997b), On Samplng wth Probablty Proportonal to Sze, Journal of Statstcal Plannng and Inference, 62, Rosén, B. (1998), On Incluson Probabltes for Order Samplng, R & D Report 1998:2, Statstcs Sweden. To appear n Journal of Statstcal Plannng and Inference? Royce, D. (1999), Issues n Co-ordnated Samplng at Statstcs Canada, In ths volume. Sampford, M. R., (1967), On Samplng Wthout Replacement wth Unequal Probabltes of Selecton, Bometrka, 54, Särndal, C. E., (1996), Effcent Estmators Wth Smple Varance n Unequal Probablty Samplng, Journal of the Amercan Statstcal Assocaton, 91, Särndal, C. E., Swensson, B. and Wretman, J. (1992), Model Asssted Survey Samplng, New York: Sprnger-Verlag. Srnath, K.P. and Carpenter, R.M. (1995). Samplng Methods for Repeated Busness Surveys, In Busness Survey Methods, New York: Wley, Sunter, A. B (1989), Updatng Sze Measures n a PPSWOR Desgn, Survey Methodology, 15,

11 DISCUSSION OF SESSION 31: COORDINATING SAMPLING BETWEEN AND WITHIN SURVEYS Lawrence R. Ernst, U.S. Bureau of Labor Statstcs BLS, 2 Massachusetts Ave., N.E., Room 3160, Washngton, DC , U.S.A. ernst_l@bls.gov 1. CATEGORIZATION OF THE THREE PAPERS Although there are three papers n ths sesson, I vew them as fttng nto two categores of procedures for controllng sample overlap. The major focus of Ohlsson s paper s on an overlap procedure that he developed, exponental samplng, whch s n a class of procedures most commonly used n selectng PSUs for household surveys, although some establshment surveys also use PSUs. Perhaps the key characterstc of such procedures, whch orgnated wth Keyftz (1951), s that the sample sze per stratum, n, s always small, typcally ether 1 or 2, and we consequently desgnate these procedures as S procedures. The followng are common characterstcs of S procedures. For a gven stratum, n s predetermned, although n some desgns n may vary by stratum. Sample unts are selected pps. If n > 1, the jont selecton probabltes wthn a stratum are predetermned. Most S procedures, ncludng Ohlsson s procedure, although not all, allow for dfferent stratfcatons n the desgns beng overlapped. These procedures have been developed for overlap maxmzaton and/or mnmzaton, but not partal rotaton. S procedures generally do not use PRNs, wth Ohlsson s procedure the only excepton that I am aware of among procedures that strctly preserve the desred selecton probabltes. (We restrct the dscusson to such procedures.) Fnally, S procedures typcally overlap only two samples at a tme, wth agan Ohlsson s procedure an excepton. The McKenze and Gross (M&G) and Royce papers, n contrast, dscuss overlap procedures typcally used for selectng establshments from a stratfed lst frame, wth a key characterstc that these procedures must be capable of overlappng samples for whch n s large. Consequently, we desgnate these procedures as L procedures. In L procedures, n for a stratum may be ether predetermned, as n synchronzed samplng of the M&G paper, or varable, as n all the Statstcs Canada (STC) procedures descrbed n the Royce paper. The selecton of the sample unts s commonly, as n both of these papers, although not exclusvely, wth equal probablty. Jont selecton probabltes are generally nether predetermned, nor calculated. Typcally L procedures do not attempt to control overlap for unts changng strata. Ths s because, n addton to the extra complexty of attemptng to do so, the most common stratfcaton change s the occasonal establshment changng sze class. Both of these papers are exceptons because they do dscuss procedures that control overlap wth restratfcaton. In fact, ths s a key ssue n the M&G paper. L procedures are used for overlap maxmzaton, mnmzaton, and partal overlap, and all three applcatons are dscussed n both of these papers. L procedures commonly use PRNs, wth the procedure used by the Canadan Monthly Wholesale and Retal Trade Survey the only excepton n these two papers. Some L procedures are applcable to the overlap of more than two surveys at a tme. 2. OHLSSON PAPER I consder the procedure descrbed n Ohlsson s paper to be hghly nnovatve and an extremely mportant contrbuton to controllng overlap. Before dscussng other detals of the features of ths procedure, let me menton one mportant feature that s not mentoned n ths paper, but s descrbed n Ohlsson (1996). Suppose an ntal sample has been chosen, that s one not overlapped wth a prevous sample, wthout usng Ohlsson s procedure. Although t mght appear to be too late then to overlap a subsequent sample wth ths ntal sample usng hs procedure, t s shown n Ohlsson (1996) that for n = 1, PRNs can be assgned retrospectvely, condtoned on the ntal sample, and the Ohlsson procedure then appled to subsequent samples wth all the propertes of the procedure remanng unchanged. It s not presently known whether ths result can be extended to n > 1. Ohlsson s procedure, lke all overlap procedures, has both advantages and dsadvantages. The short lst of dsadvantages wll be mentoned frst. It s the only S overlap procedure that I am aware of that n the case when n = 1 and two samples wth dentcal stratfcaton are overlapped does not yeld the optmal overlap. All other S procedures reduce to Keyftz s (1951) procedure n that case. In partcular, Keyftz s procedure always retans n the new sample any sample unt n the ntal desgn that has a selecton probablty at least as large n the new desgn as n the ntal desgn. However, wth Ohlsson s procedure, such a unt can be replaced n the new sample by a unt wth a selecton probablty that has ncreased by a larger percentage n the new desgn. In addton, there are 265

12 lmtatons on the use of ths procedure. If n > 1 and Ohlsson s procedure was not used n selectng the ntal sample, then t cannot be used to select subsequent samples snce the procedure for retrospectvely assgnng PRNs mentoned above has only been developed for the case n = 1. In addton, regardless of n, f another overlap procedure had prevously been used that destroyed the ndependence of samplng from stratum to stratum, then Ohlsson s procedure cannot be used. Most of the advantages of Ohlsson s procedure partcularly apply when the surveys beng overlapped have dfferent stratfcatons, so we wll confne our dscusson to ths case, whch s the more common case n practce when n s small. Ohlsson s procedure s qute smple to mplement. Ths s partcularly noteworthy when n > 1, snce most alternatves procedures, ncludng Causey, et al. (1985), Ernst (1986), and Ernst and Ikeda (1995), employ lnear programmng algorthms, whch are generally not smple to mplement. Also, whch s the key pont of the procedure, t preserves the ndependence of samplng from stratum to stratum. Overlap procedures that requre the same stratfcatons n the surveys overlapped also automatcally satsfy ths ndependence. Besdes these procedures, the only other procedures that I am aware of that preserve ths ndependence do not predetermne the sample sze and hence are not S procedures. In addton to the advantages n varance estmaton, Ohlsson s procedure can be appled repeatedly as a result of ths ndependence property. Among alternatve procedures, some, such as Ksh and Scott (1971), Causey, et al. (1985), and Ernst and Ikeda (1995), can only be used once, snce they assume ths ndependence; whle others, such as Perkns (1970) and Ernst (1986), whch can be used repeatedly, tend to yeld an overlap that s further from optmal. To llustrate the resultng problems, consder the selecton of the PSUs for the U.S. Census Bureau s Survey of Income and Program Partcpaton. Ths survey s redesgned every 10 years. The PSUs were selected ndependently n the 1980s redesgn. For the 1990s selecton, the sample was overlapped wth the 1980s sample usng the Ernst and Ikeda (1995) procedure. For the 2000s redesgn, snce the Ernst and Ikeda procedure cannot be used agan, the Ernst (1986) procedure wll be used, whch should not produce as large an overlap. It mght have been better to have used Ohlsson s procedure throughout. It would be nterestng to emprcally compare the overlap produced by Ohlsson s procedure to that produced by the Ernst (1986) procedure, whch produces the best overlap among those procedures that can be used repeatedly because they do not assume ndependence from stratum to stratum. I suspect that the Ernst procedure would be superor when the surveys overlapped have smlar stratfcatons, snce the Ohlsson procedure s not optmal when the stratfcatons are dentcal. However, when the stratfcatons are very dfferent, Ohlsson s procedure may be superor, snce t s known that the Ernst procedure does not generally produce an overlap that s close to optmal under ths condton. 3. MCKENZIE AND GROSS PAPER I have always been mpressed wth the general approach n synchronzed samplng of movng the endponts to the rght whle keepng the samplng sze fxed, whch prevents unts that leave the sample at one tme perod as a result of more brths than deaths from reenterng the next tme perod as a result of more deaths than brths. The focus n ths paper, however, s not on synchronzed samplng n general, but on maxmzng or mnmzng overlap wth another stratfcaton of the same survey or wth one or more other surveys. As the authors note, the overlap attaned usng ther procedure s far from optmal because of the partal ntervals problem. The only way that I am aware of to avod ths problem wthout a transformaton of the PRNs s to have the new sample consst of several partal ntervals wth only unts n each partal nterval from the correspondng old stratum ncluded, f possble, rather than a sngle nterval wth all unts ncluded. I suspect that ths soluton would cause too many operatonal problems to be serously consdered. The fact that there s a bas wth ther procedure when the startng pont of the selecton nterval s the last pont that produces the maxmum score s llustrated by the followng smple example. Suppose a stratum n the new desgn conssts of two complete old strata, A and B, wth n = 1 for the new stratum and both old strata, and wth A consstng of more unts than B. Then the probablty s.5 that the last pont that produces the maxmum score s the sample pont n stratum A and the probablty s.5 that t s the sample pont n stratum B. Consequently, the selecton of the sample unt n the new stratum would not be wth equal probablty, but nstead each unt that was n stratum B would have a hgher selecton probablty than each unt that was n stratum A. I agree, as mentoned n M&G, that the use of the pont after last occurrence of maxmum score rather than the pont of the last occurrence as the startng pont of the selecton nterval tends to reduce the sze of the msallocaton, although I beleve ths whole ssue s complex and needs further study. Furthermore, for very small n, partcularly for n = 1, ths choce of 266

13 startng pont may reduce the effectveness of the overlap. To llustrate, consder the above example wth the pont after the last occurrence of the maxmum score as the startng pont. Then the sample unt n the new stratum would only have been a sample unt n the old desgn f the stratum A sample unt and stratum B sample unt are the frst and last ponts the new stratum, an event wth probablty lower than the probablty of overlap when the sample unt n the new stratum s selected ndependently of the selecton of the sample unts n the old strata. The avodable load measure used n the emprcal study s nterestng. However, t s a measure of hgh load, whle the maxmum score used n the overlap procedure attempts to mnmze a somewhat dfferent measure. For example, selectng two unts, one wth a hgh load and one wth a low load may result n a lower score but a hgher contrbuton to the avodable load than selectng two unts wth medum loads. I beleve t also would be worthwhle to compare the avodable load obtaned n the emprcal study usng ther overlap procedure to the avodable load obtaned selectng the samples for these 12 surveys ndependently. 4. ROYCE PAPER Although several approaches for sample coordnaton are dscussed n ths paper, STC appears to be standardzng for wthn survey sample coordnaton around GSAM, whch uses collocated random numbers (CRNs) that have at least two advantages over standard PRNs due to the equal spacng of the selecton numbers. Frst, CRNs help reduce the varablty of the sample sze when usng a fxed selecton nterval, although, partcularly because of brths and deaths, they do not completely elmnate t. In addton, an attempt to mnmze overlap among surveys by assgnng each survey dfferent startng ponts an approprate dstance apart cannot fal wth CRNs, as t can wth PRNs f most of the PRNs are clustered close to each other. CRNs also have dsadvantages n comparson wth PRNs. CRNs cannot be assgned on a flow bass, whch s why they could not be used n the Tax Estmates Program. Also coordnatng surveys wth dfferent stratfcatons or when restratfyng can be more complcated wth CRNs, as noted by Ohlsson (1995), snce the CRN for a unt s a functon of the number of unts n the stratum. One of the mportant features of GSAM s a procedure for maxmzng overlap when restratfyng a survey. GSAM accomplshes ths whle avodng the partal ntervals problem dscussed n the M&G paper and thus generally produces a larger overlap. Ths s done by assgnng new selecton numbers to the unts n a new stratum n a manner that clusters together as much as possble the unts that were n sample under the old stratfcaton. Usng ths approach for coordnatng among dfferent surveys mght lead to complcatons, however, because the same unt would have dfferent selecton numbers for dfferent surveys. An alternatve to the procedure descrbed for mnmzng the overlap between the crops and lvestock surveys would be to choose approprate startng ponts for the selecton ntervals for the two surveys and move both ntervals to the rght. For example, f the sample for one survey was three tmes larger than the sample for the other n a stratum, then the selecton nterval for the larger sample could start at 0 and for the smaller sample at Ths alternatve should result n a longer tme perod before the samples could overlap. However, I understand that ths alternatve was among those consdered by STC, but that t produced a larger overlap than the procedure adopted. The procedure descrbed for reducng respondent burden n SEPH for mult-establshment enterprses results n based estmates. In partcular, I beleve there may be a large underallocaton of establshments n large enterprses because of ths procedure. The network samplng approach used n UES s qute nterestng. It complcates estmaton and varance estmaton, however, as dscussed n Smard and Hdroglou (1999). 5. REFERENCES NOT LISTED IN SESSION PAPERS Ernst, L. R. (1986), Maxmzng the Overlap Between Surveys When Informaton Is Incomplete, European Journal of Operatonal Research, 27, pp Perkns, W. M. (1970), 1970 CPS Redesgn: Proposed Method for Dervng Sample PSU Selecton Probabltes Wthn 1970 NSR Strata, memorandum to Joseph Waksberg, Washngton, DC: U.S. Bureau of the Census. Any opnons expressed n ths dscusson are those of the author and do not consttute polcy of BLS. 267

14 268

Maximizing Overlap of Large Primary Sampling Units in Repeated Sampling: A comparison of Ernst s Method with Ohlsson s Method

Maximizing Overlap of Large Primary Sampling Units in Repeated Sampling: A comparison of Ernst s Method with Ohlsson s Method Maxmzng Overlap of Large Prmary Samplng Unts n Repeated Samplng: A comparson of Ernst s Method wth Ohlsson s Method Red Rottach and Padrac Murphy 1 U.S. Census Bureau 4600 Slver Hll Road, Washngton DC

More information

Sampling Theory MODULE VII LECTURE - 23 VARYING PROBABILITY SAMPLING

Sampling Theory MODULE VII LECTURE - 23 VARYING PROBABILITY SAMPLING Samplng heory MODULE VII LECURE - 3 VARYIG PROBABILIY SAMPLIG DR. SHALABH DEPARME OF MAHEMAICS AD SAISICS IDIA ISIUE OF ECHOLOGY KAPUR he smple random samplng scheme provdes a random sample where every

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

Estimation: Part 2. Chapter GREG estimation

Estimation: Part 2. Chapter GREG estimation Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the

More information

Chapter 3 Describing Data Using Numerical Measures

Chapter 3 Describing Data Using Numerical Measures Chapter 3 Student Lecture Notes 3-1 Chapter 3 Descrbng Data Usng Numercal Measures Fall 2006 Fundamentals of Busness Statstcs 1 Chapter Goals To establsh the usefulness of summary measures of data. The

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

Bayesian predictive Configural Frequency Analysis

Bayesian predictive Configural Frequency Analysis Psychologcal Test and Assessment Modelng, Volume 54, 2012 (3), 285-292 Bayesan predctve Confgural Frequency Analyss Eduardo Gutérrez-Peña 1 Abstract Confgural Frequency Analyss s a method for cell-wse

More information

Coordinating the PRN: Combining Sequential and Bernoulli-Type Sampling Schemes in Business Surveys

Coordinating the PRN: Combining Sequential and Bernoulli-Type Sampling Schemes in Business Surveys Coordnatng the PRN: Combnng Sequental and Bernoull-Type Samplng Schemes n Busness Surveys Ront Nrel, Aryeh Reter, Tzah Makovky and Moshe Kelner Central Bureau of Statstcs, Israel 66 Kanfey Nesharm St.,

More information

A Bound for the Relative Bias of the Design Effect

A Bound for the Relative Bias of the Design Effect A Bound for the Relatve Bas of the Desgn Effect Alberto Padlla Banco de Méxco Abstract Desgn effects are typcally used to compute sample szes or standard errors from complex surveys. In ths paper, we show

More information

Multivariate Ratio Estimator of the Population Total under Stratified Random Sampling

Multivariate Ratio Estimator of the Population Total under Stratified Random Sampling Open Journal of Statstcs, 0,, 300-304 ttp://dx.do.org/0.436/ojs.0.3036 Publsed Onlne July 0 (ttp://www.scrp.org/journal/ojs) Multvarate Rato Estmator of te Populaton Total under Stratfed Random Samplng

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA 4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected

More information

x = , so that calculated

x = , so that calculated Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

A note on regression estimation with unknown population size

A note on regression estimation with unknown population size Statstcs Publcatons Statstcs 6-016 A note on regresson estmaton wth unknown populaton sze Mchael A. Hdroglou Statstcs Canada Jae Kwang Km Iowa State Unversty jkm@astate.edu Chrstan Olver Nambeu Statstcs

More information

Simulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests

Simulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium? APPLIED WELFARE ECONOMICS AND POLICY ANALYSIS Welfare Propertes of General Equlbrum What can be sad about optmalty propertes of resource allocaton mpled by general equlbrum? Any crteron used to compare

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

18.1 Introduction and Recap

18.1 Introduction and Recap CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng

More information

Chapter 8 Indicator Variables

Chapter 8 Indicator Variables Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal

More information

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced, FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then

More information

Population element: 1 2 N. 1.1 Sampling with Replacement: Hansen-Hurwitz Estimator(HH)

Population element: 1 2 N. 1.1 Sampling with Replacement: Hansen-Hurwitz Estimator(HH) Chapter 1 Samplng wth Unequal Probabltes Notaton: Populaton element: 1 2 N varable of nterest Y : y1 y2 y N Let s be a sample of elements drawn by a gven samplng method. In other words, s s a subset of

More information

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Markov Chain Monte Carlo Lecture 6

Markov Chain Monte Carlo Lecture 6 where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways

More information

Appendix B: Resampling Algorithms

Appendix B: Resampling Algorithms 407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Analyss of Varance and Desgn of Experment-I MODULE VIII LECTURE - 34 ANALYSIS OF VARIANCE IN RANDOM-EFFECTS MODEL AND MIXED-EFFECTS EFFECTS MODEL Dr Shalabh Department of Mathematcs and Statstcs Indan

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information

A Robust Method for Calculating the Correlation Coefficient

A Robust Method for Calculating the Correlation Coefficient A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal

More information

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method

More information

A new construction of 3-separable matrices via an improved decoding of Macula s construction

A new construction of 3-separable matrices via an improved decoding of Macula s construction Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula

More information

A General Class of Selection Procedures and Modified Murthy Estimator

A General Class of Selection Procedures and Modified Murthy Estimator ISS 684-8403 Journal of Statstcs Volume 4, 007,. 3-9 A General Class of Selecton Procedures and Modfed Murthy Estmator Abdul Bast and Muhammad Qasar Shahbaz Abstract A new selecton rocedure for unequal

More information

On the correction of the h-index for career length

On the correction of the h-index for career length 1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat

More information

Using the estimated penetrances to determine the range of the underlying genetic model in casecontrol

Using the estimated penetrances to determine the range of the underlying genetic model in casecontrol Georgetown Unversty From the SelectedWorks of Mark J Meyer 8 Usng the estmated penetrances to determne the range of the underlyng genetc model n casecontrol desgn Mark J Meyer Neal Jeffres Gang Zheng Avalable

More information

Department of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution

Department of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution Department of Statstcs Unversty of Toronto STA35HS / HS Desgn and Analyss of Experments Term Test - Wnter - Soluton February, Last Name: Frst Name: Student Number: Instructons: Tme: hours. Ads: a non-programmable

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments

More information

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

VQ widely used in coding speech, image, and video

VQ widely used in coding speech, image, and video at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng

More information

Comparison of Regression Lines

Comparison of Regression Lines STATGRAPHICS Rev. 9/13/2013 Comparson of Regresson Lnes Summary... 1 Data Input... 3 Analyss Summary... 4 Plot of Ftted Model... 6 Condtonal Sums of Squares... 6 Analyss Optons... 7 Forecasts... 8 Confdence

More information

x i1 =1 for all i (the constant ).

x i1 =1 for all i (the constant ). Chapter 5 The Multple Regresson Model Consder an economc model where the dependent varable s a functon of K explanatory varables. The economc model has the form: y = f ( x,x,..., ) xk Approxmate ths by

More information

Efficient nonresponse weighting adjustment using estimated response probability

Efficient nonresponse weighting adjustment using estimated response probability Effcent nonresponse weghtng adjustment usng estmated response probablty Jae Kwang Km Department of Appled Statstcs, Yonse Unversty, Seoul, 120-749, KOREA Key Words: Regresson estmator, Propensty score,

More information

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering / Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons

More information

An (almost) unbiased estimator for the S-Gini index

An (almost) unbiased estimator for the S-Gini index An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for

More information

A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) ,

A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) , A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS Dr. Derald E. Wentzen, Wesley College, (302) 736-2574, wentzde@wesley.edu ABSTRACT A lnear programmng model s developed and used to compare

More information

Chapter 5 Multilevel Models

Chapter 5 Multilevel Models Chapter 5 Multlevel Models 5.1 Cross-sectonal multlevel models 5.1.1 Two-level models 5.1.2 Multple level models 5.1.3 Multple level modelng n other felds 5.2 Longtudnal multlevel models 5.2.1 Two-level

More information

Some modelling aspects for the Matlab implementation of MMA

Some modelling aspects for the Matlab implementation of MMA Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased

More information

Chapter 13: Multiple Regression

Chapter 13: Multiple Regression Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to

More information

Predictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore

Predictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore Sesson Outlne Introducton to classfcaton problems and dscrete choce models. Introducton to Logstcs Regresson. Logstc functon and Logt functon. Maxmum Lkelhood Estmator (MLE) for estmaton of LR parameters.

More information

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-

More information

SIMPLE LINEAR REGRESSION

SIMPLE LINEAR REGRESSION Smple Lnear Regresson and Correlaton Introducton Prevousl, our attenton has been focused on one varable whch we desgnated b x. Frequentl, t s desrable to learn somethng about the relatonshp between two

More information

Chapter 11: Simple Linear Regression and Correlation

Chapter 11: Simple Linear Regression and Correlation Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests

More information

Markov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement

Markov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs

More information

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1 Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons

More information

Limited Dependent Variables and Panel Data. Tibor Hanappi

Limited Dependent Variables and Panel Data. Tibor Hanappi Lmted Dependent Varables and Panel Data Tbor Hanapp 30.06.2010 Lmted Dependent Varables Dscrete: Varables that can take onl a countable number of values Censored/Truncated: Data ponts n some specfc range

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

Joint Statistical Meetings - Biopharmaceutical Section

Joint Statistical Meetings - Biopharmaceutical Section Iteratve Ch-Square Test for Equvalence of Multple Treatment Groups Te-Hua Ng*, U.S. Food and Drug Admnstraton 1401 Rockvlle Pke, #200S, HFM-217, Rockvlle, MD 20852-1448 Key Words: Equvalence Testng; Actve

More information

The Expectation-Maximization Algorithm

The Expectation-Maximization Algorithm The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.

More information

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

Lossy Compression. Compromise accuracy of reconstruction for increased compression. Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost

More information

Feature Selection: Part 1

Feature Selection: Part 1 CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

Hopfield Training Rules 1 N

Hopfield Training Rules 1 N Hopfeld Tranng Rules To memorse a sngle pattern Suppose e set the eghts thus - = p p here, s the eght beteen nodes & s the number of nodes n the netor p s the value requred for the -th node What ll the

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

Boostrapaggregating (Bagging)

Boostrapaggregating (Bagging) Boostrapaggregatng (Baggng) An ensemble meta-algorthm desgned to mprove the stablty and accuracy of machne learnng algorthms Can be used n both regresson and classfcaton Reduces varance and helps to avod

More information

See Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)

See Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition) Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes

More information

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,

More information

Online Appendix to: Axiomatization and measurement of Quasi-hyperbolic Discounting

Online Appendix to: Axiomatization and measurement of Quasi-hyperbolic Discounting Onlne Appendx to: Axomatzaton and measurement of Quas-hyperbolc Dscountng José Lus Montel Olea Tomasz Strzaleck 1 Sample Selecton As dscussed before our ntal sample conssts of two groups of subjects. Group

More information

Basically, if you have a dummy dependent variable you will be estimating a probability.

Basically, if you have a dummy dependent variable you will be estimating a probability. ECON 497: Lecture Notes 13 Page 1 of 1 Metropoltan State Unversty ECON 497: Research and Forecastng Lecture Notes 13 Dummy Dependent Varable Technques Studenmund Chapter 13 Bascally, f you have a dummy

More information

BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu

BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS M. Krshna Reddy, B. Naveen Kumar and Y. Ramu Department of Statstcs, Osmana Unversty, Hyderabad -500 007, Inda. nanbyrozu@gmal.com, ramu0@gmal.com

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

LINEAR REGRESSION ANALYSIS. MODULE VIII Lecture Indicator Variables

LINEAR REGRESSION ANALYSIS. MODULE VIII Lecture Indicator Variables LINEAR REGRESSION ANALYSIS MODULE VIII Lecture - 7 Indcator Varables Dr. Shalabh Department of Maematcs and Statstcs Indan Insttute of Technology Kanpur Indcator varables versus quanttatve explanatory

More information

Credit Card Pricing and Impact of Adverse Selection

Credit Card Pricing and Impact of Adverse Selection Credt Card Prcng and Impact of Adverse Selecton Bo Huang and Lyn C. Thomas Unversty of Southampton Contents Background Aucton model of credt card solctaton - Errors n probablty of beng Good - Errors n

More information

One-sided finite-difference approximations suitable for use with Richardson extrapolation

One-sided finite-difference approximations suitable for use with Richardson extrapolation Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,

More information

Copyright 2010 Cengage Learning, Inc. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part.

Copyright 2010 Cengage Learning, Inc. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. yes to (3) two-sample problem? no to (4) underlyng dstrbuton normal or can centrallmt theorem be assumed to hold? and yes to (5) underlyng dstrbuton bnomal? We now refer to the flowchart at the end of

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Statistics for Economics & Business

Statistics for Economics & Business Statstcs for Economcs & Busness Smple Lnear Regresson Learnng Objectves In ths chapter, you learn: How to use regresson analyss to predct the value of a dependent varable based on an ndependent varable

More information

Copyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor

Copyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

Chapter Newton s Method

Chapter Newton s Method Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

More information

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010 Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton

More information

Negative Binomial Regression

Negative Binomial Regression STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...

More information

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 ) Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often

More information