This module is part of the. Memobust Handbook. on Methodology of Modern Business Statistics
|
|
- Duane Phelps
- 5 years ago
- Views:
Transcription
1 Ths module s part of the Memobust Handbook on Methodology of Modern Busness Statstcs 26 March 2014
2 Theme: Donor Imputaton Contents General secton Summary General descrpton Introducton to donor mputaton Random and sequental hot deck mputaton Nearest-neghbour mputaton Predctve mean matchng Practcal ssues Desgn ssues Avalable software tools Decson tree of methods Glossary References... 7 Interconnectons wth other modules... 9 Admnstratve secton... 10
3 General secton 1. Summary The obectve n donor mputaton s to fll n the mssng values for a gven unt by copyng observed values of another unt, the donor. Typcally, the donor s chosen n such a way that t resembles the mputed unt as much as possble on one or more background characterstcs. The ratonale behnd ths s that f the two unts match (exactly or approxmately) on a number of relevant auxlary varables, t s lkely that ther scores on the target varable wll also be smlar. 2. General descrpton Introducton to donor mputaton The obectve n donor mputaton s to fll n the mssng values for a gven unt (the recpent) by copyng the correspondng observed values of another unt (the donor). The term hot deck donor mputaton apples when the donor comes from the same data set as the recpent. In the context of busness statstcs, ths s the most commonly encountered form of donor mputaton. If the donor s taken from another data set, ths s known as cold deck donor mputaton. Most applcatons of cold deck mputaton use data that were collected at a prevous pont n tme. Often, the donor record s then smply an earler observaton of the recpent unt tself. Ths type of donor mputaton s only vald for varables that can be consdered more or less constant between observaton tmes; ts applcablty n the context of busness statstcs s therefore lmted. In the remander of ths module, we shall focus on hot deck mputaton. Lettng y denote the score of the we can wrte the generc formula for hot deck donor mputaton as: th unt on the target varable y and usng the ndex d for a donor, ~ y = y d. (1) Typcally, one searches for a donor that resembles the recpent as much as possble on one or more auxlary varables. There exst dfferent ways to select a donor, leadng to dfferent varants of hot deck mputaton. In ths module, we shall descrbe random and sequental hot deck mputaton (Secton 2.2), nearest-neghbour mputaton (Secton 2.3), and predctve mean matchng (Secton 2.4). Some practcal ssues are dscussed n Secton 2.5. In formula (1) and n the descrpton below, we focus on mputng one target varable at a tme. In practce, one often encounters records wth several mssng values. In that case, the standard approach s to mpute all mssng values n a record from the same donor. Ths helps to preserve the multvarate relatons between the mputed varables. In fact, an mportant practcal advantage of donor mputaton compared to model-based mputaton s that t can be extended to multvarate mputaton n ths natural way. 1 Ths secton s to a large extent based on Chapter 6 of Israëls et al. (2011). 3
4 2.2 Random and sequental hot deck mputaton In random hot deck mputaton, mputaton classes are formed based on categorcal auxlary varables. For each recpent unt n a gven mputaton class, the group of potental donors conssts of the unts wthn the same class wth y observed. Of these potental donors, one s selected at random typcally through equal-probablty samplng and used to mpute the recpent. Note that ths procedure mples that the donor and the recpent have exactly the same values on all auxlary varables that are used to defne the mputaton classes. Condtonal on these auxlary varables, the donor s selected completely at random. Sequental hot deck mputaton also requres that the donor and the recpent have dentcal values on the auxlary varables, but here the data set s not explctly splt nto groups. Instead, one goes over the records n the data set n order and mputes each mssng value by the last prevously encountered observed value for a unt wth the same scores on the auxlary varables. Thus, the recpent s mputed usng as a donor the last unt wth y observed that belongs to the same mputaton class and that comes before the recpent n the data fle. Hstorcally, the sequental hot deck method had the advantage that t can be carred out by a computer n a very effcent manner. The algorthm requres ust one pass over the data set (Kalton and Kasprzyk, 1986). Wth the rse of computng power, ths s no longer consdered a real advantage for most practcal applcatons. For the sequental hot deck method, the mputatons obvously depend on the order of the records n the data set. The method can be appled after a random sortng of the records; ths yelds stochastc mputatons and s sometmes called random sequental hot deck. Alternatvely, determnstc mputatons may be obtaned by sortng the records on one or more background characterstcs. Ether way, t s recommended to perform some form of explct sortng before applyng ths method, because otherwse the results may be based due to an mplct and unforeseen orderng of the unts n the fle. Typcally, the standard errors of means and totals of y wll be nflated by random (sequental) hot deck mputaton (Lttle and Rubn, 2002). In part, ths may be due to the rsk of outlers beng magnfed, whch can be avoded by excludng outlers from the group of potental donors. More generally, t s desrable to avod that the same unt can be used as a donor for many dfferent recpents. In random hot deck mputaton, ths can be acheved by usng a more elaborate selecton mechansm, so that a repeated use of the same donor s only allowed once all or most of the potental donors wthn an mputaton class have had a turn. In sequental hot deck mputaton, a repeated use of the same donor may occur whenever there are several tem non-respondents close together n the data fle. One way to prevent ths s to consder an extenson of sequental hot deck mputaton. Under ths extenson, one stores the last K observed values wthn an mputaton class (for some K > 1). Whenever an tem non-respondent s encountered, t s mputed by choosng at random one of the K potental donor values. 2.3 Nearest-neghbour mputaton In nearest-neghbour mputaton, we drop the restrcton that the donor and the recpent have dentcal scores on all auxlary varables. Instead, the auxlary varables are used to defne a dstance functon D (, between unts and k, where s the recpent and k s a potental donor. The nearest neghbour of unt s defned as the respondent d that mnmses ths dstance functon. Formally, 4
5 d = arg mn D(,, (2) k obs where obs denotes the set of unts wth y observed,.e., the set of potental donors. Before gong nto the mputaton method tself, we wll brefly dscuss possble choces of the dstance functon n formula (2). Assumng for now that the auxlary varables ( x, K, x ) are all quanttatve (but see Secton 2.5), a frequently used famly of dstance functons s gven by: 1 q q Dz (, = x = 1 x k 1/ z z (3) wth z > 0. For z = 2, formula (3) yelds the well-known Eucldean dstance. For z = 1, t s ust the sum of the absolute dfferences x x ; ths s sometmes called the cty-block or Manhattan k dstance. As z becomes larger, formula (3) places a hgher penalty on large dfferences for ndvdual auxlary varables. In fact, by lettng z tend to nfnty n (3), we obtan the so-called mnmax dstance gven by D (, = max = 1, K, q x x k. (4) Accordng to dstance (4), the nearest neghbour should not devate strongly from the recpent on any auxlary varable x. Practcal applcatons of nearest-neghbour mputaton that nvolve dstance functon (3) wth choces other than z = 1, z = 2, or z are rare. A generalsaton of (3) s obtaned by ncludng weght factors γ that express the mportance of each auxlary varable for the purpose of fndng accurate mputatons: 1/ z q z Dz, (, x x γ = γ k. (5) = 1 In addton, note that the contrbutons of the auxlary varables to (3) or (5) are mplctly weghted f these varables are measured on dfferent scales. For nstance, f x 1 represents last year s turnover n Euros and x 2 represents the number of employees, then the value of D1 (, = x1 x1k + x2 x2k wll depend almost exclusvely on the frst term n practce. To prevent ths, one should frst standardse the auxlary varables so that ther varances are equal to 1. Alternatvely, the so-called Mahalanobs dstance could be used whch also takes correlatons between varables nto account (see, e.g., Lttle and Rubn, 2002); ths can be seen as a generalsaton of the Eucldean dstance D (, ). In ts basc form, the nearest-neghbour method mputes an tem non-respondent by usng ts nearest neghbour as donor. Ths yelds a determnstc mputaton. As before, the underlyng dea s that two unts that are closely matched on relevant background characterstcs [.e., for whch D (, has a small value] are lkely to also have a smlar score on the target varable. A stochastc generalsaton of nearest-neghbour mputaton frst selects the K unts that are closest to unt n terms of D (,.e., the K nearest neghbours as potental donors and then draws one of these unts at random. In some applcatons, unequal drawng probabltes are assgned to the K nearest neghbours so that wthn ths group the unts wth smaller values of D (, are more lkely to 2 k 5
6 be selected as donor. Followng Banker et al. (2000), an approprate choce of drawng probablty for the th k potental donor s then gven by: t Dmn p k D k ( ), ( k = 1, K, K), (6) (, ) where D = mn D(, denotes the dstance of the nearest neghbour and t 0 s a parameter mn k obs determnng the selecton mechansm. Equal-probablty selecton s obtaned as a specal case of (6) wth t = 0. The method concdes wth ordnary determnstc nearest-neghbour mputaton n the lmt t. 2.4 Predctve mean matchng Lttle (1988) descrbed a varant of donor mputaton known as predctve mean matchng. In ths mputaton method, a lnear regresson s frst performed of the target varable y on some auxlary varables x, K, x. The regresson model s ftted on the data of unts wthout tem non-response. 1 q Next, the resultng regresson equaton s used to obtan predcted values ŷ for all records, n accordance wth formula (4) n the module Imputaton Model-Based Imputaton. For tem nonrespondent wth predcted value predcted value ŷ d s as close as possble to ŷ, we select as donor the tem respondent d for whch the ŷ. Fnally, the observed value y d of the donor s mputed, n accordance wth formula (1) above. The latter feature makes ths method a form of donor mputaton rather than model-based mputaton. It should be noted that predctve mean matchng s actually a specal case of nearest-neghbour mputaton. Ths s easly seen by consderng the dstance functon D pmm (, = yˆ yˆ k and choosng the donor accordng to formula (2). Alternatvely, ths dstance functon can be expressed as a weghted sum of dfferences between the auxlary varables used n the regresson (De Waal et al., 2011, p. 253). 2.5 Practcal ssues Random and sequental hot deck mputaton requre that the auxlary varables are categorcal, because these varables are used to construct mputaton classes. Quanttatve auxlary varables can be ncluded by frst dervng categorsed versons of them (e.g., a sze class varable based on the number of employees). Nearest-neghbour mputaton s used manly wth quanttatve auxlary varables. It s also possble to nclude categorcal auxlary varables, but ths requres an approprate extenson of the dstance functon. One way to do ths s to assgn, for each categorcal varable separately, a dstance to each possble par of values. For an auxlary varable can be summarsed n the form of an x wth m categores, ths local dstance functon m m matrx A. Next, we can defne a global dstance functon of the form (3) or (5), by replacng the absolute dfference x x by the value k 6
7 A x, x ) n these expressons. Smlarly, a combnaton of quanttatve and qualtatve auxlary ( k varables can also be handled n nearest-neghbour mputaton. An alternatve way to handle a combnaton of quanttatve and qualtatve auxlary varables s to combne the random and nearest-neghbour hot deck methods. That s, we frst use the categorcal varables to construct mputaton classes. Next, wthn each mputaton class, we apply the nearestneghbour method usng a dstance functon of quanttatve varables. In ths case, the donor has to match the recpent exactly on the categorcal varables but ther scores on the quanttatve varables may be dfferent. The approach n the prevous paragraph offers more flexblty. It s possble to take samplng weghts nto account n the selecton of the donor; see Kalton (1983) and Andrdge and Lttle (2009). As dscussed n Imputaton Man Module, there s no consensus of opnon on the necessty n general of ncorporatng samplng weghts nto mputaton procedures. However, t s often useful to ensure that recpents are mputed from donors wth smlarly-szed weghts. Effectvely, donor mputaton ncreases the weght of a donor by addng the weghts of ts recpents (Kalton, 1983). Therefore, f a donor wth a small weght s used to mpute a recpent wth a much larger weght, the nfluence of that donor on the survey estmates ncreases dsproportonally; as a result, the varances of these estmates wll be nflated. To prevent ths, the weghtng varable or the desgn varables that consttute the weghtng model may be ncluded as auxlary varables n the donor selecton. Andrdge and Lttle (2009) compared the performance of hot deck mputaton wth and wthout the ncluson of samplng weghts n a smulaton study. 3. Desgn ssues 4. Avalable software tools Several R packages are avalable that can perform hot deck donor mputaton, ncludng StatMatch and mce. The Banff system by Statstcs Canada performs nearest-neghbour mputaton for quanttatve data. CANCEIS, another tool by Statstcs Canada, offers more advanced nearestneghbour mputaton functonalty for quanttatve and qualtatve data. It should be noted that CANCEIS s manly amed at socal statstcs, n partcular the populaton census. 5. Decson tree of methods 6. Glossary For defntons of terms used n ths module, please refer to the separate Glossary provded as part of the handbook. 7. References Andrdge, R. R. and Lttle, R. J. (2009), The Use of Samplng Weghts n Hot Deck Imputaton. Journal of Offcal Statstcs 25,
8 Banker, M., Lachance, M., and Porer, P. (2000), 2001 Canadan Census Mnmum Change Donor Imputaton Methodology. Workng Paper, UN/ECE Work Sesson on Statstcal Data Edtng, Cardff. De Waal, T., Pannekoek, J., and Scholtus, S. (2011), Handbook of Statstcal Data Edtng and Imputaton. John Wley & Sons, New Jersey. Israëls, A., Kuvenhoven, L., van der Laan, J., Pannekoek, J., and Schulte Nordholt, E. (2011), Imputaton. Methods Seres Theme, Statstcs Netherlands, The Hague. Kalton, G. (1983), Compensatng for Mssng Survey Data. Survey Research Center Insttute for Socal Research, The Unversty of Mchgan. Kalton, G. and Kasprzyk, D. (1986), The Treatment of Mssng Survey Data. Survey Methodology 12, Lttle, R. J. A. (1988), Mssng-Data Adustments n Large Surveys. Journal of Busness & Economc Statstcs 6, Lttle, R. J. A. and Rubn, D. B. (2002), Statstcal Analyss wth Mssng Data, second edton. John Wley & Sons, New York. 8
9 Interconnectons wth other modules 8. Related themes descrbed n other modules 1. Imputaton Man Module 2. Imputaton Model-Based Imputaton 9. Methods explctly referred to n ths module Mathematcal technques explctly referred to n ths module GSBPM phases explctly referred to n ths module 1. GSBPM Sub-process 5.4: Impute 12. Tools explctly referred to n ths module 1. Banff 2. CANCEIS 3. R 13. Process steps explctly referred to n ths module 1. Imputaton,.e., determnng and fllng n new values for occurrences of mssng or dscarded values n a data fle 9
10 Admnstratve secton 14. Module code Imputaton-T-Donor Imputaton 15. Verson hstory Verson Date Descrpton of changes Author Insttute frst verson Sander Scholtus CBS (Netherlands) mprovements based on Swedsh revew mprovements based on Norwegan revew prelmnary release fnal verson wthn the Memobust proect Sander Scholtus Sander Scholtus CBS (Netherlands) CBS (Netherlands) 16. Template verson and prnt date Template verson used 1.0 p 4 d.d Prnt date :16 10
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 informationMachine 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 informationProgramming 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 informationSubspace 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 informationWishing 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 informationAdjustment 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 informationHelsinki 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 informationUsing 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 informationComplex 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 information6.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 informationParameter 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 informationSupport 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 informationHermite 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 informationSLAM 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 informationFor 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 informationAn 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 informationS1 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 informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationDetermining 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 informationEmpirical 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 informationSimulation: 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 informationy 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 informationA 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 informationTerm 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 informationClassifier 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 informationA fault tree analysis strategy using binary decision diagrams
Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:
More informationThe 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 informationA 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 informationSynthesizer 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 informationAssignment # 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 informationThe 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 informationSmoothing 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 informationCompiler 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 informationR 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 informationCluster 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 informationNAG 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 informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
More informationEECS 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 informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationLearning 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 informationSteps 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 informationParallelism 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 informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
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 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationNUMERICAL 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 informationCell Count Method on a Network with SANET
CSIS Dscusson Paper No.59 Cell Count Method on a Network wth SANET Atsuyuk Okabe* and Shno Shode** Center for Spatal Informaton Scence, Unversty of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan
More informationBioTechnology. 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 informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More informationAPPLICATION 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 informationTN348: 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 informationVariance estimation in EU-SILC survey
Varance estmaton n EU-SILC survey Mārtņš Lberts* * Mathematcal Support Dvson, Central Statstcal Bureau of Latva (Martns.Lberts@csb.gov.lv) bstract: The mplementaton of varance estmaton methods resamplng
More informationSolutions to Programming Assignment Five Interpolation and Numerical Differentiation
College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationMeta-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 informationProper 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 informationMathematics 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 informationUnderstanding K-Means Non-hierarchical Clustering
SUNY Albany - Techncal Report 0- Understandng K-Means Non-herarchcal Clusterng Ian Davdson State Unversty of New York, 1400 Washngton Ave., Albany, 105. DAVIDSON@CS.ALBANY.EDU Abstract The K-means algorthm
More informationAn 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 informationMultilevel 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 informationAnonymisation 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 informationBiostatistics 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 informationBayesian 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 informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationCS 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 information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationA 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 informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationAnalysis 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 informationFEATURE 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 informationContent 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 informationOutline. 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 informationExercises (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 informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationTECHNIQUE 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 informationA 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 information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15
CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationOutlier 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 informationAnalysis of Non-coherent Fault Trees Using Ternary Decision Diagrams
Analyss of Non-coherent Fault Trees Usng Ternary Decson Dagrams Rasa Remenyte-Prescott Dep. of Aeronautcal and Automotve Engneerng Loughborough Unversty, Loughborough, LE11 3TU, England R.Remenyte-Prescott@lboro.ac.uk
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationVirtual 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 informationHybridization 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 informationA 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 informationUnsupervised 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 informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationSimulation 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 informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationDetermining Fuzzy Sets for Quantitative Attributes in Data Mining Problems
Determnng Fuzzy Sets for Quanttatve Attrbutes n Data Mnng Problems ATTILA GYENESEI Turku Centre for Computer Scence (TUCS) Unversty of Turku, Department of Computer Scence Lemmnkäsenkatu 4A, FIN-5 Turku
More informationA Similarity-Based Prognostics Approach for Remaining Useful Life Estimation of Engineered Systems
2008 INTERNATIONAL CONFERENCE ON PROGNOSTICS AND HEALTH MANAGEMENT A Smlarty-Based Prognostcs Approach for Remanng Useful Lfe Estmaton of Engneered Systems Tany Wang, Janbo Yu, Davd Segel, and Jay Lee
More information