Imputation Methods for Longitudinal Data: A Comparative Study

Size: px
Start display at page:

Download "Imputation Methods for Longitudinal Data: A Comparative Study"

Transcription

1 Internatonal Journal of Statstcal Dstrbutons and Applcatons 017; 3(4): do: /j.sd ISSN: (Prnt); ISSN: (Onlne) Imputaton Methods for Longtudnal Data: A Comparatve Study Ahmed Mahmoud Gad 1, Rana Hassan Mohamed Abdelkhalek 1 Statstcs Department, Faculty of Economcs and Poltcal Scence, Caro Unversty, Caro, Egypt Department Statstcs, Mathematcs and Insurance, Faculty of Commerce, Benha Unversty, Benha, Egypt Emal address: Ahmed.gad@feps.edu.eg (A. M. Gad), gendy176@yahoo.com (R. H. M. Abdelkhalek) To cte ths artcle: Ahmed Mahmoud Gad, Rana Hassan Mohamed Abdelkhalek. Imputaton Methods for Longtudnal Data: A Comparatve Study. Internatonal Journal of Statstcal Dstrbutons and Applcatons. Vol. 3, No. 4, 017, pp do: /j.sd Receved: March 5, 017; Accepted: March 8, 017; Publshed: November 10, 017 Abstract: Longtudnal studes play an mportant role n scentfc researches. The defnng characterstc of the longtudnal studes s that observatons are collected from each subject repeatedly over tme, or under dfferent condtons. Mssng values are common n longtudnal studes. The presence of mssng values s always a fundamental challenge snce t produces potental bas, even n well controlled condtons. Three dfferent mssng data mechansms are defned; mssng completely at random (MCAR), mssng at random (MAR) and mssng not at random (MNAR). Several mputaton methods have been developed n lterature to handle mssng values n longtudnal data. The most commonly used mputaton methods nclude complete case analyss (CCA), mean mputaton (Mean), last observaton carred forward (LOCF), hot deck (HOT), regresson mputaton (Regress), K-nearest neghbor (KNN), The expectaton maxmzaton (EM) algorthm, and multple mputaton (MI). In ths artcle, a comparatve study s conducted to nvestgate the effcency of these eght mputaton methods under dfferent mssng data mechansms. The comparson s conducted through smulaton study. It s concluded that the MI method s the most effectve method as t has the least standard errors. The EM algorthm has the largest relatve bas. The dfferent methods are also compared va real data applcaton. Keywords: Dropout Mssng, Longtudnal Data, Mssng Data, Multple Imputatons, Sngle Imputaton 1. Introducton Longtudnal studes become an ncreasngly common research area especally n the feld of publc health and medcal scences. Such studes are desgned to nvestgate changes n a specfc varable, whch s measured repeatedly ether at dfferent tmes or under dfferent condtons. Mssng values are common n longtudnal studes because some ndvduals may mss a planned vst. There are many possble causes leadng to mssng values ncludng falure of measurement, accdents, errors resulted from collectng or enterng data, refusal to contnue, or other admnstratve reasons. Whenever there are mssng values, there s loss of nformaton, whch causes reducton n effcency. Also, under certan crcumstances, mssng data can ntroduce bas and thereby lead to msleadng nferences about the parameters. Mssng data can be classfed, based on the occurrence n tme, nto two patterns: ntermttent pattern and dropout pattern. The ntermttent mssngness, also termed as nonmonotone, means mssng values due to occasonally omsson, wth observed values afterwards. The dropout pattern, also termed monotone, where mssng values due to premature wthdrawal, wth no observed values afterwards (Gad and Ahmed [8]). Methods that handle mssng values depend upon the mechansm of mssngness. Mssng data mechansm refers to the underlyng process of generatng mssng data. Rubn [1] ntroduced three mssng data mechansms: mssng completely at random, mssng at random and mssng not at random. The mechansm s mssng completely at random (MCAR) f the mssngness s not related to any observed or unobserved responses. The mechansm s mssng at random (MAR) f the mssngness s ndependent of the unobserved data condtonal on observed responses, whereas the mechansm s mssng not at random (MNAR) f the mssngness depends on unobserved as well as some observed responses.

