Non-Linear Continuum Regression Using Genetic Programming
|
|
- Terence Maxwell
- 5 years ago
- Views:
Transcription
1 Non-Lnear Contnuum Regresson Usng Genetc Programmng Ben McKay Mark Wlls Domnc Searson Dept. Chemcal & Process Engng. Unversty of Necastle NE 7RU, UK Gary Montague Abstract In ths contrbuton, genetc programmng s combned th contnuum regresson to produce to novel non-lnear contnuum regresson algorthms. he frst s a sequental algorthm hle the second, adopts a team-based strategy. Havng dscussed contnuum regresson, the modfcatons requred to extend the algorthm for non-lnear modellng are outlned. he results of applyng the derved non-lnear algorthms to the development of an nferental model of a food extruson process are then presented. he superor performance of the sequental algorthm, as compared to a smlar non-lnear partal least squares algorthm, s demonstrated. In addton, these results clearly demonstrate that the team-based strategy sgnfcantly outperforms the sequental approach. INRODUCION In ths paper Genetc Programmng (GP) s used to develop to non-lnear contnuum regresson algorthms for buldng nput-output models of chemcal process systems. A team-based strategy s nvestgated, and compared to a more tradtonal sequental approach. Why are chemcal engneers nterested n data-based modellng? Recent years have seen an ncrease n the emphass on product 'qualty', economc process performance, envronmental and safety ssues n the process ndustres, and these factors have placed sgnfcant demands on exstng operatonal procedures. Process montorng, optmsaton and advanced control have the potental to satsfy many of these demands. Hoever, n order to realse the benefts of these technques, t s generally necessary to have an accurate model of the process. Whle t may be possble to develop such a model from frstprncples (usng a detaled knoledge of the physcs and chemstry of a system), there are a number of drabacks to ths approach. As many ndustral process systems are extremely complex and relatvely poorly understood, the development of a realstc model can take a consderable amount of tme and effort. In addton, the modellng process nevtably nvolves a number of smplfyng assumptons that have to be made n order to provde a tractable soluton. herefore, a mechanstc model ll often be costly to develop and may be subject to naccuraces. Consequently, data-based modellng (usng plant data to buld an nput-output model that descrbes the response of process outputs to changes n nputs, thout attemptng to represent the underlyng process mechansms) presents a popular alternatve. Why use non-lnear models? Many chemcal process systems are non-lnear n nature. herefore, n order to acheve suffcent model accuracy, a non-lnear model structure s typcally requred. Why not use a standard GP algorthm? he performance of a standard GP algorthm hen used to develop non-lnear models of chemcal process systems (usng ether smulated or ndustral nput-output data) can be dsappontng hen compared to other non-lnear regresson technques such as feedforard neural netorks (e.g. see McKay, 997, Hden, 998). Generally, a GP algorthm s much sloer than compettve technques (especally for ncreasng numbers of nput varables) and the predcton errors on unseen (test) data are typcally hgher, ndcatng a less accurate model. Why the nterest n Contnuum Regresson? Our recent ork has shon that strateges that reduce the algorthm s search space can help the overall performance of a GP algorthm (hen used for model development). A number of multvarate statstcal modellng technques provde systematc procedures for the decomposton of an nput-output relatonshp. By extractng and structurng nformaton n an approprate manner, these technques can be used to reduce the effectve search space. In Hden et al. (998) t as demonstrated that the combnaton of GP th one such technque, knon as Partal Least Squares (PLS), could produce results of comparable accuracy to alternatve non-lnear regresson technques such as neural netorks. Hoever, PLS s merely one of a famly of lnear multvarate statstcal modellng
2 technques. It s Contnuum Regresson (CR) that provdes a unfed frameork encompassng all of these technques. Wse and Rcker (997) demonstrated the effectveness of CR, developng models of mproved accuracy hen compared to alternatve approaches (thout sacrfcng model robustness and generalsaton). Hoever, standard CR algorthms produce lnear models. In ths paper, e combne GP and CR to produce nonlnear CR algorthms. he objectve beng the development of an algorthm that can develop accurate and robust non-lnear models. Ho s ths paper organsed? he next secton provdes some background nformaton on lnear regresson. CR s then ntroduced and the range of technques t encompasses are explaned. Next, the modfcatons requred to extend the algorthm to a nonlnear strategy are outlned. o approaches are proposed, a sequental and a team-based algorthm. Havng detaled the algorthms, ther performance on a benchmark example are studed: he development of an nferental model of a food extruson process. After dscusson of the results, conclusons are dran and recommendatons for further ork are made. 2 LINEAR REGRESSION Gven a set of nput and output measurements for a process, a typcal modellng objectve s to obtan a relatonshp, that can be used to explan the varaton n an (n x ) output vector, y, n response to changes n an (n x m) nput matrx, X. hs can be expressed mathematcally as follos: y = f(x) + e () Where the functon f(.) s chosen so as to mnmse the vector of predcton errors, e. If f(.) s lnear n the parameters, then the nput-output model reduces to: y = Xr + e (2) here r s a (m x ) vector of regresson coeffcents. A famly of lnear multvarate statstcal modellng algorthms have been developed for the purpose of estmatng r. hree of the more common and effectve of these are Multple Lnear Regresson, Prncpal Component Regresson and Partal Least Squares. What s Multple Lnear Regresson? Multple Lnear Regresson (MLR) uses one of the many varants of the Least Squares technque (such as Batch Least Squares ) to parameterse Equaton 2. A dra-back of ths method s that t fals to produce accurate and robust models f the nput data s correlated (the columns of nput data are lnearly related to each other). hs s the norm hen data s collected from chemcal process systems. What s Prncpal Component Regresson? PCR avods the problems assocated th the modellng of correlated nput data (e. sngular solutons or mprecse parameter estmatons) by transformng the nputs nto a ne set of uncorrelated data (typcally of reduced dmensonalty), and then performng MLR beteen ths transformed data set and the output data. he procedure s based on a technque knon as Prncpal Component Analyss (PCA), one of the oldest and best documented multvarate statstcal technques (Pearson, 90). PCA s performed on the nput data, X, and generates a set of transformed nput varables (knon as prncpal components) that are uncorrelated and ranked n term of sgnfcance. hs allos the least sgnfcant prncpal components (ones that only descrbe process nose) to be dscarded pror to modellng. More rgorously, PCA rotates X to produce an (n x m) scores matrx, and an (m x m) loadngs matrx, V (descrbng the requred rotaton) such that, =XV. he loadng matrx V contans the egenvectors of the nput data correlaton matrx, X X. he scores matrx,, contans orthogonal projectons of the nput varables, sorted (from left to rght) n terms of decreasng contrbuton to the varance n the nput data. Retanng the frst p prncpal components leads to a reduced (n x p) scores matrx p and an (m x p) loadngs matrx V p. o perform PCR, batch least squares s used to regress p aganst y, gvng the (p x ) regresson vector b, such that y= p b + e. he nput-output mappng s then gven as, y = XV p b + e (3) Unfortunately, as PCA only consders the varaton n the nput data, there s no guarantee that the varaton represented by the major prncpal components ll correspond to the varaton that best descrbes the relatonshp th the output varable. What s Partal Least Squares? Partal Least Squares (PLS) as frst descrbed n Wold (966). As th PCR, the PLS algorthm overcomes problems assocated th measurement nose and correlaton beteen nput varables. Hoever, an addtonal advantage of PLS (as compared to PCR), s that by consderng both the nput varance and the nputoutput covarance, the algorthm provdes the opportunty for more accurate model development. A good ntroducton to the technque can be found n Gelad and Koalsk (986). PLS s commonly mplemented usng the NIPALS (Nonlnear Iteratve Partal Least Squares) algorthm. NIPALS sequentally extracts pars of latent vectors (analogous to the columns of the scores matrx n PCA) from the nput and output data. A unvarate (sngle nput, sngle output) regresson s performed at each stage, to model the relatonshp beteen these latent vector pars. he fnal model s then constructed by summng the contrbuton from each step. More rgorously, PLS (startng th =, X =X and, y =y) sequentally extracts latent vector pars, t and u, from X an y, n order of decreasng predctve poer. For the sngle output case, the vector u s equal to y,, hle the vector t corresponds to the projecton of X, n the
3 drecton most correlated to u (.e. t =X. here are the optmal nput projecton eghts).. he vectors t and u, are then regressed to obtan a unvarate lnear model th a regresson parameter b (such that u = b t + e ). As each latent vector s calculated the nformaton used s deducted from the nput-output data and these resduals (X + and y + ) are used to calculate the next set of latent vectors. hs procedure s repeated untl addtonal latent vector pars fal to mprove the model performance. he fnal model s then constructed by summng the contrbutons from each of the sgnfcant latent vector pars, y ˆ = b X (4) = here ŷ s the estmated output y. Substtutng the expresson for calculatng the nput resduals (X + = X - X ) nto Equaton 4 and recallng that X =X gves, yˆ = Xb + X ( I ) b + K + X ( I 2 K ( ) 2 ( ) Usng the fact that the are orthogonal (and thus j =0, for j), ths reduces to a form that s equvalent to Equaton 2, N ) b LV y = X b + e = Usng PLS, dffcultes assocated th modellng correlated nput varables are avoded by calculatng latent varables sequentally and only performng a unvarate regresson at each stage. Problems assocated th measurement nose are also overcome by projectng the nputs and outputs onto a loer dmensonal space. In addton, consderng both the nput varance and the nput-output covarance leads to mproved accuracy. Ho are the methods related? (5) (6) model For a lnear nput-output mappng, f all prncpal components or latent varables are retaned hen performng PCR or PLS, the to methods are equvalent to MLR. It s prmarly the dfference n emphass placed on varaton n the nput data compared to covarance beteen the nputs and the output that dstngushes the varous technques. A mathematcal frameork for unfyng these technques ll be ntroduced n the next secton. 3 CONINUUM REGRESSION Stone and Brooks (990) and Wse and Rcker (993) have demonstrated that MLR, PCR and PLS can be unfed under a sngle frameork knon as Contnuum Regresson. At one extreme of the contnuum s PCR, at the other s MLR, hle PLS s n the mddle. A qualtatve nterpretaton of ths concept can be obtaned by consderng ths contnuum n terms of the emphass that s placed on the varance n the nput data, hen compared to the covarance beteen the nputs and the outputs. Wth MLR, only the nput-output covarance s consdered hen formulatng the model (n fact the nputs are regarded as ndependent).wth PCR, a model s developed beteen the output and the sgnfcant prncpal components. hese components represent the most mportant varatons n the nput data, but ther covarance th the output s not necessarly maxmsed. Whle th PLS, a compromse beteen MLR and PCR s obtaned by consderaton of both the correlaton n the nput data and nput-output covarance. CR allos a smooth transton beteen these technques. What s the CR algorthm? he CR algorthm proposed by Wse and Rcker (993), frst creates a transformed data set by applyng a sophstcated scalng technque to the nput data. hs effectvely arps the nput space to place ether more or less emphass on exstng correlatons (dependng on a factor to be referred to as the contnuum coeffcent ). PLS (usng NIPLAS, as outlned n Secton 2) s then performed on the transformed data set. he frst step n transformng the nput data s to decompose X usng the sngular value decomposton (SVD) as, X = UΣV (7) here U s an (n x n) matrx of the egenvectors of XX and V s an (m x m) matrx of the egenvectors of the data correlaton matrx, X X. he dagonal elements of the (n x m) matrx Σ are the postve square roots of the egenvalues of X X and are called the sngular values (all other elements of Σ are zero). A modfed X matrx, (X µ ) s then formed as, X µ = UΣ µ V (8) here the matrx Σ µ s the sngular values rased to the poer µ (0 µ ). Where µ ll be referred to as the contnuum coeffcent. he standard NIPALS algorthm s then appled to X µ and y, gvng a fnal model of the follong form, y ˆ = N LV b = X In a smlar manner to Equaton 4, ths can be converted nto a form that s equvalent to Equaton 2 as follos, µ LV (µ ) y = XVΣ V b + e N = (9) (0) What s the qualtatve nterpretaton of the contnuum coeffcent? µ 0 CR tends toards MLR. µ = CR s equvalent to PLS. µ CR tends toards PCR.
4 4 NON-LINEAR CR USING GP o approaches for combnng GP and CR to create a non-lnear CR algorthm are proposed. he frst evolves nner models sequentally, hle the second evolves a team of nner models smultaneously. What s the sequental algorthm? he sequental non-lnear CR algorthm performs a GP run each tme a non-lnear nner model s requred (e. at each teraton of the latent varable loop). he mathematcal detals of the algorthm can be found n Appendx. At Step 8, a standard GP algorthm mnmses the cost functon J, by judcus choce of nonlnear functon, f (.). he optmal contnuum coefcent (µ) s obtaned by an outer loop that performs a undmensonal search usng Brent s method (Press et al., 992). What s the team-based algorthm? Rather than perform a GP run each tme a non-lnear nner model s requred, t s possble to evolve a team of nner models smultaneously usng a mult-populaton GP algorthm. Each team s composed of N p ndvduals (each an nner model), dran from N p separate populatons {P,, P Np }. eam members are assgned specfc tasks, based on the populaton from hch they are dran (eg. Members of populaton P are assgned the task of developng an nner model beteen the frst latent vector par, hle populaton P j contans canddates for the j th nner model). In ths manner, a team of non-lnear functons {f (.),,f Np (.)}.are evolved to mnmse the overall model predcton error (e n Equaton ). Ftness s calculated on a team bass. he ftness of a team s determned by mplementng the CR algorthm gven n Appendx (usng the nner models defned by the gven team). For the th latent varable par, at Step 8, the team Sequental eam-based Functon Set +, -, /, *, protected ^, protected, exp(), protected ln(), tanh() ermnal Set t,constants {t, t m,},constants Output: A sngle nner model for the A team of N P nner models. th latent varable par. Populaton Sze: Ftness functon Lnear rankng Crossover Probablty 0.7 Mutaton Probablty: 0.2 Drect Reproducton 0. Probablty Proporton of elte 0. ndvduals retaned: ermnaton crteron 40 Gens. 60 Gens. Parameter optmsaton Yes No otal # of runs 20 Average # ndvduals processed per run: 5.0x x0 5 able : Confguraton of the GP Algorthms member correspondng to the th nner model s evaluated. Each ndvdual n a team s then assgned the teams ftness. Each populaton s homogenous (e. only ndvduals from the same populatons can be crossed over). he crossover strategy employed does not mantan the ntegrty of teams (e. t s non-cohesve). he varous populatons are treated ndependently hen selectng ndvduals for crossover (rather than crossng over complete teams). Pror to ftness evaluaton, a teams contnuum coeffcent (µ) as determned n one of to ays. Ether, µ as optmsed usng Brent s method (th a probablty of 0.), or a random Gaussan perturbaton as made to the value of µ assocated th the fttest team of the prevous generaton. hs perturbed value of µ as then used to evaluate the teams ftness. 5 CONFIGURAION OF HE GP ALGORIHMS able shos the values of the most mportant GP algorthm control parameters, as ell as a summary of the termnal and functon sets used. It may be noted that the team-based algorthm used a sgnfcantly larger populaton than the sequental. Hoever, as the sequental algorthm as employng a parameter optmser (Levenberg-Marquardt non-lnear least squares), the sequental algorthm actually processed tce as many ndvduals per run. 6 EXPERIMENAL MEHOD For all of the results presented, the Root Mean Square () error beteen the actual and predcted output as calculated based on an unseen (or test) data set. hs test set s used to verfy the generalsaton of the model. Due to the stochastc nature of the GP algorthm, usng t on anythng but the smplest of systems produces dfferent results for every run. herefore, n order to nvestgate the performance of a GP-based algorthm for model buldng multple runs ere performed for each technque. 7 MODELLING A FOOD EXRUSION PROCESS As descrbed n Elsey et al (997), the parameters of ths smulated process have been ftted to plant data obtaned from a plot-scale APV Baker MPF 40 cookng extruder, processng a mxture of corn flour and ater. Gven the scre speed, feed rate, feed mosture content, feed temperature and barrel temperature profle, the model calculates the degree of gelatnsaton of the product. hs as selected as the process output of nterest n these studes. herefore, the termnal set for ths system conssts of four varables, scre speed, feed rate, feed mosture content and feed temperature. Four hundred steady-state readngs ere avalable for modellng. hs data as splt evenly th the frst 200 ponts beng used
5 to tran the models and the remanng 200 ponts reserved for testng. hs data set has become our benchmark example for comparng non-lnear modellng technques. A selecton of pertnent results are presented n able 2. hese results demonstrate that standard GP performs poorly hen compared to a feedforard neural netork (FANN). hs led to the development of to GP-based non-lnear PLS algorthms. he frst, GP_PLS (the so called quck and drty approach), s equvalent to the sequental algorthm presented n ths paper, hen the contnuum coeffcent s set to one. Whle the second, GP_PLS2, demonstrated that optmsaton of the nput projecton eghts ( ) can be benefcal n reducng the model predcton errors. hs s because, n lnear PLS the s calculated to acheve maxmum lnear covarance beteen t and u even though the nner models are n fact non-lnear. herefore, for a gven non-lnear functon, may not correspond to the drecton that produces the best approxmaton of u. Hden et al. (998) demonstrated that GP_PLS2 could produce results of comparable accuracy to a FANN. Hoever, t as concluded that optmsng as an unacceptable computatonal burden (especally th ncreasng numbers of nput varables), lmtng the applcaton of the algorthm. As such, n ths ork no attempt as made to optmse the nput projecton eghts. Fgure shos a comparson of the error dstrbutons obtaned usng the sequental and teambased algorthms (hle able 3 summarses the average Frequency 0 5 Sequental eam-based Error on est Set Fgure : Model error dstrbutons on the cookng extruder data. Method Mean est Mn. est Source FANN McKay (997) Standard GP Hden(998) PLS - Lnear GP_PLS GP_PLS Hden et al. (998) able 2: Summary of pror modellng ork on the cookng extruder data. Method Mean est Mn. est µ Best Model Best Model Sequental eam-based able 3: Results for the sequental and team-based algorthms on the cookng extruder data. and best errors). It may be noted that the sequental algorthm outperforms GP_PLS. hs s because the optmsaton of µ has a smlar effect to optmsng the nput eghts (n that t changes the projecton of the nput data n an attempt to maxmse the model ft). Hoever, as there s only one contnuum coeffcent (as compared to hch s an (m x ) vector, here m s the number of nput varables) the optmsaton problem becomes more tractable. It s also apparent that the team-based approach produces sgnfcantly loer errors on the test set, compared to the sequental algorthm. hs s despte the fact that the sequental algorthm processed more ndvduals (as shon n able ). he sequental algorthm fnds the best ft for each latent varable par n turn. hs procedure effectvely constrans the type of solutons the algorthm ll fnd. Whle resultng n good local solutons at each step, t s conjectured that t may be prone to beng trapped n local mnma. In comparson, the team-based algorthm optmses all of the nner models smultaneously. As Ftness s calculated on a team-bass, ths allos a tradeoff beteen team member contrbutons to the overall ftness measure. hs provdes the potental for escape from local mnma and the possblty of obtanng a more global optmum. he best set of nner models obtaned usng the team-based algorthm are gven by Equatons, 2, and 3, u = 2.6 exp(tanh(tanh(exp(4t )))) () u 2 = ( tanh(t 2 ) t2 + (2 t )/exp(t 2 ) (2) + u t 2 2 ) u 3 = 0.80 (t ) tanh(2t 3 ) (3) 8 CONCLUSIONS he food extruson benchmark example shos that nonlnear CR usng GP gves superor performance to a smlar mplementaton of non-lnear PLS. More specfcally, the sequental non-lnear CR algorthm outperforms GP_PLS of Hden et al.(998). It s conjectured that ths s because the optmsaton of µ has a smlar effect to optmsng the nput projecton eghts. Both change the projecton of the nput data n an attempt to maxmse the model ft. Hoever, optmsng the contnuum coeffcent s less computatonally ntensve than optmsng (hch s an (m x ) vector, here m s the number of nput varables). he case study also demonstrates the effectveness of the team-based approach to non-lnear CR, as compared to the sequental algorthm. By fndng the best ft for each latent varable par n turn, the sequental technque effectvely constrans the type of solutons the algorthm ll fnd. Whle concentratng on achevng good nner models at each step, t may be prone to beng trapped n local mnma. By optmsng all of the nner models smultaneously, the team-based algorthm allos tradeoffs beteen ndvduals contrbutons to the overall team
6 ftness. hs may allo the evoluton of a more globally optmal soluton. As explaned n Secton 4, the team-based algorthm employs a non-cohesve reproducton strategy. hs means that teams are broken up durng reproducton (e the ntegrty of the team s not mantaned). If only one type of team strategy s gong to ork (e. f there s only one good ay of performng each task), then dsruptng the ntegrty of the teams ll probably not have a detrmental effect. Whle e beleve that the non-lnear CR modellng task s an example of such a system (here the form of each nner model, and hence the task of each team member, s largely dctated by the data set), future ork ll examne the effect of mplementng a cohesve crossover strategy. As noted n Secton 7, the team-based non-lnear CR algorthm does not outperform GP_PLS2, the eght optmsed non-lnear PLS algorthm of Hden et al., (998). Hoever, t as consdered that optmsng the projecton eghts as currently an unacceptable computatonal burden. As such, fndng an mproved method of mplementng the nput eght optmsaton ll be a focus of future ork. 9 REFERENCES Elsey, J. Repenhausen, J. McKay, B., Barton, G.W. and Wlls, M.J., (997), Modellng and Control of a Food Extruson Process, Computers and Chemcal Engneerng, Vol. S2, pp S36-S366. Gelad, P. and Koalsk, B.R. (986), Partal least squares regresson: A tutoral, Analytca Chmca Acta, Vol.85, pp.-7. Hden, H.G. (998), Data-Based Modellng usng Genetc Programmng, PhD hess, Dept. Chemcal and Process Engneerng, Unversty of Necastle, UK. Hden, H.G., McKay, B., Wlls, M.J. and Montague, G.A. (998) Non-lnear partal least squares usng genetc programmng, Proc. 3 rd Annual Conf. On Genetc Programmng, Unversty of Wsconsn, Maddson, USA. July th., pp McKay, B., (997), Studes n Data-Based Modellng, PhD hess, Dept.Chemcal Engneerng, he Unversty of Sydney, Australa. McKay, B., Wlls, M.J. and Barton, G.W., (997), Steady-state modellng of chemcal process systems usng genetc programmng, Computers and Chemcal Engneerng, Vol.2, No.9, pp Pearson, K., (90), On lnes and planes of closest ft to systems of ponts n space, Phl. Mag., Ser.6, 2(), pp Press, W.H., Flannery, B.P., eukolsky, S.A and Vetterlng, W.., (992), Numercal Recpes n C: he Art of Scentfc Computng, 2nd Ed, Cambrdge Unversty Press, USA. Stone and Brooks (990), Contnuum regresson: Crossvaldated sequentally constructed predcton embracng ordnary least squares, partal least squares, and prncpal components regresson, J.R.Statst. Soc., B,52, pp Wse, B.M. and Rcker, N.L. (993) Identfcaton of fnte mpulse response models th contnuum regresson, Journal of Chemometrcs, Vol. 7, -4. Wold, S., (966), Non-lnear estmaton by teratve least squares procedures, Research Papers n Statstcs, Ed. Davd, F., Wley, Ne York, USA. APPENDIX : Non-Lnear Contnuum Regresson Algorthm Sequental Algorthm: he algorthm n able A represents a sngle functon evaluaton for a gven value of µ. hs s called repeatedly by Brent s method to optmse µ. Note that a full GP run s performed at Step 8 to optmse the ft of each nner model. eam-based Algorthm: he algorthm n able As called by a mult-populaton GP algorthm as a sngle ftness evaluaton, for a gven team of nner models, and a gven µ. () Mean centre and normalse the nput and output data (X and y) (2) Perform SVD on scaled nput data (X) UΣV = X (n x n)(n x m)(m x m) (3) Generate modfed nput data (X µ ) X µ = UΣ µ V (n x m) matrx (4) Set the output latent vector (u ) equal to the output. u = y (n x ) column vector (5) Calculate eghts ( ) that correspond to the drecton n = ( X ) u (m x ) column vector X th the greatest covarance th u. (6) Normalse to unt length = (m x ) column vector (Note. refers to the Eucldean Norm) (7) Calculate the latent vector t hch s the projecton of X onto t = X (n x ) column vector the drecton defned by. (8) Sequental: mnj eam-based: Use suppled f ( f (. ))( f (. )) (.) J = u t u t f(.) (9) Calculate resdual matrces X = X t (n x m) matrx + (n x ) column vector (0) If <, {Return to Step 5; = +} () Construct the fnal model y = y f ( t ) + yˆ = = f ( X ) able A: he non-lnear contnuum regresson algorthm. (m x ) column vector
Lecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationGraph-based Clustering
Graphbased Clusterng Transform the data nto a graph representaton ertces are the data ponts to be clustered Edges are eghted based on smlarty beteen data ponts Graph parttonng Þ Each connected component
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 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 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 informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationA Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers
62626262621 Journal of Uncertan Systems Vol.5, No.1, pp.62-71, 211 Onlne at: www.us.org.u A Smple and Effcent Goal Programmng Model for Computng of Fuzzy Lnear Regresson Parameters wth Consderng Outlers
More informationA Robust LS-SVM Regression
PROCEEDIGS OF WORLD ACADEMY OF SCIECE, EGIEERIG AD ECHOLOGY VOLUME 7 AUGUS 5 ISS 37- A Robust LS-SVM Regresson József Valyon, and Gábor Horváth Abstract In comparson to the orgnal SVM, whch nvolves a quadratc
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 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 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 informationStructure from Motion
Structure from Moton Structure from Moton For now, statc scene and movng camera Equvalentl, rgdl movng scene and statc camera Lmtng case of stereo wth man cameras Lmtng case of multvew camera calbraton
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 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 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 informationThe Impact of Delayed Acknowledgement on E-TCP Performance In Wireless networks
The mpact of Delayed Acknoledgement on E-TCP Performance n Wreless netorks Deddy Chandra and Rchard J. Harrs School of Electrcal and Computer System Engneerng Royal Melbourne nsttute of Technology Melbourne,
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 informationControl strategies for network efficiency and resilience with route choice
Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve
More informationA Workflow for Spatial Uncertainty Quantification using Distances and Kernels
A Workflow for Spatal Uncertanty Quantfcaton usng Dstances and Kernels Célne Schedt and Jef Caers Stanford Center for Reservor Forecastng Stanford Unversty Abstract Assessng uncertanty n reservor performance
More informationDetection, isolation and reconstruction of faulty sensors using principal component analysis +
Indan Journal of Chemcal Technology Vol. 1, July 005, pp. 430-435 Detecton, solaton and reconstructon of faulty sensors usng prncpal component analyss + M S R K Bose, G Sathyendra Kumar & Ch Venkateswarlu
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 informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
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 informationAppearance-based Statistical Methods for Face Recognition
47th Internatonal Symposum ELMAR-2005, 08-10 June 2005, Zadar, Croata Appearance-based Statstcal Methods for Face Recognton Kresmr Delac 1, Mslav Grgc 2, Panos Latss 3 1 Croatan elecom, Savsa 32, Zagreb,
More informationCategories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms
3. Fndng Determnstc Soluton from Underdetermned Equaton: Large-Scale Performance Modelng by Least Angle Regresson Xn L ECE Department, Carnege Mellon Unversty Forbs Avenue, Pttsburgh, PA 3 xnl@ece.cmu.edu
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 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 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 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 informationParallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)
Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)
More informationChapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward
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 informationPrincipal Component Inversion
Prncpal Component Inverson Dr. A. Neumann, H. Krawczyk German Aerospace Centre DLR Remote Sensng Technology Insttute Marne Remote Sensng Prncpal Components - Propertes The Lnear Inverson Algorthm Optmsaton
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 informationEVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS
Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay
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 informationLECTURE : MANIFOLD LEARNING
LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationMulti-dimensional Fault Diagnosis Using a Subspace Approach. Ricardo Dunia and S. Joe Qin. University of Texas at Austin.
Mult-dmensonal Fault Dagnoss Usng a Subspace Approach Rcardo Duna and S. Joe Qn Department of Chemcal Engneerng Unversty of exas at Austn Austn, X 78712 qn@che.utexas.edu Abstract Fault detecton and process
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 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 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 informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
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 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 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 informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
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 informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationSVM-based Learning for Multiple Model Estimation
SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:
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 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 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 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 informationUsing the Correlation Criterion to Position and Shape RBF Units for Incremental Modelling
Internatonal Journal of Automaton and Computng 2 (2006) 0-0 Usng the Correlaton Crteron to Poston and Shape RBF Unts for Incremental Modellng Xun-xan Wang Neural Computng Research Group, Aston Unversty,
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 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 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 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 informationMaximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation
Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn
More informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
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 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 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 informationArtificial Intelligence (AI) methods are concerned with. Artificial Intelligence Techniques for Steam Generator Modelling
Artfcal Intellgence Technques for Steam Generator Modellng Sarah Wrght and Tshldz Marwala Abstract Ths paper nvestgates the use of dfferent Artfcal Intellgence methods to predct the values of several contnuous
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationData Mining For Multi-Criteria Energy Predictions
Data Mnng For Mult-Crtera Energy Predctons Kashf Gll and Denns Moon Abstract We present a data mnng technque for mult-crtera predctons of wnd energy. A mult-crtera (MC) evolutonary computng method has
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 informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More informationA Multivariate Analysis of Static Code Attributes for Defect Prediction
Research Paper) A Multvarate Analyss of Statc Code Attrbutes for Defect Predcton Burak Turhan, Ayşe Bener Department of Computer Engneerng, Bogazc Unversty 3434, Bebek, Istanbul, Turkey {turhanb, bener}@boun.edu.tr
More informationINF Repetition Anne Solberg INF
INF 43 7..7 Repetton Anne Solberg anne@f.uo.no INF 43 Classfers covered Gaussan classfer k =I k = k arbtrary Knn-classfer Support Vector Machnes Recommendaton: lnear or Radal Bass Functon kernels INF 43
More information