Abstract. 2.0 Some Fundamental Concepts of AIC. 1.0 Introduction
|
|
- Betty Grant
- 5 years ago
- Views:
Transcription
1 Model Selecton n Lnear Mxed Effects Models Usng SAS PROC MIXED Long Ngo, Ischema Research, San Francsco ; Unversty of Calforna, Berkeley, CA Rchard Brand, Unversty of Calforna, Berkeley, CA Abstract Although there are dsadvantages assocated wth model buldng procedures such as backward, forward and stepwse procedures (e.g. multple testng, arbtrary sgnfcance level used n droppng or acqurng varables), many analysts use these procedures and are not aware that alternatve modelng selecton methods exst. Ths paper focuses on model selecton usng the Akake Informaton Crtera (AIC) n the case of lnear mxedeffects models. AIC s fundamental concepts are revewed and two examples are gven to demonstrate ts use through PROC MIXED. Master-level bostatstcans, epdemologsts, and others who are workng wth longtudnal data are encouraged to nvestgate AIC as the tool n modelng repeated measures data..0 Introducton Model selecton s one of the most frequently encountered problems n data analyss. In most observatonal epdemologcal studes, nvestgators frequently attempt to construct the most desrable statstcal model usng the popular methods of forward, backward, and stepwse regresson (4). Of course knowledge of the subject matter plays an mportant role n model selecton, but f based strctly on the data, model selecton s often carred out usng one of the automated procedures bult nto the software, of whch the most popular method s perhaps stepwse model selecton. These methods pose the problem of the arbtrary selecton of the sgnfcance level(s) n allowng a varable to enter nto or to be dropped from the model durng the selecton process (,4 ). There s also the problem of multple testng that comes wth fttng and refttng the model (,4). The ssue s made more complcated n the case of repeated or longtudnal data where selectng the best model means not only to select the best mean structure but also the most optmal varance-covarance structure (0,). Ths paper revews another model selecton method whch helps elmnate the problems assocated wth settng an arbtrary sgnfcance level requred n automated procedures such as stepwse. Usng a crteron lke AIC for selectng a model, bypasses the need to specfy a sgnfcance level n a model buldng process. The Akake Informaton Crtera (AIC) and ts prncples n model selecton wll be descrbed. The paper wll also show how one can set up a model selecton strategy usng AIC n lnear mxed-effects model framework. AIC and other related crtera (SBC, HQ, CAIC) are fully avalable n SAS PROC MIXED. Real data from two case studes wll be presented to show how model selecton usng AIC was used to acheve the desred objectve..0 Some Fundamental Concepts of AIC In order to understand the prncple behnd AIC, one needs to return to the defnton of the Kullback-Lebler nformaton (5,8) whch s consdered to be a measure of the dstance between two densty functons. In a model selecton problem, one would lke to select the model famly whch performs best. The dstance between the true model and the selected model can be represented by the Kullback-Lebler nformaton. If one assumes the true model s densty to be f (.) and the jont densty functon for the selected model to be g(., θ ), where θ s the estmated vector of d parameters by the maxmum lkelhood method, then the Kullback-Lebler dstance can be wrtten as K L f g f x = f x dx ( (.), (., )) log ( ) θ ( ) (*) gx (, θ) where x s the observed sample data of n ndependent observatons. In ths setup, the expectaton of (*) provdes the bass for model selecton, and the estmate of ths expectaton provdes a crteron for model selecton. The asymptotc approxmaton for the estmaton of ths expectaton s gven as (6,8) E f g f x f x dx g x ( (.), (., θ)) = + + K L ( )log( ( )) ( log( (, θ))) trace( ΣΩ )( ) where, log gxθ (, ) s the maxmzed log lkelhood functon based on the observed data, and θ s the maxmum lkelhood estmate of the parameter vector θ, and Σ = n and = Ω = n d n = n d log g( x, θ ) d log g( x, θ ), uv, =,,..., d, dθ u dθ v log g( x, θ ), uv, =,,..., d dθ udθ v
2 Notce that the term f ( x)log( f ( x)) dx s dependent on the true model whch s unknown; however, ths term s fxed when comparng between models. The part of ths estmated expectaton of the Kullback-Lebler dstance that s needed n the comparson process s log gx (, θ) + trace( ΣΩ ) () whch s computable for the parametrc model. When one can assume that the true model s contaned wthn the famly of models from whch the ftted model s obtaned then one can wrte () as log gx (, θ) + d (3). AIC s bascally twce the expresson of (3) so AIC = -loglkelhood + d (4). Thus AIC mposes a penalty of two unts per parameter n the model. Based on AIC, as the model selecton crteron, then among all possble models consdered, the one wth the smallest value of AIC s consdered to be the best model. Notce that f the true model f(.) s very dfferent (not contaned n the famly model that generates the selected model) from g(., θ ), then one should compute the trace term of ΣΩ drectly whch s more dffcult and computatonally expensve. 3.0 Model selecton usng AIC for lnear mxedeffects models Suppose there are n ndependent subjects wth m correlated measurements, =,,..., n. The margnal probablty densty of y s f( y b, Σ ( φ)) = exp( ( y x b y x b m ) Σ ( φ) ( ) ( π) Σ ( φ) The vector of both fxed and random parameters s θ =( φ, b ). So the maxmzed log lkelhood s then m log f ( y) = log π + log ( φ) ( y x b) ( φ) Σ Σ ( y x b) θ From here AIC can be computed easly wth d beng the sum of both the fxed and random effects parameters. The SAS system verson 6. gves ths value AIC for both the maxmum lkelhood and the restrcted maxmum lkelhood case (). One can also compute the trace term of ΣΩ gven n () snce the densty functon of the ftted model s known. There are two dfferent methods presented here for selectng the "best" or the "smallest AIC" model among all the models under consderaton. The frst method essentally dentfes all the possble mean functons and all the possble varance-covarance structures applcable to the queston of nterest. The number of possble models for consderaton ncludes all combnatons resulted from both the mean and varance-covarance structures. For each of these models, AIC s then computed and the model wth mnmum AIC s selected. The second method recommended by Wolfnger and Dggle (,,0) has the followng steps : Frst, usng the most complex mean structure under consderaton, select the best varance-covarance structure usng the restrcted maxmum lkelhood (REML). REML whch focuses on the covarance sde of the model should be used n place of the lkelhood. Let AIC_R denotes AIC derved from REML : AIC_R = -*(Restrcted lkelhood) + *(# covarance parameters). The varance-covarance structure wth the smallest AIC_R s selected. Then usng ths varance-covarance structure, go back and use AIC to select the best mean structure. In the followng example, both methods wll be llustrated. 4.0 Example The data are from 006 subjects who partcpated n an epdemology study on agng. Each subject was measured every mnute for 3 to 30 mnutes (TIME) from the start of a treadmll test. The response called VOKG, whch measures physcal ftness, s the amount of expended energy from exercse. The hgher the VOKG, the better the physcal performance. DURATION stands for the total tme (mnutes) the subject was able to exercse. AGE s n years. The analyss s done for each gender. Ths s a repeated measures study where the objectve s to construct the normogram shown n fgure. Table shows all the mean structures and varance-covarances of nterest. A total of 8 models were ftted, each has a AIC value. For each of 8 models consdered, the rounded AIC values are gven n table. Table : AIC values for all models consdered TIME DURA TION AGE TIME+ DURA TION TIME + AGE TIME + DURA TION+ AGE Smple CS AR()
3 The mnmum value of AIC=6384 from the model wth mean structure of TIME+DURATION+AGE and varance-covarance AR() ndcates the best model among the 8 consdered. The predcted value of the response VOKG was computed from ths model and then smoothed to allow the constructon of the normogram whch the physcan can use to classfy the patent nto the approprate percentle category. Fgure showed the normogram for the male group constructed by usng the predcted VOKG from the selected model. symmetry+eye for example, means that the R matrx n PROC Mxed specfcaton s of type compound symmetry and eye s the random effect. Fgure shows the AIC for all 5 models, and the lowest AIC (the best model), s from the model wth eye as the only fxed effect, and compound symmetry as the varance-covarance structure O r g n a l A I C Intercept Eye Vst Eye Vst Eye Vst Eye*V Mean Structure Cov Structure Smple CS CS+Eye CS+Vst CS+Eye+Vst Appendx shows the SAS macro program for automatng the selecton procedure for ths example. Also usng the second method, the same model was chosen as the best model. Usng method, the model wth the most complex mean structure among those consdered s the one wth TIME+DURATION+AGE. Ths model s ftted usng the three varance-covarance structures and the AIC_R s mnmum for AR(). Then usng AIC to reduce the mean structure. In ths case AIC chooses the mean structure TIME+DURATION+AGE so the model selected s exactly the same as the one chosen n method. 5.0 Example Data collected on 9 ndvduals, each had 3 vsts (one or two weeks apart, except for one subject wth one vst, and one other subject wth two vsts). For each vst, one measurement was made on each eye to assess the permeablty (Pdc) to sodum fluorescen of the corneal epthelum. The objectve s to obtan the varance component estmates from the best model. There are fve mean structures of nterest (ntercept, eye, vst, eye+vst, eye+vst+eye*vst) and fve varance-covarance structures of nterest (smple, compound symmetry, compound symmetry+eye, compound symmetry+vst, compound symmetry+eye+vst) resultng n 5 models. In ths descrpton of the canddate models, compound 6.0 Addtonal ssues The AIC s known to be nconsstent (,8,9). Other crtera such CAIC (), SBC (7), HQ (3) are consstent crtera whch are also avalable n SAS 6.. Model selecton usng formula () whch has the trace term may have better consstency property than the AIC but ths has not been mplemented. Usng smulaton, we are currently evaluatng the performance and consstency of the crteron usng the trace term formula (). Lnhart and Zuchn (7) also dscuss other dscrepancy measures whch emphasze on the fxed effects sde of the lnear mxedeffects model. In certan practcal stuatons, these may be preferable to the Kullback-Lebler based crtera. 7.0 Concluson Ths papers revews some fundamental concepts of the AIC and shows how model selecton for lnear mxed-effects models can be done usng AIC. Analysts are encouraged to utlze selecton crtera such as AIC and others whch are already mplemented n the SAS software. We presented 3
4 two dfferent procedures for selectng the best model. The procedure suggested by Dggle and Wolfnger of usng REML for varance-covarance structure selecton, and ML for mean structure selecton has a computatonal advantage. The number of possble models evaluated for ths procedure s equal to the sum of the mean structures and varance-covarance structures n consderaton. The method we proposed usng all combnatons of mean structures and varance-covarance structures of nterest s more computatonally expensve especally when the number of mean structures and/or varance-covarance structures s large. However, ths method provdes a more comprehensve examnaton of all models evaluated. 8.0 Reference. Bozdogan, H. (987). Model selecton and Akake s nformaton crtera (AIC) : the general theory and ts analytcal extensons. Psychometrka 5, Dggle, P; Lang, K; Zeger, S. (994). Analyss of Longtudnal Data, Oxford Press. 3. Hannan, E.J. and Qunn, A.G. (979). The determnaton of the order of an autoregresson. Journal of Royal Statstcal Socety, Vol. B 4, Hosmer, D.W. and Lemeshow, S. (989). Appled Logstc Regresson. New York : John Wley and Sons, Inc. 5. Kullback, Solomon (978). Informaton Theory and Statstcs, Massachusetts: Peter Smth. 6. Lnhart, H and Zuchn, W. (986). Model Selecton. New York : John Wley and Sons, Inc. 7. Schwarz, G. (978). Estmatng the dmenson of a model. Annual of Statstcs, Vol. 6, Shbata, Rte (989). From Data to Model. New York : Sprnger-Verlag, Shbata, Rte (986). Consstency of model selecton and parameter estmaton. Essays n Tme Seres and Alled Processes. Appled Probablty Trust, Wolfnger, R.D. (993). Covarance structure selecton n general mxed models. Communcatons n Statstcs, Smulaton and Computaton, Vol., Wolfnger, R.D. (996). Heterogeneous varancecovarance structures for repeated measures. Journal of Agrcultural, Bologcal, and Envronmental Statstcs, Vol., Number, SAS, SAS/STAT, SAS/GRAPH are regstered trademarks or trademarks of SAS Insttute Inc. n the USA and other countres. ndcates USA regstraton. 0.0 Authors Long Ngo Unversty of Calforna, Berkeley 40 Warren Hall Berkeley CA 9470 (50) lhn@oron.ref.org Rchard Brand, Ph.D. Unversty of Calforna, Berkeley Havland Hall Berkeley CA 9470 (50) brand@stat.berkeley.edu 9.0 Acknowledgements The authors would lke to thank Dr. Ira Tager for the exercse data n example, Dr. Mark Segal for hs advce, and Ischema Research for provdng fundng and support for ths paper to be presented at SUGI. 4
5 Appendx /********************************************* Program : ex5.sas Tme : :33:07 pm By : Long Ngo Input : e:\brand\pcerept\saslb\pcerept.sd Output : Purpose : Automatng the macro for model selecton for example mplementng adjustment for AIC and consstent AIC estmate. *********************************************/ optons ls=80 ps=60 pageno= mprnt;; lbname rjb e:\brand\pcerept\saslb ; ttle ex5.sas ; data a; set rjb.pcerept; format _all_; *strp all defned formats off the data; proc sort; by d; data rjb.acnfo; *establsh the fnal data set structure; length mean $5 randvar repttype $5 crtera $3 ac nobs nfxed ncov nsubj 5; %macro v(mean,repttype); * macro for handlng just fxed effects; proc mxed data=a method=ml; class d eye vst; model lnpce = &mean ; repeated / type=&repttype subject=d; ttle "Model wth Mean Structure = &mean "; ttle3 "Repeated Type = &repttype"; make fttng out=aout; make SolutonF out=aoutfx; make CovParms out=aoutcov; %f; %mend; %macro vr(mean,randvar,repttype); * macro for handlng both fxed and random effects; proc mxed data=a method=ml; class d eye vst; model lnpce = &mean ; random &randvar / subject=d; repeated / type=&repttype subject=d; ttle "Model wth Mean Structure = &mean "; ttle3 "Random Effects = &randvar"; ttle4 "Repeated Type = &repttype"; make fttng out=aout; make SolutonF out=aoutfx; make CovParms out=aoutcov; %f; %mend; %macro f; data acnfo; length mean $5 randvar repttype $5; set aout; mean="&mean"; randvar="&randvar"; repttype="&repttype"; where descr=: Akake ; ac=value; data nobs; set aout; where descr=: Observaton ; nobs=value; *obtan number of observatons n analyss; data tfx; set aoutfx (keep=est); f est ne 0; proc unvarate noprnt; var est; output out=nfxed n=nfxed; *get the number of fxed effect parameters; data tcov; set aoutcov (keep=est); proc unvarate noprnt; var est; output out=ncov n=ncov; *get the number of covarance parameters; *get the number of avalable subjects for each model; data nsubj; set rjb.pcerept (keep=d); proc sort; by d; data nsubj; set nsubj; by d; f frst.d; c=; proc unvarate noprnt; var c; output out=nsubj sum=nsubj; * construct the desred data set; data acnfo; merge acnfo nfxed nobs ncov nsubj; data rjb.acnfo; set rjb.acnfo acnfo; %mend; 5
6 *(mean repeated type for macro %v) and (mean random repeated type for %vr); %v(/ s,smple); %v(/ s,cs); %vr(/ s,eye,cs); %vr(/ s,vst,cs); %vr(/ s,eye vst, cs); %v(eye / s,smple); %v(eye / s,cs); %vr(eye / s,eye,cs); %vr(eye / s,vst,cs); %vr(eye / s,eye vst, cs); %v(vst / s,smple); %v(vst / s,cs); %vr(vst / s,eye,cs); %vr(vst / s,vst,cs); %vr(vst / s,eye vst, cs); %v(eye vst / s,smple); %v(eye vst / s,cs); %vr(eye vst / s,eye,cs); %vr(eye vst / s,vst,cs); %vr(eye vst / s,eye vst, cs); %v(eye vst eye*vst / s,smple); %v(eye vst eye*vst / s,cs); %vr(eye vst eye*vst / s,eye,cs); %vr(eye vst eye*vst / s,vst,cs); %vr(eye vst eye*vst / s,eye vst, cs); proc format; value meantype = Intercept = Eye 3= Vst 4= Eye Vst 5= Eye Vst Eye*Vst ; value covtype = Smple = CS 3= CS+EYE 4= CS+Vst 5= CS+Eye+Vst ; * set up the data for graphng; end; else f mean= eye / s then meantype=; else f mean= vst / s then meantype=3; else f mean= eye vst / s then meantype=4; else f mean= eye vst eye*vst / s then meantype=5; f randvar= None and repttype= smple then covtype=; else f randvar= None and repttype= cs then covtype=; else f randvar= eye and repttype= cs then covtype=3; else f randvar= vst and repttype= cs then covtype=4; else f randvar= eye vst and repttype= cs then covtype=5; f meantype= then ncov=ncov-; *adjust for the resd; logl = ac+ncov ; *Mxed defnes AIC = logl - number of cov parameters; *ths s to get back logl value; ac = -*logl + *(nfxed+ncov); *recompute orgnal def. of AIC; ac_con = -*logl + (nfxed+ncov)*(log(nsubj)+); *consstent AIC estmate; label meantype= Mean Structure covtype = Cov Structure ac = Orgnal AIC ac_con = Consstent AIC logl = Log Lkelhood nobs = Number of Obs n Analyss nsubj = Number of Subjects n Analyss nfxed = Number of Fxed Effects Parameters ncov = Number of COV parameters ; format meantype meantype. covtype covtype.; drop descr value mean; proc sort ; by meantype covtype; goptons devce = wnprtm; symbol c=black v=pont =j l= wdth=3; symbol c=black v=crcle =j l= wdth=3; symbol3 c=black v=plus =j l=3 wdth=3; symbol4 c=black v=star =j l=4 wdth=3; symbol5 c=black v=damond =j l=5 wdth=3; axs order = ( to 5) ; proc gplot; plot ac * meantype = covtype / haxs=axs; ttle h=0.75 Fgure : AIC Values Computed for 5 Models n Example ; data rjb.t; set rjb.acnfo; f randvar =: & then randvar= None ; f _n_= then delete; *drop the null case used for settng; f mean= / s then do; mean= Intercept ; meantype=; 6
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 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 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 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 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 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 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 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 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 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 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 informationEXST7034 Regression Techniques Geaghan Logistic regression Diagnostics Page 1
Logstc regresson Dagnostcs Page 1 1 **********************************************************; 2 *** Logstc Regresson - Dsease outbreak example ***; 3 *** NKNW table 14.3 (Appendx C3) ***; 4 *** Study
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 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 5: Probability Distributions. Random Variables
Lecture 5: Probablty Dstrbutons Random Varables Probablty Dstrbutons Dscrete Random Varables Contnuous Random Varables and ther Dstrbutons Dscrete Jont Dstrbutons Contnuous Jont Dstrbutons Independent
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 informationX- 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 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 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 informationA 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 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 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 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 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 informationAvailable 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 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 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 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 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 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 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 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 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 information7/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 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 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 informationSome 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 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 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 informationUSING GRAPHING SKILLS
Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp
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 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 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 informationDesign of Structure Optimization with APDL
Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth
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 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 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 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 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 informationLife 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 informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
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 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 informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
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 informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
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 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 informationModeling Local Uncertainty accounting for Uncertainty in the Data
Modelng Local Uncertanty accontng for Uncertanty n the Data Olena Babak and Clayton V Detsch Consder the problem of estmaton at an nsampled locaton sng srrondng samples The standard approach to ths problem
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 informationLecture 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 informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
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 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 informationFITTING A CHI -square CURVE TO AN OBSERVI:D FREQUENCY DISTRIBUTION By w. T Federer BU-14-M Jan. 17, 1951
FTTNG A CH -square CURVE TO AN OBSERV:D FREQUENCY DSTRBUTON By w. T Federer BU-4-M Jan. 7, 95 Textbooks n statstcs (for example, Johnson, Statstcal Methods n Research; Love, Applcaton of Statstcal Methods
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 informationLOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit
LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE
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 informationSolitary 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 informationNonlinear Mixed Model Methods and Prediction Procedures Demonstrated on a Volume-Age Model
Nonlnear Mxed Model Methods and Predcton Procedures Demonstrated on a Volume-Age Model Prepared by: Shongmng Huang, Shawn X. Meng, Yuqng Yang August, 3 Techncal Report Pub. No.: T/6(3) ISBN No. 978--46-755-3
More informationThree 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 informationTopology Design using LS-TaSC Version 2 and LS-DYNA
Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool
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 informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationC2 Training: June 8 9, Combining effect sizes across studies. Create a set of independent effect sizes. Introduction to meta-analysis
C2 Tranng: June 8 9, 2010 Introducton to meta-analyss The Campbell Collaboraton www.campbellcollaboraton.org Combnng effect szes across studes Compute effect szes wthn each study Create a set of ndependent
More informationConcurrent models of computation for embedded software
Concurrent models of computaton for embedded software and hardware! Researcher overvew what t looks lke semantcs what t means and how t relates desgnng an actor language actor propertes and how to represent
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationThe BGLR (Bayesian Generalized Linear Regression) R- Package. Gustavo de los Campos, Amit Pataki & Paulino Pérez. (August- 2013)
Bostatstcs Department Bayesan Generalzed Lnear Regresson (BGLR) The BGLR (Bayesan Generalzed Lnear Regresson) R- Package By Gustavo de los Campos, Amt Patak & Paulno Pérez (August- 03) (contact: gdeloscampos@gmal.com
More informationEconometrics 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 informationA Coding Practice for Preparing Adaptive Multistage Testing Yung-chen Hsu, GED Testing Service, LLC, Washington, DC
SESUG 011 Paper PO-3 A Codng Practce for Preparng Adaptve Multstage Testng Yung-chen Hsu, GED Testng Servce, LLC, Washngton, DC ABSTRACT The purpose of ths paper s to present a smulaton study of a codng
More informationAdaptive Regression in SAS/IML
Adaptve Regresson n SAS/IML Davd Katz, Davd Katz Consultng, Ashland, Oregon ABSTRACT Adaptve Regresson algorthms allow the data to select the form of a model n addton to estmatng the parameters. Fredman
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 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 informationThe Man-hour Estimation Models & Its Comparison of Interim Products Assembly for Shipbuilding
Internatonal Journal of Operatons Research Internatonal Journal of Operatons Research Vol., No., 9 4 (005) The Man-hour Estmaton Models & Its Comparson of Interm Products Assembly for Shpbuldng Bn Lu and
More informationETAtouch RESTful Webservices
ETAtouch RESTful Webservces Verson 1.1 November 8, 2012 Contents 1 Introducton 3 2 The resource /user/ap 6 2.1 HTTP GET................................... 6 2.2 HTTP POST..................................
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 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 informationHelp for Time-Resolved Analysis TRI2 version 2.4 P Barber,
Help for Tme-Resolved Analyss TRI2 verson 2.4 P Barber, 22.01.10 Introducton Tme-resolved Analyss (TRA) becomes avalable under the processng menu once you have loaded and selected an mage that contans
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 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 informationMixed Linear System Estimation and Identification
48th IEEE Conference on Decson and Control, Shangha, Chna, December 2009 Mxed Lnear System Estmaton and Identfcaton A. Zymns S. Boyd D. Gornevsky Abstract We consder a mxed lnear system model, wth both
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 informationAir Transport Demand. Ta-Hui Yang Associate Professor Department of Logistics Management National Kaohsiung First Univ. of Sci. & Tech.
Ar Transport Demand Ta-Hu Yang Assocate Professor Department of Logstcs Management Natonal Kaohsung Frst Unv. of Sc. & Tech. 1 Ar Transport Demand Demand for ar transport between two ctes or two regons
More informationDesign and Analysis of Algorithms
Desgn and Analyss of Algorthms Heaps and Heapsort Reference: CLRS Chapter 6 Topcs: Heaps Heapsort Prorty queue Huo Hongwe Recap and overvew The story so far... Inserton sort runnng tme of Θ(n 2 ); sorts
More informationComparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments
Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,
More informationA B-Snake Model Using Statistical and Geometric Information - Applications to Medical Images
A B-Snake Model Usng Statstcal and Geometrc Informaton - Applcatons to Medcal Images Yue Wang, Eam Khwang Teoh and Dnggang Shen 2 School of Electrcal and Electronc Engneerng, Nanyang Technologcal Unversty
More informationECONOMICS 452* -- Stata 11 Tutorial 6. Stata 11 Tutorial 6. TOPIC: Representing Multi-Category Categorical Variables with Dummy Variable Regressors
ECONOMICS * -- Stata 11 Tutoral Stata 11 Tutoral TOPIC: Representng Mult-Category Categorcal Varables wth Dummy Varable Regressors DATA: wage1_econ.dta (a Stata-format dataset) TASKS: Stata 11 Tutoral
More informationA Comparison of RAS and Entropy Methods in Updating IO Tables
A Comparson of RAS and Entropy Methods n Updatng IO Tables S. Amer Ahmed 1 and Paul V. Preckel 2 PRELIMINARY VERSION PLEASE DO NOT DISTRIBUTE OR CITE WITHOUT PERMISSION COMMENTS WELCOME Selected Paper
More informationWhy 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 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 information