2 Internatonal Journal of Statstcal Dstrbutons and Applcatons 017; 3(4): Several statstcal approaches have been appled to the analyss of longtudnal data wth mssng values. These approaches should be selected based on the amount of mssngness and the mssngness mechansm. Some statstcal methods are vald only under certan stuatons wth specfed mssng rates. In other words, there s no unque best method avalable for all stuatons. Lttle and Rubn [1] revewed many tradtonal approaches for dealng wth mssng data and concluded that these methods are only approprate under the strong assumpton of MCAR mechansm. However, n practce the MAR mechansm s much more common than the MCAR mechansm. When the sze of the dataset s large enough, analyss can be conducted usng deleton methods such as the complete case analyss (CCA) method. The CCA can be used for any statstcal analyss and does not need specal computatons snce t s a default method n most statstcal computer packages. However, gnorng mssng values even n ths stuaton leads to loss of nformaton and reducton of statstcal power, whch may result n ncorrect statstcal nference. Imputaton methods are consdered as alternatves to the deleton methods. The term mputaton means replacng mssng values by other observed values or estmated values (Rubn [1]). However, even when an mputed value s closer to an deal predcted observaton; t s stll consdered as mputed data, not real data. The rule of thumb suggests that 0% or less of mssng data s acceptable rate to use mputaton methods (Lttle and Rubn [1]). The mputaton technques can be classfed accordng to the number of mputed values as sngle mputaton (SI) and multple mputatons (MI) methods. In SI technques each mssng observaton s replaced by a sngle value. In MI technques each mssng value s substtuted by two or more acceptable values to account for the uncertanty nherent n the mputaton process (Rubn [1]). Many smulaton studes have been conducted n lterature to evaluate the effcency of dfferent mputaton methods, see for example Engels and Dehr [6], Mshra and Khare [14], Naka [16], Naka and Ke [18], Naka et al. [17] and Zhu [8]. The man purpose of ths artcle s to compare the performance of eght mputaton methods. Ths s accomplshed by a smulaton study usng dfferent mssngness mechansms (MCAR, MAR, and MNAR) wth varous mssngness rates. For smplcty, and wthout loss of generalty, a monotone pattern of mssng data s assumed. The performance of mputaton methods s evaluated usng two crtera; the relatve bas (RB) and the mean squared error (MSE). The rest of the artcle s organzed as follows. In Secton, the basc notatons are descrbed. In Secton 3, dfferent mputaton approaches of handlng mssng data are revewed. In Secton 4, a smulaton study s presented to compare the eght mputaton methods. In Secton 5, the selected mputaton methods are appled to a data set concernng qualty of lfe among breast cancer patents n a clncal tral controlled by the Internatonal Breast Cancer Study Group. Fnally, Secton 6 s devoted to conclusons and dscussons.. Notaton For a longtudnal dataset wth balanced desgn all subjects have complete measurements and are measured on the same tme ponts. The man nterest s on the relatonshp between the response varable and some covarates. Unbalanced longtudnal data are possble when some values are ntermttently mssng or drop out from the data. The th repeated measures are potentally observed on the subject th at t = 1,, m; j = 1,, n and the total j tme ponts ( ) number of observatons s N= n. m Y represent the repeated response varables of subject, and (,, 1 X ) X = X are covarates or explanatory varables. p The y denotes the value of the varable Y and x k denotes the value of X k recorded at tme ( = = = ) t 1, m; j 1,, n ; k 1,, p. The (, T Y = y 1 yn ) k n p s a vector of values for the repeated measures and X = x s a matrx of values of tme-varyng or tmendependent covarates on the 3. Imputaton Methods th subject. Imputaton methods are used to compensate for the unt wth mssng values. Imputaton methods become mportant n statstcal analyss of ncomplete data. Some methods use only nformaton that belongs to the subject whose data were mssng, whle some used the values of other subjects. Imputaton methods are classfed based on the number of mputed values n place of mssng values nto sngle or multple mputatons. In sngle mputaton, each mssng value s mputed wth a sngle value whle n multple each mssng value s substtuted wth multple values producng several dfferent complete datasets. The eght mputaton methods are revewed n ths secton The Complete Case Analyss Method (CCA) The CCA s easy and straghtforward technque to handle mssng data. Ths method excludes all subjects, n the dataset, wth one or more mssng values at any measurement occason. Only cases havng complete observatons are consdered. The CCA method can be used for any type of statstcal analyss and does not need specal computatons snce t s the default method n most statstcal computer packages. If the mssng data mechansm s MCAR, the remanng sample of subjects can be consdered as a random sample from the orgnal sample. Ths mples that, for any parameter of nterest, f the estmates would be unbased for the full dataset wthout mssng data, they wll also be unbased for

3 74 Ahmed Mahmoud Gad1 and Rana Hassan Mohamed Abdelkhalek: Imputaton Methods for Longtudnal Data: A Comparatve Study the complete case dataset (Naka [15]). When the mssng data mechansm s not MCAR, the results from the CCA method may be based because the complete cases become unrepresentatve to the full populaton (Naka et al. [17]). Therefore, when the data s MCAR and only a small proporton of unts are excluded, ths method can be a sensble choce. 3.. The Mean Substtuton Method (MS) Based on mean mputaton method, the mean of the varable s consdered the best estmate of any subject who has mssng value for that varable. The mean value of non-mssng observatons s used to fll n mssng values for all observatons. Although mean substtuton mantans the same sample sze from reducton, t has some challenges. When data contans farly large mssngness rate, the mean mputaton method can dstort the dstrbuton of the varable because the possble extreme values are shfted to the mddle of the dstrbuton whch may complcate the analyss and results n underestmaton of the varance whch may cause large kurtoss (Lttle and Rubn [1]). The covarance also s underestmated because the mean mputaton for the mssng subjects has zero varance. In addton, ths mputaton method smlar to the CCA; t requres MCAR assumpton to obtan unbased and effcent estmates but ths assumpton s very restrctve The Last Observaton Carred Forward Method (LOCF) The LOCF method s a very common approach for handlng mssng data especally n dropout mssngness (Saha and Jones []). Ths method mputes the unobserved value by the last observed value for the same subject. For dropout mssngness, t s assumed that the last observed value s carred forward to the end of the study. Ths mples that the last observaton remans the same after dropout. The LOCF can also be appled to longtudnal data where the subjects are observed at several occasons, and some subjects are lost-to-follow up or have ntermttent mssng values. Ths stuaton could be consdered as unrealstc n many settngs. The LOCF method tends to underestmate the true varablty of the data. It s shown that LOCF method does not gve vald analyses f the mssngness mechansm s not MCAR (Lane [11]). However, t creates bas even f the strong MCAR assumpton s satsfed. The LOCF can gve satsfactory results, f the observatons n the dataset are approxmately close to each other. When the measurements occasons are short to some extent, ths ensures the effectveness of the LOCF method The Hot Deck (HOT) Method Ths method proposed by Madow et al. [13] n whch any mssng value of unt s replaced by a smlar respondng unt n the same sample. The respondng unt s chosen randomly or selected on the bass of smlarty crtera. In the case of more than one smlar subject to the subject whch contan the mssng values n the sample, the most smlar subject s selected and replace the mssng values from hs or her measurements. Also, n ths method the mssng value may be flled based on the correlaton among the varable contanng mssng data and the other varables whch has no mssng. Ths method performs well when the varable used to sort the data s hghly predctve of the varable wth the mssng values and when there s a large sample to ensure easly dentfyng a smlar case (Strener [5]). The hot deck method does not dstort the dstrbuton of the sampled values besdes the conceptual smplcty of applyng t. In addton, usng a smlarty crteron s a realstc matter and preserves some of the measurement error that would lkely be found f the value had been completed by the respondent. Based on the hot deck method, the standard devaton of the varable wth the nserted values s a better approxmate to the standard devaton value for the varable wthout the substtuted values. However, standard devatons are stll lkely to be lower (Strener [5]). It has some cautons lke dstortng of both correlatons and covarance because the mssng values are replaced wth values that already exst n the dstrbuton of scores. The smaller standard errors lead to greater lkelhood of a Type I error (Naka and Ke [18]) The K-Nearest Neghbors (KNN) Method Accordng to the KNN method, each mputed value s selected from the respondent who s the nearest to the subject wth mssng value based on the dstance between them. The dstance s computed usng the nformaton from the observed data. The KNN mputaton method s approprate only when the mssngness mechansm s MCAR. If MCAR assumpton s volated, ths leads to based results. Also, Rancourt et al. [0] stated that the mean estmates are unbased usng the KNN assumng the gnorable mssngness mechansm. Ths method has some nce features (Chen and Shao [3]). Frst, t s a hot deck method n the sense that donors are substtuted by a value from the same varable for a respondent of the same sample. The mputed values are actually occurrng values, and they may not be perfect substtutes, but are unlkely to be nonsenscal values. Second, the KNN method may be more effcent than the mean mputaton method, snce t makes use of auxlary nformaton provded by the x values and t s a nonrandom mputaton method. However, t does not use an explct model relatng y and x, hence, t s expected to be more robust aganst model volatons than other methods whch are based on explct models. Fnally, the KNN method provdes asymptotcally vald dstrbuton. Rancourt et al [0] stated that the KNN mputaton yelds normally pont estmates wth small or neglgble bas, assumng that a lnear relatonshp exsts between the varable of nterest y and the concomtant varable x used for nearest neghbor dentfed. But ths clam was not supported by any theoretcal result n general The Regresson Imputaton (Regress) Method Regresson mputaton method s sometmes dentfed as a

