OPTIMIZATION BY SIMULATION METAMODELLING METHODS. Russell C.H. Cheng Christine S.M. Currie
|
|
- Dora Newman
- 5 years ago
- Views:
Transcription
1 Proceedngs of the 4 nter Sulaton Conference R G Ingalls, M D Rossett, J S Sth, and B A Peters, eds OPIMIZAION BY SIMULAION MEAMODELLING MEHODS Russell CH Cheng Chrstne SM Curre School of Matheatcs Unversty of Southapton Southapton, SO7 BJ, UK ABSRAC e consder how sulaton etaodels can be used to optze the perforance of a syste that depends on a nuber of factors e focus on the stuaton where the nuber of sulaton runs that can be ade s lted, and where a large nuber of factors ust be ncluded n the etaodel Bayesan ethods are partcularly useful n ths stuaton and can handle probles for whch classcal stochastc optzaton can fal e descrbe the basc Bayesan ethodology, and then an extenson to ths that fts a quadratc response surface whch, for functon nzaton, s guaranteed to be postve defnte An exaple s presented to llustrate the ethods proposed n ths paper INRODUCION In sulaton output analyss, t s often ore convenent to use a sple statstcal (usually regresson) odel of the sulaton output rather than to work drectly wth the sulaton odel hese splfed odels are tered etaodels (see Barton 998) Let the output of one run of our sulaton odel be y e assue that ths depends n a contnuous way on p factors x = (x, x,, x p ), and can therefore be regarded as a functon of these factors e treat these factors as decson varables that are set by the controller of the syste under nvestgaton e thus assue the followng sulaton etaodel y = q(x, θ) + ε, () where q(x, θ) s a regresson functon descrbng the underlyng dependence of the response y on the factor varables x, and ε s a rando nose varable, to allow for the nherent rando varablty n the observed output value he vector θ = (θ, θ,, θ ) s a set of coeffcents on whch the regresson functon depends Soe, possbly all, of these coeffcents wll be unknown and have to be estated by fttng the regresson functon to observed sulaton output Geoetrcally the regresson functon can be thought of as defnng a surface n p-densonal space that descrbes our estate of the dependence of the sulaton response on the p factors (x, x,, x p ) hs nterpretaton gves rse to the nae response surface ethodology Good basc references are Barton (998) and Hood and elch (993) Response surface ethodology s useful f we wsh to fnd the factor settng x* for whch the syste response s optal For exaple, f the etaodel descrbes the perforance of the syste, so that q(x, θ) s sply a perforance ndex, then x* wll be the factor settng that optzes q(x, θ) For a dscusson of sulaton optzaton and the use of response surface ethodology for ths, see Azadvar (999), Kelton (999), Glover, Kelly and Laguna (999), Fu et al (), Gonda et al (), Law and McCoas () and Swsher et al () One serous and coon dffculty reans If the nuber of factors s large but the sulaton odel s coplex so that only few runs can be ade, then t ay not be possble to estate all the coeffcents of the etaodel usng for exaple classcal ethods of axu lelhood Here a Bayesan approach has a great advantage In the Bayesan approach we have a pror probablty dstrbuton π(θ) that expresses our pror belef about the lely value of the paraeters, whch gves us a vable startng pont for the sulaton runs As we ake our sulaton runs we can progressvely odfy and ake ore precse our belef about the dstrbuton of θ e can stop the procedure at any pont, wth the knowledge about the behavor of the syste output provng wth the nuber of sulaton runs ade One further potental proble that can occur wth ths ethodology s that the response surface ftted s not postve (negatve) defnte when searchng for a nu (axu) For stuatons where we are farly certan that there s an optu (whch wll be assued to be a nu n what follows) we present here a sple ethodology for a quadratc q(x, θ), based on a restrcton of the paraeter values, such that the response surface s always postve defnte
2 hus n suary we exane the Bayesan approach for fttng q(x, θ) and then obtanng the factor settng x* for whch q(x, θ) s optzed he basc ethodology was gven by Cheng (4) For copleteness we outlne the ethodology agan here for the case where we ft a quadratc q(x, θ) e then go on to dscuss the ssue of ensurng how to ensure that the ftted regresson s postve defnte, when t s known at the outset that the proble s well-posed so that q(x, θ) can be expected to satsfy ths condton BAYES MEHOD thout loss of generalty, we shall assue that the objectve s to estate the value of x whch nzes q(x, θ) e further assue that we can only perfor a lted nuber of sulated trals but that there s soe pror expert understandng of how the perforance ndex q ght vary as a functon of x e use the specfc exaple frst gven by Cheng (4) to show how the approach works hs allows for a clearer explanaton of the ethods For further dscusson of Bayesan ethodology n sulaton see Cheng (999) and Chck () Our exaple s based on a real engneerng applcaton n whch the a of the odelng was to optze the setup of a pece of coplex equpent so that the te that t took to perfor a gven task was nzed he te taken to perfor the task was therefore taken to be the perforance easure here were 6 factor varable settngs to be set: A, B, C, D, E and F, and we denote ther values by x = (x, x,, x 6 ) he sulaton odel was an accurate odel of the real syste and took soe te to run For our analyss only 7 sulaton runs were ade, each at a dfferent value of the factor settngs he output fro the sulaton runs can be descrbed by y = q(x, θ) + ε, =,,, 7 () where ε s ntally taken to have ean zero wth a constant varance As we wsh to carry out an unrestrcted optzaton, we only requre q to be a good approxaton to the unknown true syste perforance n the regon of ts nu e therefore use a quadratc expresson for q and put q(x, θ) = θ + θ x + θ 3 x + + θ 7 x 6 + θ 8 x + θ 9 x x + + θ 8 x 6 he Bayesan approach treats θ = (θ, θ,, θ 8 ) as beng a rando varable, wth a pror dstrbuton e set the E[θ j ] equal to the best estates of the factor values pror to the sulaton experents, and the standard devaton StdDev[θ j ] s set to a value ndcatve of the confdence that we have n ths estate (3) Bayes' heore allows updatng of the dstrbuton of θ, as we get new data ponts y, usng the forula p(θ y) = K - p(y θ) π(θ) (4) where, assung a contnuous dstrbuton for splcty, ( y θ) π ( θ) dθ K = p (5) s a noralzng constant to ensure that p(θ y) s a proper probablty densty Here p ( θ y) s the posteror dstrbuton of the paraeters θ gven the observed sulaton values y, and p ( y θ) s the lelhood of observng y gven that the paraeters have value θ he an advantage of the Bayesan approach over the classcal ethods of axu lelhood s that t allows the ncorporaton of pror knowledge A further attracton s that t allows ncreental updatng of θ, and hence q(x, θ), as addtonal values of x are obtaned he choce of desgn ponts x, x,, x n at whch to perfor sulatons s a classcal statstcal experental desgn proble he a s to nze the nuber of desgn ponts needed to estate q In our case, we need to estate frst and second order ters of q A classcal non-central coposte desgn (see Cochran & Cox (957) for detals) would use (6-) + *6 + = 45 desgn ponts, where there are 3 ponts to estate the lnear and xed ters of q, and 3 ponts to estate the squared ters hus the upper bound on the nuber of tral runs requred s 45 he nuber of desgn ponts can be reduced f soe of the xed ters are assued to be zero e do not consder desgn aspects further here Bayesan updatng of θ, and hence q(x, θ), can be perfored wth any nuber of data ponts, akng t partcularly attractve n ths exaple, where only 7 data ponts are avalable 3 NUMERICAL EXAMPLE e ntend to nvestgate the propertes of the ethod ore fully ncludng tests on probles where the soluton s known However we lt ourselves n ths paper to the exaple ntroduced n the prevous secton A pror odel for q(x) was specfed as follows e take, as our ntal guess of the nu pont, the values x = (7586, 794, 58, 33, 6, 73) hese were obtaned fro dscusson wth engneers falar wth the syste he xed ters x x j of q(x, θ) were all taken to be zero and the reanng ters of q(x, θ) were selected so
3 that q(x, θ) ncreases by at a dstance + or fro x along any axs hs gave q(x, θ) = 893-5x -56x -6x 3-46x 4-3x 5-6x 6 + x + x +x 3 + x 4 + x 5 + x 6 hs selecton was ade to gve a startng shape for the regresson surface q(x, θ) wth a defnte, but not sharply defned, nu at the pont x ndcated by the engneers he uncertanty about the coeffcents s not so dependent on expert opnon e therefore assue that each coeffcent has a noral dstrbuton, wth standard devaton hs bulds n a far aount of uncertanty about paraeter values he 7 seven sulaton output results (y) are dsplayed n able, wth the correspondng factor settngs (x) he selecton of the desgn ponts was ade n a rather splstc way In the frst run the settngs were selected to be x, the engneers best estates of the optal settngs Subsequent factor settngs were chosen by varyng one paraeter at a te and n a drecton that was thought ght gve an proved perforance able : Results of 7 Sulaton Runs Run A B C D E F Y Only factors C and D could not be vared ndependently, and these were nstead vared sultaneously n runs and 3, n a way that was physcally possble Updatng the odel, usng ths sulaton data, was carred out by calculatng the posteror dstrbuton as gven by Bayes' forula (5) here are any ways of dong the calculaton and any packages exst for dong ths e used the nbugs package avalable on the Internet he updated values of the paraeters are gven n able he updated functon q has a nu of 743 at the pont x* = (7394, 35, 59, 39, 84, 36) here are two ponts to note about ths procedure Frstly, the updatng oved the nu fro x to x* hs shows the nfluence of the observatons n changng our vew of the nu pont Note also that the value of the updated nu s q(x*) = 743 hs s slght proveent copared wth the value at the ntal guess of q(x ) = 755 Secondly, the standard devatons of all the θ coeffcents are reduced hs s reassurng, and suggests that our (6) able : Pror and Posteror Paraeter Dstrbutons Pror Posteror Paraeter Mean Std Dev Mean Std Dev θ[] θ[] θ[3] θ[4] θ[5] θ[6] θ[7] θ[8] θ[9] 84E θ[] θ[] θ[] θ[3] θ[4] θ[5] θ[6] θ[7] θ[8] θ[9] θ[] θ[] θ[] θ[3] θ[4] θ[5] θ[6] θ[7] θ[8] knowledge about the coeffcents has been proved by the nforaton obtaned fro the sulaton data ponts he posteror estate x* depends on x hs dependence wll decrease as we get ore data However, the better our ntal guess, the faster we converge to the true optu 4 POSIIVE DEFINIENESS A weakness of the above ethodology s that there s no guarantee that the posteror dstrbuton of the regresson etaodel wll possess a nu, even f we are confdent that a nu exsts n the true odel e therefore consder a odfcaton of the above procedure where we use a odel for whch the quadratc regresson functon s guaranteed to have a nu e wrte θ as 3 separate paraeters: µ, a and he regresson functon q(x, θ) can then be wrtten as q ( x, θ) = µ + ( x a) ( x a) (7)
4 where s syetrc hs s a slghtly dfferent defnton fro that used n (3) whch used an essentally upper trangular for e now ensure that s postve defnte by defnng the eleents of the atrx to be = δ j p k δ jk, (8) = where δ = k = for p If we assue noral errors, the lelhood of the data, gven the paraeters µ, a and s gven by L ( y θ) σ n n exp [ y µ ( x a) ( x a)] σ = (9) e now have to consder the pror for a and If we consder the as beng the ean and varance of a p- ultvarate noral dstrbuton, then n ths case, convenent prors for a and - would be a noral and a shart dstrbuton: a ~ N ξ p, n ; () ~ shart p ( χ,), () he pror dstrbuton for a s then π ( a ξ, n ) / {det[( n )]} n exp ( a ξ) ( a ξ) whlst the pror for s π ( χ, ) ( χ + p + ) / {det } exp trace{ } () (3) e also need a pror for the other two paraeters µ and σ For µ we have used a noral pror so that π µ µ, τ exp [ µ µ ] (4) τ whlst for σ we have used the Jeffreys reference pror π ( σ ) σ (5) he posteror dstrbuton s proportonal to the product of (9), (), (3), (4) and (5), e π ( a, µ, σ y, x) L( y θ) e also have that and where π ( a ξ, n) π ( χ, ) π ( µ µ, τ ) π ( σ ) E( ) = (6) χ p ( ω ) Var = ( χ p 3)( χ p ) ω = ( ) (7) he hyperparaeters, n, ξ, χ and, µ and τ are set by the user, gven the avalable pror nforaton (see Robert () for ore detal) In our case they are chosen as follows n order to correspond reasonably closely wth the values used n the orgnal forulaton of the proble gven n Secton e let E ( ) = Moreover we set Var ( ) = and because we use a syetrc atrx for rather than an upper trangular for we set Var = / when j hen use of (6) and (7) where p = 6 n our exaple yelds ω = ω = / 48 when j and E = /, agan when j, and χ = Also we set µ = 75 so that the ean corresponded approxately to the pror estate of the optu as gven by the engneers Slarly the value of ξ was taken to be the pror estates of the optu factor values as gven by the engneers o allow for our uncertanty about the pror values we set n = - and τ = 5 e dd not carry out a full Bayesan analyss for ths odel but nstead carred out a nuercal optzaton to dentfy the ode of the posteror dstrbuton π ( a, µ, σ y, x)
5 Mnzaton of logπ ( a, µ, σ y, x) was carred out usng the Nelder-Mead nuercal ethod e dd not attept to alter drectly but nstead, together wth a, µ, and σ, treated the δ n (8) as beng varables n the Nelder-Mead procedure, subject to δ = k = for p he choce of was based on the followng consderaton e need to have suffcent flexblty to allow a free choce of the eleents of Now, as t s syetrc, there are 5p(p+) dstnct eleents n Now we have p(-) dstnct choces for the p δ, as they are subject the restrctons δ = k =, p o retan the sae degree of freedo of choce we therefore need to have p(-) 5p(p+), e (3+p)/ th p = 6 we therefore ust have 5 In the exaple we took = 7 hs gave a nu at x* = â = (83, 86, 53, 53, 76, 9); wth 8 ˆ = wth nu value 754 he value of σ was σ = 545E-8 ndcatng a good ft to the data ponts whch s to be expected he nzed value n ths case was actually stll close to the ntal estate provded by the engneers An nterestng aspect of the odel s that f we had been able to obtan a set of noral devates Z, wth suffcent statstcs z and S, drectly then the posteror dstrbuton for a and s gven drectly by where n ξ + nz a ξ, z, S ~ N p, n n n n + + z, S ~ p ( χ + n, ( z, S) ) nn ( )( ) ( z, S) = + S + z ξ z ξ n + n whch s wrtten n ters of the suffcent statstcs for Z (8) z = z = S ( z = z)( z z) (9) = 5 SUMMARY AND CONCLUSIONS In suary, we have shown how sulaton etaodels can be used to fnd the optal factor settngs for a syste he exaple consdered llustrates how Bayesan ethods can be used n practce when te perts only a few runs of a sulaton odel to be ade, but the nuber of factors to be consdered s large hen the response surface s constraned to be postve defnte, the optu obtaned s slar to that obtaned wthout ths constrant Havng a postve defnte response surface also ensures that a nu does exst Although we have not constructed a full posteror dstrbuton for the data, we have carred out an estate of optal coeffcent values (usng odal estators) whch ncorporates pror knowledge to better nfor the optzaton routne used to fnd the odal estators In the future, we hope to refne ths ethod to fnd the true posteror dstrbuton of the paraeters REFERENCES Azadvar, F 999 Sulaton Optzaton Methodologes In Proceedngs of the 999 nter Sulaton Conference, P A Farrngton, H B Nebhard, D Sturrock, and G Evans, eds, Pscataway, NJ: Insttute of Electroncs and Electrcal Engneers 93- Barton, R R 998 Sulaton Metaodels In Proceedngs of the 998 nter Sulaton Conference, DJ Mederos, EF atson, JS Carson and MS Manvannan, eds, Pscataway, NJ: Insttute of Electroncs and Electrcal Engneers Cheng, R C H 999 Regresson Metaodellng usng Bayesan Methods In Proceedngs of the 999 nter Sulaton Conference, P A Farrngton, H B Nebhard, D Sturrock, and G Evans, eds, Pscataway, NJ: Insttute of Electroncs and Electrcal Engneers Cheng, R C H 4 Optzaton of Systes by Sulaton Metaodellng Methods In Proceedngs of OR Socety Sulaton orkshop 4, S Robnson and S aylor, eds, Brngha: OR Socety Chck, S E Bayesan Methods for Sulaton, In Proceedngs of the nter Sulaton Conference, J A Jones, R R Barton, K Kang, and P A Fshwck, eds, IEEE, Pscataway, NJ 9-8 Cochran, G and Cox, G M 957 Experental Desgns, nd Ed, New York: John ley Fu, M C, S Andradottr, JS Carson, F Glover, CR Harrel, Y-C Ho, JP Kelly and SM Robnson Integratng Optzaton and Sulaton: Research and Practce In Proceedngs of the nter Sulaton Conference, J A Jones, R R Barton, K Kang, and P A Fshwck, eds, Pscataway, NJ: Insttute of Electroncs and Electrcal Engneers 6-66
6 Glover, F, JP Kelly and M Laguna 999 New advances for weddng optzaton and sulaton In Proceedngs of the 999 nter Sulaton Conference, P A Farrngton, H B Nebhard, D Sturrock, and G Evans, eds, Pscataway, NJ: Insttute of Electroncs and Electrcal Engneers 55-6 Gonda, H, HG Neddereer, J Gerrt, GJ van Oortarssen, N Persa and RA Dekker Fraework for Response Surface Methodology for Sulaton Optzaton In Proceedngs of the nter Sulaton Conference, J A Jones, R R Barton, K Kang, and P A Fshwck, eds, Pscataway, NJ: Insttute of Electroncs and Electrcal Engneers 9-36 Hood, S J and PD elch 993 Response surface ethodology and ts applcaton n sulaton In Proceedngs of the 993 nter Sulaton Conference, G Evans, M Mollaghase, EC Russell, and E Bles, eds, Pscataway, NJ: Insttute of Electroncs and Electrcal Engneers 5 Kelton, D 999 Desgnng Sulaton Experents In Proceedngs of the 999 nter Sulaton Conference, P A Farrngton, H B Nebhard, D Sturrock, and G Evans, eds, Pscataway, NJ: Insttute of Electroncs and Electrcal Engneers Law, A M and MG McCoas Sulaton-Based Optzaton In Proceedngs of the nter Sulaton Conference, J A Jones, R R Barton, K Kang, and P A Fshwck, eds, Pscataway, NJ: Insttute of Electroncs and Electrcal Engneers Robert, C he Bayesan Choce: fro Decson- heoretc Motvatons to Coputatonal Ipleentaton New York: Sprnger-Verlag Swsher, J R, SH Jacobson, PD Hyden and L Schruben A Survey of sulaton optzaton technques and procedures In Proceedngs of the nter Sulaton Conference, J A Jones, R R Barton, K Kang, and P A Fshwck, eds, Pscataway, NJ: Insttute of Electroncs and Electrcal Engneers 9-8 CHRISINE CURRIE s a PhD student at the Unversty of Southapton She has an MPhys fro Oxford Unversty and an MSc n Operatonal Research fro the Unversty of Southapton Her research nterests nclude atheatcal odelng of epdecs, Bayesan statstcs and varance reducton ethods Her eal address s: <CSMCurre@athssotonacuk> AUHOR BIOGRAPHIES RUSSELL CH CHENG s Professor, Head of Operatonal Research, and Deputy Dean of the Faculty of Matheatcal Studes at the Unversty of Southapton He has an MA and the Dploa n Matheatcal Statstcs fro Cabrdge Unversty, England He obtaned hs PhD fro Bath Unversty He s a forer Charan of the UK Sulaton Socety, a Fellow of the Royal Statstcal Socety, Meber of the Operatonal Research Socety Hs research nterests nclude: varance reducton ethods and paraetrc estaton ethods He was a Jont Edtor of the IMA Journal of Manageent Matheatcs Hs eal and web addresses are RCHCheng@athssotonacuk and <www athssotonacuk/staff/cheng>
Excess Error, Approximation Error, and Estimation Error
E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple
More informationBAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup
BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS Darusz Bskup 1. Introducton The paper presents a nonparaetrc procedure for estaton of an unknown functon f n the regresson odel y = f x + ε = N. (1) (
More informationXII.3 The EM (Expectation-Maximization) Algorithm
XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationPROBABILITY AND STATISTICS Vol. III - Analysis of Variance and Analysis of Covariance - V. Nollau ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE
ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE V. Nollau Insttute of Matheatcal Stochastcs, Techncal Unversty of Dresden, Gerany Keywords: Analyss of varance, least squares ethod, odels wth fxed effects,
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng
More informationANALYSIS OF SIMULATION EXPERIMENTS BY BOOTSTRAP RESAMPLING. Russell C.H. Cheng
Proceedngs of the 00 Wnter Sulaton Conference B. A. Peters, J. S. Sth, D. J. Mederos, and M. W. Rohrer, eds. ANALYSIS OF SIMULATION EXPERIMENTS BY BOOTSTRAP RESAMPLING Russell C.H. Cheng Departent of Matheatcs
More informationFermi-Dirac statistics
UCC/Physcs/MK/EM/October 8, 205 Fer-Drac statstcs Fer-Drac dstrbuton Matter partcles that are eleentary ostly have a type of angular oentu called spn. hese partcles are known to have a agnetc oent whch
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng
More informationCHAPTER 6 CONSTRAINED OPTIMIZATION 1: K-T CONDITIONS
Chapter 6: Constraned Optzaton CHAPER 6 CONSRAINED OPIMIZAION : K- CONDIIONS Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based
More informationWhat is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.
(C) 998 Gerald B Sheblé, all rghts reserved Lnear Prograng Introducton Contents I. What s LP? II. LP Theor III. The Splex Method IV. Refneents to the Splex Method What s LP? LP s an optzaton technque that
More informationCHAPTER 7 CONSTRAINED OPTIMIZATION 1: THE KARUSH-KUHN-TUCKER CONDITIONS
CHAPER 7 CONSRAINED OPIMIZAION : HE KARUSH-KUHN-UCKER CONDIIONS 7. Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based unconstraned
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationAN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU
AN ANALYI OF A FRACTAL KINETIC CURE OF AAGEAU by John Maloney and Jack Hedel Departent of Matheatcs Unversty of Nebraska at Oaha Oaha, Nebraska 688 Eal addresses: aloney@unoaha.edu, jhedel@unoaha.edu Runnng
More informationPsychology 282 Lecture #24 Outline Regression Diagnostics: Outliers
Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.
More informationComputational and Statistical Learning theory Assignment 4
Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}
More informationFall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede. ) with a symmetric Pcovariance matrix of the y( x ) measurements V
Fall Analyss o Experental Measureents B Esensten/rev S Errede General Least Squares wth General Constrants: Suppose we have easureents y( x ( y( x, y( x,, y( x wth a syetrc covarance atrx o the y( x easureents
More informationLECTURE :FACTOR ANALYSIS
LCUR :FACOR ANALYSIS Rta Osadchy Based on Lecture Notes by A. Ng Motvaton Dstrbuton coes fro MoG Have suffcent aount of data: >>n denson Use M to ft Mture of Gaussans nu. of tranng ponts If
More informationXiangwen Li. March 8th and March 13th, 2001
CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an
More informationSolutions for Homework #9
Solutons for Hoewor #9 PROBEM. (P. 3 on page 379 n the note) Consder a sprng ounted rgd bar of total ass and length, to whch an addtonal ass s luped at the rghtost end. he syste has no dapng. Fnd the natural
More informationDenote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form
SET OF METHODS FO SOUTION THE AUHY POBEM FO STIFF SYSTEMS OF ODINAY DIFFEENTIA EUATIONS AF atypov and YuV Nulchev Insttute of Theoretcal and Appled Mechancs SB AS 639 Novosbrs ussa Introducton A constructon
More information1 Definition of Rademacher Complexity
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #9 Scrbe: Josh Chen March 5, 2013 We ve spent the past few classes provng bounds on the generalzaton error of PAClearnng algorths for the
More informationOutline. Prior Information and Subjective Probability. Subjective Probability. The Histogram Approach. Subjective Determination of the Prior Density
Outlne Pror Inforaton and Subjectve Probablty u89603 1 Subjectve Probablty Subjectve Deternaton of the Pror Densty Nonnforatve Prors Maxu Entropy Prors Usng the Margnal Dstrbuton to Deterne the Pror Herarchcal
More informationON WEIGHTED ESTIMATION IN LINEAR REGRESSION IN THE PRESENCE OF PARAMETER UNCERTAINTY
Econoetrcs orkng Paper EP7 ISSN 485-644 Departent of Econocs ON EIGTED ESTIMATION IN LINEAR REGRESSION IN TE PRESENCE OF PARAMETER UNCERTAINTY udth A Clarke Departent of Econocs, Unversty of Vctora Vctora,
More informationPreference and Demand Examples
Dvson of the Huantes and Socal Scences Preference and Deand Exaples KC Border October, 2002 Revsed Noveber 206 These notes show how to use the Lagrange Karush Kuhn Tucker ultpler theores to solve the proble
More informationOur focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.
SSTEM MODELLIN In order to solve a control syste proble, the descrptons of the syste and ts coponents ust be put nto a for sutable for analyss and evaluaton. The followng ethods can be used to odel physcal
More informationQuantum Particle Motion in Physical Space
Adv. Studes Theor. Phys., Vol. 8, 014, no. 1, 7-34 HIKARI Ltd, www.-hkar.co http://dx.do.org/10.1988/astp.014.311136 Quantu Partcle Moton n Physcal Space A. Yu. Saarn Dept. of Physcs, Saara State Techncal
More informationDescription of the Force Method Procedure. Indeterminate Analysis Force Method 1. Force Method con t. Force Method con t
Indeternate Analyss Force Method The force (flexblty) ethod expresses the relatonshps between dsplaceents and forces that exst n a structure. Prary objectve of the force ethod s to deterne the chosen set
More informationPolynomial Regression Models
LINEAR REGRESSION ANALYSIS MODULE XII Lecture - 6 Polynomal Regresson Models Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Test of sgnfcance To test the sgnfcance
More information1.3 Hence, calculate a formula for the force required to break the bond (i.e. the maximum value of F)
EN40: Dynacs and Vbratons Hoework 4: Work, Energy and Lnear Moentu Due Frday March 6 th School of Engneerng Brown Unversty 1. The Rydberg potental s a sple odel of atoc nteractons. It specfes the potental
More informationSeveral generation methods of multinomial distributed random number Tian Lei 1, a,linxihe 1,b,Zhigang Zhang 1,c
Internatonal Conference on Appled Scence and Engneerng Innovaton (ASEI 205) Several generaton ethods of ultnoal dstrbuted rando nuber Tan Le, a,lnhe,b,zhgang Zhang,c School of Matheatcs and Physcs, USTB,
More informationMultipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18
Multpont Analyss for Sblng ars Bostatstcs 666 Lecture 8 revously Lnkage analyss wth pars of ndvduals Non-paraetrc BS Methods Maxu Lkelhood BD Based Method ossble Trangle Constrant AS Methods Covered So
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationThe Parity of the Number of Irreducible Factors for Some Pentanomials
The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,
More informationCS 2750 Machine Learning. Lecture 5. Density estimation. CS 2750 Machine Learning. Announcements
CS 750 Machne Learnng Lecture 5 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 539 Sennott Square CS 750 Machne Learnng Announcements Homework Due on Wednesday before the class Reports: hand n before
More informationIntroducing Entropy Distributions
Graubner, Schdt & Proske: Proceedngs of the 6 th Internatonal Probablstc Workshop, Darstadt 8 Introducng Entropy Dstrbutons Noel van Erp & Peter van Gelder Structural Hydraulc Engneerng and Probablstc
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationReliability estimation in Pareto-I distribution based on progressively type II censored sample with binomial removals
Journal of Scentfc esearch Developent (): 08-3 05 Avalable onlne at wwwjsradorg ISSN 5-7569 05 JSAD elablty estaton n Pareto-I dstrbuton based on progressvely type II censored saple wth bnoal reovals Ilhan
More informationOn Pfaff s solution of the Pfaff problem
Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationBy M. O'Neill,* I. G. Sinclairf and Francis J. Smith
52 Polynoal curve fttng when abscssas and ordnates are both subject to error By M. O'Nell,* I. G. Snclarf and Francs J. Sth Departents of Coputer Scence and Appled Matheatcs, School of Physcs and Appled
More informationCOS 511: Theoretical Machine Learning
COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that
More informationSlobodan Lakić. Communicated by R. Van Keer
Serdca Math. J. 21 (1995), 335-344 AN ITERATIVE METHOD FOR THE MATRIX PRINCIPAL n-th ROOT Slobodan Lakć Councated by R. Van Keer In ths paper we gve an teratve ethod to copute the prncpal n-th root and
More informationCOMP th April, 2007 Clement Pang
COMP 540 12 th Aprl, 2007 Cleent Pang Boostng Cobnng weak classers Fts an Addtve Model Is essentally Forward Stagewse Addtve Modelng wth Exponental Loss Loss Functons Classcaton: Msclasscaton, Exponental,
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models
More informationy new = M x old Feature Selection: Linear Transformations Constraint Optimization (insertion)
Feature Selecton: Lnear ransforatons new = M x old Constrant Optzaton (nserton) 3 Proble: Gven an objectve functon f(x) to be optzed and let constrants be gven b h k (x)=c k, ovng constants to the left,
More information1 Review From Last Time
COS 5: Foundatons of Machne Learnng Rob Schapre Lecture #8 Scrbe: Monrul I Sharf Aprl 0, 2003 Revew Fro Last Te Last te, we were talkng about how to odel dstrbutons, and we had ths setup: Gven - exaples
More informationCHAPT II : Prob-stats, estimation
CHAPT II : Prob-stats, estaton Randoness, probablty Probablty densty functons and cuulatve densty functons. Jont, argnal and condtonal dstrbutons. The Bayes forula. Saplng and statstcs Descrptve and nferental
More informationOn the number of regions in an m-dimensional space cut by n hyperplanes
6 On the nuber of regons n an -densonal space cut by n hyperplanes Chungwu Ho and Seth Zeran Abstract In ths note we provde a unfor approach for the nuber of bounded regons cut by n hyperplanes n general
More informationITERATIVE ESTIMATION PROCEDURE FOR GEOSTATISTICAL REGRESSION AND GEOSTATISTICAL KRIGING
ESE 5 ITERATIVE ESTIMATION PROCEDURE FOR GEOSTATISTICAL REGRESSION AND GEOSTATISTICAL KRIGING Gven a geostatstcal regresson odel: k Y () s x () s () s x () s () s, s R wth () unknown () E[ ( s)], s R ()
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationDetermination of the Confidence Level of PSD Estimation with Given D.O.F. Based on WELCH Algorithm
Internatonal Conference on Inforaton Technology and Manageent Innovaton (ICITMI 05) Deternaton of the Confdence Level of PSD Estaton wth Gven D.O.F. Based on WELCH Algorth Xue-wang Zhu, *, S-jan Zhang
More informationStatistical analysis of Accelerated life testing under Weibull distribution based on fuzzy theory
Statstcal analyss of Accelerated lfe testng under Webull dstrbuton based on fuzzy theory Han Xu, Scence & Technology on Relablty & Envronental Engneerng Laboratory, School of Relablty and Syste Engneerng,
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationCentroid Uncertainty Bounds for Interval Type-2 Fuzzy Sets: Forward and Inverse Problems
Centrod Uncertanty Bounds for Interval Type-2 Fuzzy Sets: Forward and Inverse Probles Jerry M. Mendel and Hongwe Wu Sgnal and Iage Processng Insttute Departent of Electrcal Engneerng Unversty of Southern
More informationElastic Collisions. Definition: two point masses on which no external forces act collide without losing any energy.
Elastc Collsons Defnton: to pont asses on hch no external forces act collde thout losng any energy v Prerequstes: θ θ collsons n one denson conservaton of oentu and energy occurs frequently n everyday
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationChapter 2 - The Simple Linear Regression Model S =0. e i is a random error. S β2 β. This is a minimization problem. Solution is a calculus exercise.
Chapter - The Smple Lnear Regresson Model The lnear regresson equaton s: where y + = β + β e for =,..., y and are observable varables e s a random error How can an estmaton rule be constructed for the
More informationFeb 14: Spatial analysis of data fields
Feb 4: Spatal analyss of data felds Mappng rregularly sampled data onto a regular grd Many analyss technques for geophyscal data requre the data be located at regular ntervals n space and/or tme. hs s
More informationChapter 12 Lyes KADEM [Thermodynamics II] 2007
Chapter 2 Lyes KDEM [Therodynacs II] 2007 Gas Mxtures In ths chapter we wll develop ethods for deternng therodynac propertes of a xture n order to apply the frst law to systes nvolvng xtures. Ths wll be
More information1. Statement of the problem
Volue 14, 010 15 ON THE ITERATIVE SOUTION OF A SYSTEM OF DISCRETE TIMOSHENKO EQUATIONS Peradze J. and Tsklaur Z. I. Javakhshvl Tbls State Uversty,, Uversty St., Tbls 0186, Georga Georgan Techcal Uversty,
More informationFinite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003
Fnte Vector Space epresentatons oss Bannster Data Asslaton esearch Centre, eadng, UK ast updated: 2nd August 2003 Contents What s a lnear vector space?......... 1 About ths docuent............ 2 1. Orthogonal
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Experment-I MODULE VII LECTURE - 3 ANALYSIS OF COVARIANCE Dr Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Any scentfc experment s performed
More informationVERIFICATION OF FE MODELS FOR MODEL UPDATING
VERIFICATION OF FE MODELS FOR MODEL UPDATING G. Chen and D. J. Ewns Dynacs Secton, Mechancal Engneerng Departent Iperal College of Scence, Technology and Medcne London SW7 AZ, Unted Kngdo Eal: g.chen@c.ac.uk
More informationx i1 =1 for all i (the constant ).
Chapter 5 The Multple Regresson Model Consder an economc model where the dependent varable s a functon of K explanatory varables. The economc model has the form: y = f ( x,x,..., ) xk Approxmate ths by
More informationRevision: December 13, E Main Suite D Pullman, WA (509) Voice and Fax
.9.1: AC power analyss Reson: Deceber 13, 010 15 E Man Sute D Pullan, WA 99163 (509 334 6306 Voce and Fax Oerew n chapter.9.0, we ntroduced soe basc quanttes relate to delery of power usng snusodal sgnals.
More informationSee Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)
Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes
More informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
More informationSTAT 3008 Applied Regression Analysis
STAT 3008 Appled Regresson Analyss Tutoral : Smple Lnear Regresson LAI Chun He Department of Statstcs, The Chnese Unversty of Hong Kong 1 Model Assumpton To quantfy the relatonshp between two factors,
More informationComparative Analysis of Bradley-Terry and Thurstone-Mosteller Paired Comparison Models for Image Quality Assessment
Coparatve Analyss of Bradley-Terry and Thurstone-Mosteller Pared Coparson Models for Iage Qualty Assessent John C. Handley Xerox Corporaton Dgtal Iagng Technology Center 8 Phllps Road, MS 85E Webster,
More informationThe Non-equidistant New Information Optimizing MGM(1,n) Based on a Step by Step Optimum Constructing Background Value
Appl. Math. Inf. Sc. 6 No. 3 745-750 (0) 745 Appled Matheatcs & Inforaton Scences An Internatonal Journal The Non-equdstant New Inforaton Optzng MGM(n) Based on a Step by Step Optu Constructng Background
More information4 Column generation (CG) 4.1 Basics of column generation. 4.2 Applying CG to the Cutting-Stock Problem. Basic Idea of column generation
4 Colun generaton (CG) here are a lot of probles n nteger prograng where even the proble defnton cannot be effcently bounded Specfcally, the nuber of coluns becoes very large herefore, these probles are
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationFall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede
Fall 0 Analyss of Expermental easurements B. Esensten/rev. S. Errede We now reformulate the lnear Least Squares ethod n more general terms, sutable for (eventually extendng to the non-lnear case, and also
More informationThe Impact of the Earth s Movement through the Space on Measuring the Velocity of Light
Journal of Appled Matheatcs and Physcs, 6, 4, 68-78 Publshed Onlne June 6 n ScRes http://wwwscrporg/journal/jap http://dxdoorg/436/jap646 The Ipact of the Earth s Moeent through the Space on Measurng the
More informationhalftoning Journal of Electronic Imaging, vol. 11, no. 4, Oct Je-Ho Lee and Jan P. Allebach
olorant-based drect bnary search» halftonng Journal of Electronc Iagng, vol., no. 4, Oct. 22 Je-Ho Lee and Jan P. Allebach School of Electrcal Engneerng & oputer Scence Kyungpook Natonal Unversty Abstract
More informationEcon107 Applied Econometrics Topic 9: Heteroskedasticity (Studenmund, Chapter 10)
I. Defnton and Problems Econ7 Appled Econometrcs Topc 9: Heteroskedastcty (Studenmund, Chapter ) We now relax another classcal assumpton. Ths s a problem that arses often wth cross sectons of ndvduals,
More informationDesigning Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate
The Frst Internatonal Senar on Scence and Technology, Islac Unversty of Indonesa, 4-5 January 009. Desgnng Fuzzy Te Seres odel Usng Generalzed Wang s ethod and Its applcaton to Forecastng Interest Rate
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More information, are assumed to fluctuate around zero, with E( i) 0. Now imagine that this overall random effect, , is composed of many independent factors,
Part II. Contnuous Spatal Data Analyss 3. Spatally-Dependent Rando Effects Observe that all regressons n the llustratons above [startng wth expresson (..3) n the Sudan ranfall exaple] have reled on an
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informatione i is a random error
Chapter - The Smple Lnear Regresson Model The lnear regresson equaton s: where + β + β e for,..., and are observable varables e s a random error How can an estmaton rule be constructed for the unknown
More informationSolving Fuzzy Linear Programming Problem With Fuzzy Relational Equation Constraint
Intern. J. Fuzz Maeatcal Archve Vol., 0, -0 ISSN: 0 (P, 0 0 (onlne Publshed on 0 Septeber 0 www.researchasc.org Internatonal Journal of Solvng Fuzz Lnear Prograng Proble W Fuzz Relatonal Equaton Constrant
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationStatistics II Final Exam 26/6/18
Statstcs II Fnal Exam 26/6/18 Academc Year 2017/18 Solutons Exam duraton: 2 h 30 mn 1. (3 ponts) A town hall s conductng a study to determne the amount of leftover food produced by the restaurants n the
More informationModified parallel multisplitting iterative methods for non-hermitian positive definite systems
Adv Coput ath DOI 0.007/s0444-0-9262-8 odfed parallel ultsplttng teratve ethods for non-hertan postve defnte systes Chuan-Long Wang Guo-Yan eng Xue-Rong Yong Receved: Septeber 20 / Accepted: 4 Noveber
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationPGM Learning Tasks and Metrics
Probablstc Graphcal odels Learnng Overvew PG Learnng Tasks and etrcs Learnng doan epert True dstrbuton P* aybe correspondng to a PG * dataset of nstances D{d],...d]} sapled fro P* elctaton Network Learnng
More informationCollaborative Filtering Recommendation Algorithm
Vol.141 (GST 2016), pp.199-203 http://dx.do.org/10.14257/astl.2016.141.43 Collaboratve Flterng Recoendaton Algorth Dong Lang Qongta Teachers College, Haou 570100, Chna, 18689851015@163.co Abstract. Ths
More informationIntegral Transforms and Dual Integral Equations to Solve Heat Equation with Mixed Conditions
Int J Open Probles Copt Math, Vol 7, No 4, Deceber 214 ISSN 1998-6262; Copyrght ICSS Publcaton, 214 www-csrsorg Integral Transfors and Dual Integral Equatons to Solve Heat Equaton wth Mxed Condtons Naser
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More information8/25/17. Data Modeling. Data Modeling. Data Modeling. Patrice Koehl Department of Biological Sciences National University of Singapore
8/5/17 Data Modelng Patrce Koehl Department of Bologcal Scences atonal Unversty of Sngapore http://www.cs.ucdavs.edu/~koehl/teachng/bl59 koehl@cs.ucdavs.edu Data Modelng Ø Data Modelng: least squares Ø
More informationStatistics for Economics & Business
Statstcs for Economcs & Busness Smple Lnear Regresson Learnng Objectves In ths chapter, you learn: How to use regresson analyss to predct the value of a dependent varable based on an ndependent varable
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationOn the Eigenspectrum of the Gram Matrix and the Generalisation Error of Kernel PCA (Shawe-Taylor, et al. 2005) Ameet Talwalkar 02/13/07
On the Egenspectru of the Gra Matr and the Generalsaton Error of Kernel PCA Shawe-aylor, et al. 005 Aeet alwalar 0/3/07 Outlne Bacground Motvaton PCA, MDS Isoap Kernel PCA Generalsaton Error of Kernel
More informationPHYS 450 Spring semester Lecture 02: Dealing with Experimental Uncertainties. Ron Reifenberger Birck Nanotechnology Center Purdue University
PHYS 45 Sprng semester 7 Lecture : Dealng wth Expermental Uncertantes Ron Refenberger Brck anotechnology Center Purdue Unversty Lecture Introductory Comments Expermental errors (really expermental uncertantes)
More information