4 Internatonal Journal of Statstcal Dstrbutons and Applcatons 017; 3(4): condtonal mean mputaton. The basc dea behnd regresson method s dentfyng several predctors for the varable wth mssng values usng a correlaton matrx. The best predctors (the hghest correlatons) are selected and used as ndependent varables n a regresson equaton. The varable wth mssng data s used as a dependent varable. Ths varable s regressed on all other varables to produce a regresson equaton on the bass of the subjects wth complete data for the predctor varables. The regresson equaton s then used to replace mssng values for ncomplete subjects wth the predcted values. In an teratve process, the values for the mssng varable are nserted and then all subjects are used to predct the dependent varable. These steps are repeated untl there s lttle dfference between the predcted values from one step to the next, that s, they converge. The predctors from the last round are the ones whch are used to replace the mssng values (Saunders et al. [3]). Regresson assgns the subject s predcted value to the mssng value but subjects wth the same covarates wll exactly have the same mputed value (Engel and Dehr [6]). Ths method can yeld consstent estmates for the mean under normalty and MCAR assumpton for the mssng mechansm but, the sample covarance s underestmated (Lttle and Rubn [1]). Also, Allson [1] ponted out that regresson parameter estmates based on regresson mputaton under MCAR are relatvely unbased n large samples. However, t has two problems stemmng from the fact that the mputed values were perfectly predcted from other varables, they tend to ft a regresson lne together too well. Frst, they do not reflect the random error or varance so, the varance of the mputed value of the data set s underestmated whch lead to small standard errors and p- values at the tme of analyss. Second, the correlatons wth the mputed varables are overestmated because the underestmated varance of the mputed varable s n the denomnator of the correlaton formula (Allson [1]) The Expectaton Maxmzaton (EM) Algorthm The EM algorthm s ntroduced by Dempster et al. [4] and mplemented for many mssng data problems. It s an teratve algorthm that fnds the parameters whch maxmze the log-lkelhood functon when there are mssng values n the dataset. The EM algorthm s carred out through two steps: the expectaton step (E-step) and the maxmzaton step (M-step). Gven the current parameter estmates, the E-step calculates the condtonal expectaton of the complete data log-lkelhood gven the observed data and the current set of parameter estmates. The E-Step can be expressed symbolcally (Naka [15]) as follows: ( ˆ) ( ) Q θ θ = E g θ Y Y, ˆ obs θ = θ ( θ ) (, ˆ ms obs θ θ ) = g Y f Y Y = where s an estmate for θ and g ( Y ) dy ms θ s the complete data log-lkelhood. Gven the complete data log-lkelhood, the M-step fnds the parameter estmates that maxmze the complete data loglkelhood produced from the E-step to obtan updated parameter estmates. The M- step can be expressed (Naka [15]) as follows: Q t + 1 ( θ ˆ θ ) Q ( θ ˆ θ ) for all θ The teraton between M-steps and E-steps are contnued untl some convergence s met, that s untl values that are reestmated by the second step approxmate the prevous estmated values. Many advantages have been reported to the EM algorthm. Frst, the observed data lkelhood ncreases at every step. Second, the EM algorthm s preferred to regresson mputaton because the estmated parameter values that maxmze the observed data log-lkelhood functon are consstent, effcent under MAR condton and tend to be approxmately unbased n large samples and normally dstrbuted (Fchman and Cummngs [7]). Thrd, the obtaned varances are close to what s theoretcally desrable (Dragset [5]). However, the convergence of the teratons can be very slow n case of large fractons of mssng data (Naka and Ke [18]) The Multple Imputaton (MI) Method Multple mputatons method s consdered as a contnuaton to sngle mputaton method from the condtonal dstrbuton. The MI approach nvolves mputng each mssng value by two or more acceptable values to produce several dfferent complete datasets. Then each dataset s analyzed to produce dfferent parameter estmates. The sets of parameter estmates from each mputaton are then combned usng a specal rule (maybe by takng the average) to gve an overall (sngle) estmate of the complete data parameters as well as reasonable estmates of standard errors that ncorporate the varablty n results between the mputed datasets. A key feature of the MI method s that the uncertanty about the parameters n the mputaton model s taken nto account when mputng the unobserved values. In addton, the mputaton phase of the MI s operatonally dstnct from subsequent analyss. Applyng the MI typcally results n effectve estmates that are less based compared wth the estmates obtaned from sngle mputaton methods. Also, the MI provdes more correct standard errors, P-values, and confdence ntervals as opposed to sngle mputaton methods, whch gves too small standard errors (Van der Heden et al. [7]). It s also effcent, even f the number of mputatons s relatvely small and when between-mputaton varance s not too large (Naka and Ke [18]). However there are some dsadvantages of the MI method. Frst, snce some values are mputed nto the mssng value, mssng value ndvduals are allowed to have varyng probablty thus ndvdual varaton s gnored. Second, the uncertanty nherent n mssng values s gnored because the analyss doesn t dstngush between the observed and mputed values. Thrd, the MI procedure takes more work both to create the mputatons and to analyze the results. For

5 76 Ahmed Mahmoud Gad1 and Rana Hassan Mohamed Abdelkhalek: Imputaton Methods for Longtudnal Data: A Comparatve Study example, mputng 5 to 10 datasets cost tme, cause computatonal dffculty, and need testng models for each data set separately (Sheh [4]) Fourth, the MI does not satsfy normalty test n most stuatons (Naka [16]). Fnally, although each of the mputatons used n the MI procedure based on regresson parameters from the observed data and t s assumed that these regresson mputaton parameters are the true populaton parameters, but n fact they are only sample estmates from a sample dstrbuton. Therefore, when multple mputaton methods are mplemented, t s preferable to use new parameters drawn randomly for each mputaton from a Bayesan posteror dstrbuton of regresson mputaton parameters rather than usng the sample regresson parameters for each mputaton (Newman [10]). 4. Smulaton Study 4.1. Smulaton Settng The am of ths smulaton s to evaluate the behavor of eght mputaton methods under the three mssng data mechansms. It s based on a dataset for n subjects wth fve measurement tmes. The sample sze n, s chosen to range from small to large. We consder the sample szes n = 10, n = 50, and =100 to represent small, moderate and, large sample szes respectvely. It s assumed that there are two covarates; the tme TIME and the treatment group Grp. Hence the data are smulated accordng to the followng model y = + Tme + Grp + ε 0 1 j where Tme j was coded 0, 1,, 3, 4 for the fve tme ponts, and Grp s a dummy varable takes the value 0 for placebo group and value 1 for treatment group. The smple lnear regresson model for the mean profles of the repeated measurements Ε ( y ) = µ, j=0,1,, 3, 4 s used. The j varance-covarance structure s assumed as frst-order autoregressve AR (1). The parameters are fxed at 0 = 1, 1 = 0.5, and = 1. The ε ' s were generated from a multvarate normal wth zero mean and V( ε ) = σ = 1. The mean response s ( ) 0 1 Ε y = + Tme + Grp and the (co) varance for j j j tme ponts j and j equals σ ρ, for ρ 0 and σ s the error varance. The data are smulated to satsfy the multvarate normal dstrbuton and the correlatons between two varables Y and Y. The correlaton coeffcent s assumed as =0.5. The AR (1) structure s ρ ρ ρ ρ 3 ρ 1 ρ ρ ρ σ ρ ρ 1 ρ ρ 3 ρ ρ ρ 1 ρ 4 3 ρ ρ ρ ρ 1 In general, generatng each dataset s based on the followng assumpton: 1. The measurement at the frst tme pont ( t = 1) s fully observed,. The mssngness data mechansm are MCAR, MAR and MNAR, 3. The mssngness pattern s monotone, and 4. The number of replcatons s fxed at The comparson between methods depends on two measures; the Relatve Bas (RB) and Mean Square Error (MSE). The GLS method s used for estmatng the unknown parameters n the lnear regresson model. The parameter estmates have been obtaned for the selected mputaton methods: the CCA, the Mean, the LOCF, the HOT, the RM, the KNN, the EM, and MI methods. For the MCAR stuaton, the data are smulated wth dropout rates of 0%, 5%, 50%, 75%, and 87.5% at tme ponts 0, 1,, 3, 4 respectvely. If subject s mssng at a gven tme pont, then t s consdered mssng at all latter tme ponts. These rates ndcate the percentages of the orgnal sample that are mssng at each tme pont. For the MAR settng, f the value of the dependent varable s greater than the thrd quartle of the observatons, then the subject s dropped out at the next tme pont. For MNAR settng, after the frst tme pont, f the value of the dependent varable s greater than the thrd quartle of the observatons, then the subject s dropout at that tme pont and all subsequent tme ponts. 4.. Smulaton Results The smulaton results are presented n Table 1 to Table 9. The MSE results are not presented for the sake of parsmony, but ther qualtatve conclusons are dscussed. It s noted, for all methods, that the relatve bas has a negatve relaton wth the sample sze. The behavor of the dfferent methods s dscussed below. Table 1. The RB% and the MSE of the estmates under MCAR mssngness at 0%, 5%, 50%, 75%, and 87.5% mssngness rates wth n= σ ρ

6 Internatonal Journal of Statstcal Dstrbutons and Applcatons 017; 3(4): Table. The RB% and the MSE of the estmates under MCAR mssngness at 0%, 5%, 50%, 75%, and 87.5% mssngness rates wth n=50. Method σ ρ Table 3. The RB% and the MSE of the estmates under MCAR mssngness at 0%, 5%, 50%, 75%, and 87.5% mssngness rates wth n=100. Methods σ ρ The Tables 1-3 show that for all sample szes both the CCA and the RM methods subdue the other methods n performance for MCAR settng. So, they get the best estmates and the smallest RB and MSE. It s noted that as the sample sze ncreases, the value of both the RB and the MSE decrease for most mputaton methods. Both the CCA and the Regress methods predct the mssng values very well. They can be used for small samples wth small rate of mssng values. Moreover they can be appled to large samples wth small percentage of mssngness. The MI provdes effcent estmates especally for large samples rrespectve of underestmatng of the varance. The HOT method greatly responds to the ncrease n the sample sze. The Mean, the LOCF, and the KNN methods gve reasonable results except n the coeffcent of the tme covarate ( ). The correlaton between each tme nterval and the adjacent one affects the performance of these methods. Concernng the EM, t s obvous that t could not predct the mssng values. Table 4. The RB% and the MSE of the estmates under MAR mssngness at 0%, 5%, 50%, 75%, and 87.5% mssngness rates wth n=10. Method σ ρ Table 5. The RB% and the MSE of the estmates under MAR mssngness at 0%, 5%, 50%, 75%, and 87.5% mssngness rates wth n=50. Method σ ρ Table 6. The RB% and the MSE of the estmates under MAR mssngness at 0%, 5%, 50%, 75%, and 87.5% mssngness rates wth n= σ ρ

7 78 Ahmed Mahmoud Gad1 and Rana Hassan Mohamed Abdelkhalek: Imputaton Methods for Longtudnal Data: A Comparatve Study Accordng to Tables 4 6 the Mean method s superor to other methods for all sample szes. It s recommended to use the Mean mputaton for small sample szes under the MAR settng. The CCA method ndcates also good performance but t does not provde a good estmate for. 1 It s preferable to use the CCA wth MCAR settng rather than the MAR mechansm. All other methods except the Mean and the EM methods sustan from large RB for ˆ 1. The RM, the KNN, and the EM have a bad estmate for the varance. The LOCF, the HOT, the EM, and the MI methods underestmate the value of ρ. The EM method performs well n the MAR mechansm rather than the MCAR mechansm. Table 7. The RB% and the MSE of the estmates under MNAR mssngness at 0%, 5%, 50%, 75%, and 87.5% mssngness rates wth n= σ ρ Table 8. The RB% and the MSE of the estmates under MNAR mssngness at 0%, 5%, 50%, 75%, and 87.5% mssngness rates wth n= σ ρ Table 9. The RB% and the MSE of the estmates under MNAR mssngness at 0%, 5%, 50%, 75%, and 87.5% mssngness rates wth n= σ ρ Tables 7-9 show the results of the MNAR mechansm, n whch the estmates are dfferent from the underlyng values. It s obvous that the results are mpacted by the choce of the mssngness mechansm because the methods that performed well n the MCAR and the MAR settng worsen n the MNAR mechansm. 5. Applcaton (Breast Cancer Data) Breast cancer data concerns wth qualty of lfe among breast cancer patents n a clncal tral taken by the Internatonal Breast Cancer Study Group (IBCSG). In the IBCSG tral VI (Hurny et al. 199) premenopausal women wth breast cancer are followed for tradtonal outcomes such as relapse, death and also focused on qualty of lfe. The Patents were chosen at random to represent four groups under four dfferent chemotherapy regmes denoted by A, B, C and D. It s ntended to compare the qualty of lfe among the four dfferent treatments. The patents were asked to complete qualty of lfe questonnares at baselne (before startng treatment) and at three months ntervals for 15 months. Hence, each questonnare should be flled out sx tmes. It s planned that the sx tme ponts cover the tme durng the admnstraton of chemotherapy across all the four treatments. One of the relevant determnants of qualty of lfe was the Perceved Adjustment to Chronc Illness Scale (PACIS). Ths s a onetem scale comprsng a global patent ratng of the amount of effort costs to cope wth llness. The PACIS measured the response of the patents n dfferent groups. The total number of patents who start the study s 446 patents. The patents wth mssng response at the frst assessment (64 cases) are excluded from the analyss, leavng 38 patents. The patents dd not complete the study untl the 15 months of the study for many reasons. Some patents refused to complete the assessment, other patent not appear to fll the questonnare f her mood s poor. Wthdrawal from the study occurred by many patents who had already ded wthn the study perod. Thus, the structure of ths tral results n dropout pattern of mssng data. The amount of mssng data ncreased over tme, wth 9%, 36%, 47%, 54% and 6% for the consecutve vsts startng from the second tme pont. The

8 Internatonal Journal of Statstcal Dstrbutons and Applcatons 017; 3(4): percentages of patents wth 0, 1,, 3, 4, 5 mssng responses were, respectvely, 3%, 18%, 13%, 13%, 14% and 19%. The PACIS measured on a contnuous scale from 0 to 100 where, a larger score ndcates that greater amount of effort are requred for the patent to cope wth her llness. Followng Hürny et al. (199) and Gad and Ahmed (006) a square-root transformaton s used to normalze the data. The averages of the assessments usng all avalable transformed data are 6.1, 5.7, 5.6, 5.1, 4.7, 5.1, respectvely, and the standard devatons are.50,.46,.49,.51,.51, and.51. A prelmnary verson of these data, the responses for the frst 9 months of the study, was analyzed by Hürny et al. (199). Only patents wth complete responses are ncluded n the analyss (complete cases analyss). Ths analyss showed that the treatment dfferences are not statstcally sgnfcant. Dfferent versons of these data have been analyzed as Troxel et al. (1998) and Ibrahm et al. (001) Gad and Ahmed (006) adopted the mean model for the responses suggestng the AR (1) covarance structure and the unstructured covarance matrx to analyze ths data. ( = ψ ) = ψ 0 + ψ ψ logt r 1 Y Y, for = 1, 38 and j = 1,,6. In ths artcle, we depend on the mean model used n Gad and Ahmed (006). The response for the frst 15 months of the study s determned by PACIS response varable whch are of man nterest. The mean model allows each treatment to have ts own effect, that s µ = µ + α + α + α, = 1,,6, j 0j 1x1 x 3x3 j where µ 0j s a constant shft at each assessment tme and ( x, x, x ) 1 3 ( ) ( ) ( ) ( ) 1,0,0 treatment( A) 0,1,0 treatment( B) = 0,0,1 treatment( C) 0,0,0 treatment( D) The frst order autoregressve model s adopted for the covarance structure. In ths model the (, j) th element of the j covarance matrx s σ = σ ρ for, j = 1,,6. Based on the prevous model, a comparson s conducted among dfferent mputaton methods to compensate for mssng values n the Breast Cancer Data. The standard error s calculated for each mputaton method to evaluate the estmator performance. Table 10 dsplays the estmated parameters usng the Generalzed Least Square (GLS) method for the eght methods to the Breast Cancer Data. In addton to standard error are calculated to each mputaton method for the sake of comparson among them. Table 10. The parameter estmates of dfferent mputaton methods wth the values of ther standard errors. Method Par. Est. SE Est. SE Est. SE Est. SE Est. SE Est. SE Est. SE Est. SE The results show that the LOCF method approxmately gves the largest standard errors. So, t has the lowest effcency. In the LOCF method the mssng value s replaced wth the prevous observaton. Ths mples that the mputed value dd not predct the mssng value well. Unless the values for each tme pont are close to each other, the LOCF may not be an effcent mputaton. The CCA also shows bad performance. In ths method there s much loss of sample sze because the subject that has any mssng value s removed from the data. Hence, the CCA s recommended for large samples but wth small mssng values. These data have large number of subjects and hgh percentage of mssng. Moreover, ths experment confrms that the mean mputaton s a sutable mputaton method when the number of subjects s small and less mssng values. The HOT, the Regress, and the EM estmates are approxmately close to the mean mputaton. They have also large standard errors. It s noted that the KNN method s more effcent than the HOT, the Regress, and the EM methods for ths experment. The MI method s the most effcent method throughout ths experment. It has the least standard errors value. 6. Concluson The CCA method should be consdered as the frst choce of mputaton even n MCAR. It has the least relatve bas compared to the other methods. The performance of CCA was trembled n the MAR and the MNAR settng. The CCA method gves based estmates but have small MSE. The Regress method performs well especally under the MCAR but the sample varance and covarance are underestmated whch leads to small standard error and P-value. The Mean mputaton method s not a good choce for the dropout pattern under the MCAR assumpton. It performs slghtly well for the MAR and the MNAR assumptons and produced less MSE compared to other methods. The LOCF estmates the parameter very well and gves small MSE except under MNAR assumpton. However t shows large bas n some parameters. The HOT method sustans from large bas especally wth MNAR mssngness. It s performance gets better for large samples under the MCAR and the MNAR. However, the HOT has small MSE under the three mssngness mechansms. The KNN gves reasonable results

9 80 Ahmed Mahmoud Gad1 and Rana Hassan Mohamed Abdelkhalek: Imputaton Methods for Longtudnal Data: A Comparatve Study for the MCAR and the MAR mechansms. It gets better results as the sample sze ncrease, n other word t should be appled for large sample szes rather than small sample szes. The EM algorthm provdes a poor predcton to mssng values under the three mssng data mechansms especally the MCAR. However, t gves small MSE compared to the other methods. The MI method estmates are relatvely based, but under the MCAR mechansm t has the least bas. The MI method provdes small MSE. Acknowledgements The authors would lke to thank the Edtor and anonymous referees for ther helpful comments on the manuscrpt. References [1] Allson, P. D. (00) Mssng data, quanttatve applcatons n the socal scences, SAGE Unversty Papers. [] Blankers, M., Koeter, M. W. J., and Schppers, G. M. (010) Mssng data approaches n e health research: smulaton study and a tutoral for non-mathematcally nclned researchers, Journal of Medcal Internet Research, 1, 5: e54. [3] Chen J, Shao J. (000) Nearest neghbor mputaton for survey data, Journal of Offcal Statstcs, 16, [4] Dempster, A. P., Lard, M. N., and Rubn, D. B. (1977) Maxmum lkelhood from ncomplete data va the EM algorthm, Journal of the Royal Statstcal Socety, B39, [5] Dragset, I. G. (009) Analyss of longtudnal data wth mssng values, MSc. Thess, Department of Mathematcal Scences, Norwegan Unversty of Scence and Technology. [6] Engel, J. M. and Dehr, P. (003) Imputaton of mssng longtudnal data: a comparson of methods, Journal of Clncal Epdemology, 56, [7] Fchman, M. and Cummngs, J. M. (003) Multple Imputaton for Mssng Data: Makng the Most of What you Know, Organzatonal Research Methods, 6, [8] Gad, A. M. and Ahmed, A. S. (006) Analyss of longtudnal data wth ntermttent mssng values usng the stochastc EM algorthm, Computatonal Statstcs & Data Analyss, 50, [9] Hürny, C., Bernhard, J., Gelber, R. D., Coates, A., Gastglone, M., Isley, M., Dreher, D., peterson, H., Goldhrsch, A. and Senn, H. J. (199) Qualty of lfe measures for patents recevng adjutant therapy for breast cancer: an nternatonal tral, European J. Cancer, 8, [10] Ibrahm, J. G., Chen, M. H. and Lpstz, S. R. (001) Mssng responses n generalzed lnear mxed models when the mssng data mechansm s nongnorable, Bometrka, 88, [11] Lane, P. (008) Handlng drop-out n longtudnal clncal tral: a comparson of the LOCF and MMRM approaches, Pharmaceutcal Statstcs, 7, [13] Madow W. G., Nsselson, H. and Olkn, I. (1983) Incomplete data n sample surveys, report and case studes, 1, Academc Press, New York. [14] Mshra, S., and Khare, D. (014) On comparatve performance of multple mputaton methods for moderate to large proportons of mssng data n clncal trals: a smulaton study, Journal of Medcal Statstcs and Informatcs,, [15] Naka, M. (011) Smulaton study: Introducton of mputaton methods for mssng data n longtudnal analyss, Appled Mathematcal Scences, 57, [16] Naka, M. (01) Effectveness of Imputaton Methods for Mssng Data n AR (1) Longtudnal Dataset, Int. Journal of Math. Analyss, 6, [17] Naka, M., Chen, D. G., Nshmura, K., Myamoto, Y. (014) Comparatve Study of Four Methods n Mssng Value Imputatons under Mssng Completely at Random Mechansm, Open Journal of Statstcs, 4, [18] Naka, M., and Ke, W. (011) Revew of the Methods for Handlng Mssng Data n Longtudnal Data Analyss, Internatonal Journal of Mathematcal Analyss, 5, [19] Newman, D. (003) Longtudnal modelng wth randomly systematcally mssng data: A smulaton of ad hoc, maxmum lkelhood, and multple mputaton technques, Organzatonal Research Methods, 6, [0] Rancourt, E., Särndal, C. and Lee, H. (1994) Estmaton of the varance n the presence of nearest neghbor mputaton, Survey Research Methods Proceedngs, [1] Rubn, D. B. (1987) Multple Imputaton for Nonresponse n Surveys, Wley, New York. [] Saha, C., Jones, M. B. (009) Bas n the last observaton carred forward method under nformatve dropout, Journal of Statstcal Plannng and Inference, 139, [3] Saunders, J. A., Morrow-Howell, N., Sptznagel, E., Dork, P., Proctor, E. K., and Pescarno, R. (006) Imputng mssng data: a comparson of methods for socal work researchers, Natonal Assocaton of Socal Workers, 30, [4] Sheh, Y. Y. (003) Imputaton methods on general lnear mxed models of longtudnal studes, Commttee on Statstcal Methodology Conference Papers. [5] Strener, D. L. (00) The case of the mssng data: Methods of dealng wth dropouts and other research vagares, Canadan Journal of Psychatry, 47, [6] Troxel, A. B., Harrngton, D. P., Lpstz, S. R. (1998) Analyss of longtudnal data wth non-gnorable non monotone mssng values. Appl. Statst, 47, [7] Van der Heden, J. M. G., Donders, R. T., Stnen, T., and Moons, K. G. M. (006) Imputaton of mssng values s superor to complete case analyss and the mssng-ndcator method n multvarable dagnostcs research: A clncal example, Journal of Clncal Epdemology, 59, [8] Zhu, X. (015) Comparson of Four Methods for Handng Mssng Data n Longtudnal Data Analyss through a Smulaton Study, Open Journal of Statstcs, 4, [1] Lttle, R. J. A and Rubn, D. B. (00) Statstcal analyss wth mssng data, nd edton, Wley, US.

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

Parameter estimation for incomplete bivariate longitudinal data in clinical trials Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

This module is part of the. Memobust Handbook. on Methodology of Modern Business Statistics

This module is part of the. Memobust Handbook. on Methodology of Modern Business Statistics Ths module s part of the Memobust Handbook on Methodology of Modern Busness Statstcs 26 March 2014 Theme: Donor Imputaton Contents General secton... 3 1. Summary... 3 2. General descrpton... 3 2.1 Introducton

More information

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

More information

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Adjustment methods for differential measurement errors in multimode surveys

Adjustment methods for differential measurement errors in multimode surveys Adjustment methods for dfferental measurement errors n multmode surveys Salah Merad UK Offce for Natonal Statstcs ESSnet MM DCSS, Fnal Meetng Wesbaden, Germany, 4-5 September 2014 Outlne Introducton Stablsng

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

A Semi-parametric Regression Model to Estimate Variability of NO 2

A Semi-parametric Regression Model to Estimate Variability of NO 2 Envronment and Polluton; Vol. 2, No. 1; 2013 ISSN 1927-0909 E-ISSN 1927-0917 Publshed by Canadan Center of Scence and Educaton A Sem-parametrc Regresson Model to Estmate Varablty of NO 2 Meczysław Szyszkowcz

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007 Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Econometrics 2. Panel Data Methods. Advanced Panel Data Methods I

Econometrics 2. Panel Data Methods. Advanced Panel Data Methods I Panel Data Methods Econometrcs 2 Advanced Panel Data Methods I Last tme: Panel data concepts and the two-perod case (13.3-4) Unobserved effects model: Tme-nvarant and dosyncratc effects Omted varables

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

Unsupervised Learning and Clustering

Unsupervised Learning and Clustering Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

Using Auxiliary Data for Adjustment In Longitudinal Research. Dirk Sikkel Joop Hox Edith de Leeuw

Using Auxiliary Data for Adjustment In Longitudinal Research. Dirk Sikkel Joop Hox Edith de Leeuw Usng Auxlary Data for Adjustment In Longtudnal Research Drk Skkel Joop Hox Edth de Leeuw 1. Longtudnal Research The use of longtudnal research desgns, such as cohort or panel studes, has become more and

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

Finite Population Small Area Interval Estimation

Finite Population Small Area Interval Estimation Journal of Offcal Statstcs, Vol. 23, No. 2, 2007, pp. 223 237 Fnte Populaton Small Area Interval Estmaton L-Chun Zhang 1 Small area nterval estmaton s consdered for a fnte populaton, where the small area

More information

Anonymisation of Public Use Data Sets

Anonymisation of Public Use Data Sets Anonymsaton of Publc Use Data Sets Methods for Reducng Dsclosure Rsk and the Analyss of Perturbed Data Harvey Goldsten Unversty of Brstol and Unversty College London and Natale Shlomo Unversty of Manchester

More information

Implementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status

Implementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status Internatonal Journal of Appled Busness and Informaton Systems ISSN: 2597-8993 Vol 1, No 2, September 2017, pp. 6-12 6 Implementaton Naïve Bayes Algorthm for Student Classfcaton Based on Graduaton Status

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN. Department of Statistics, Islamia College, Peshawar, Pakistan 2

A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN. Department of Statistics, Islamia College, Peshawar, Pakistan 2 Pa. J. Statst. 5 Vol. 3(4), 353-36 A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN Sajjad Ahmad Khan, Hameed Al, Sadaf Manzoor and Alamgr Department of Statstcs, Islama College,

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of

More information

Bayesian inference for sample surveys

Bayesian inference for sample surveys Bayesan nference for sample surveys Roderck Lttle Module 3: Bayesan models for complex sample desgns Modelng sample selecton Role of sample desgn n model-based (Bayesan) nference Key to understandng the

More information

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005 Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

The Research of Support Vector Machine in Agricultural Data Classification

The Research of Support Vector Machine in Agricultural Data Classification The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Estimating Regression Coefficients using Weighted Bootstrap with Probability

Estimating Regression Coefficients using Weighted Bootstrap with Probability Norazan M R, Habshah Md, A H M R Imon Estmatng Regresson Coeffcents usng Weghted Bootstrap wth Probablty NORAZAN M R, HABSHAH MIDI AND A H M R IMON Faculty of Computer and Mathematcal Scences, Unversty

More information

Probability Base Classification Technique: A Preliminary Study for Two Groups

Probability Base Classification Technique: A Preliminary Study for Two Groups Mathematcal Theory and Modelng ISSN 4-5804 (Paper) ISSN 5-05 (Onlne) www.ste.org Probablty Base Classfcaton Technque: A Prelmnary Study for Two Groups Frday Znzendoff Okwonu,* Abdul Rahman Othman. Department

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

A Statistical Model Selection Strategy Applied to Neural Networks

A Statistical Model Selection Strategy Applied to Neural Networks A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Multilevel Analysis with Informative Weights

Multilevel Analysis with Informative Weights Secton on Survey Research Methods JSM 2008 Multlevel Analyss wth Informatve Weghts Frank Jenkns Westat, 650 Research Blvd., Rockvlle, MD 20850 Abstract Multlevel modelng has become common n large scale

More information

A Bootstrap Approach to Robust Regression

A Bootstrap Approach to Robust Regression Internatonal Journal of Appled Scence and Technology Vol. No. 9; November A Bootstrap Approach to Robust Regresson Dr. Hamadu Dallah Department of Actuaral Scence and Insurance Unversty of Lagos Akoka,

More information

Detecting Errors and Imputing Missing Data for Single-Loop Surveillance Systems

Detecting Errors and Imputing Missing Data for Single-Loop Surveillance Systems 16 Transportaton Research Record 1855 Paper No. 3-357 Detectng Errors and Imputng Mssng Data for Sngle-Loop Survellance Systems Chao Chen, Jamyoung Kwon, John Rce, Alexander Skabardons, and Pravn Varaya

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

Available online at ScienceDirect. Procedia Environmental Sciences 26 (2015 )

Available online at   ScienceDirect. Procedia Environmental Sciences 26 (2015 ) Avalable onlne at www.scencedrect.com ScenceDrect Proceda Envronmental Scences 26 (2015 ) 109 114 Spatal Statstcs 2015: Emergng Patterns Calbratng a Geographcally Weghted Regresson Model wth Parameter-Specfc

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Outlier Detection based on Robust Parameter Estimates

Outlier Detection based on Robust Parameter Estimates Outler Detecton based on Robust Parameter Estmates Nor Azlda Aleng 1, Ny Ny Nang, Norzan Mohamed 3 and Kasyp Mokhtar 4 1,3 School of Informatcs and Appled Mathematcs, Unverst Malaysa Terengganu, 1030 Kuala

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 97-735 Volume Issue 9 BoTechnology An Indan Journal FULL PAPER BTAIJ, (9), [333-3] Matlab mult-dmensonal model-based - 3 Chnese football assocaton super league

More information

DETECTING ERRORS AND IMPUTING MISSING DATA FOR SINGLE LOOP SURVEILLANCE SYSTEMS

DETECTING ERRORS AND IMPUTING MISSING DATA FOR SINGLE LOOP SURVEILLANCE SYSTEMS DETECTING ERRORS AND IMPUTING MISSING DATA FOR SINGLE LOOP SURVEILLANCE SYSTEMS Chao Chen Department of Electrcal Engneerng and Computer Scence Unversty of Calforna, Berkeley CA 94720 Tel: (510) 643-5894

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Three supervised learning methods on pen digits character recognition dataset

Three supervised learning methods on pen digits character recognition dataset Three supervsed learnng methods on pen dgts character recognton dataset Chrs Flezach Department of Computer Scence and Engneerng Unversty of Calforna, San Dego San Dego, CA 92093 cflezac@cs.ucsd.edu Satoru

More information

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,

More information

A Non-Parametric Predictive Model for Missing Data: A Case of Philippine Public Hospitals

A Non-Parametric Predictive Model for Missing Data: A Case of Philippine Public Hospitals Proceedngs of the 2011 Internatonal Conference on Industral Engneerng and Operatons Management Kuala Lumpur, Malaysa, January 22 24, 2011 A Non-Parametrc Predctve Model for Mssng Data: A Case of Phlppne

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Why visualisation? IRDS: Visualization. Univariate data. Visualisations that we won t be interested in. Graphics provide little additional information

Why visualisation? IRDS: Visualization. Univariate data. Visualisations that we won t be interested in. Graphics provide little additional information Why vsualsaton? IRDS: Vsualzaton Charles Sutton Unversty of Ednburgh Goal : Have a data set that I want to understand. Ths s called exploratory data analyss. Today s lecture. Goal II: Want to dsplay data

More information

Private Information Retrieval (PIR)

Private Information Retrieval (PIR) 2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market

More information

Hybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance

Hybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 2 Sofa 2016 Prnt ISSN: 1311-9702; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-2016-0017 Hybrdzaton of Expectaton-Maxmzaton

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

Journal of Chemical and Pharmaceutical Research, 2014, 6(6): Research Article

Journal of Chemical and Pharmaceutical Research, 2014, 6(6): Research Article Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(6):2512-2520 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 Communty detecton model based on ncremental EM clusterng

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL GROUP ANALYSIS Martn M. Mont UCLA Psychology NITP AGGREGATING MULTIPLE SUBJECTS When we conduct mult-subject analyss we are tryng to understand whether an effect s sgnfcant across a group of people. Whether

More information

Fast Computation of Shortest Path for Visiting Segments in the Plane

Fast Computation of Shortest Path for Visiting Segments in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang

More information

The Grouping Methods and Rank Estimator, Based on Ranked Set sampling, for the linear Error in Variable Models

The Grouping Methods and Rank Estimator, Based on Ranked Set sampling, for the linear Error in Variable Models P Internatonal Journal of Scentfc Engneerng and Appled Scence (IJSEAS) Volume-, Issue-7,Jul 06 The Groupng Methods and Rank Estmator, Based on Ranked Set samplng, for the lnear Error n Varable Models Ahmed

More information