Principal Component Analysis (PCA)
|
|
- Rudolf Randall
- 5 years ago
- Views:
Transcription
1 BBM0 - Itroduc0o to ML Sprg 0 Prcpa Compoet Aayss PCA Mo0va0o PCA agorthms Appca0os PCA shortcomgs ere PCA oday Ayut Erdem Dept. of Computer Egeerg HaceDepe Uversty Sdes adopted from Barabás Póczos ar Boosh om Mtche Ro Parr Rta Osadchy Mo0va0o PCA agorthms Appca0os PCA Shortcomgs ere PCA oday Data Vsuaza0o Data Compresso Nose Reduc0o Learg Aomay detec0o PCA Appca0os 3 3
2 Eampe: Data Vsuaza0o Gve 53 bood ad ure sampes features from 5 peope. How ca we vsuaze the measuremets? Istaces Data Vsuaza0o Matr format 553 H-WBC H-RBC H-Hgb H-Hct H-MCV H-MCH H-MCHC A A A A A A A A A Features 5 5 Dffcut to see the correatos betwee the features... Data Vsuaza0o Data Vsuaza0o Spectra format 5 curves oe for each perso Measuremet measuremet 50 0 Dffcut to compare the dfferet patets... Vaue 7 7 Spectra format 53 pctures oe for each feature H-Bads Perso Dffcut to see the correatos betwee the features...
3 Data Vsuaza0o Data Vsuaza0o C-LDH B-varate C-rgycerdes M-EPI C-LDH r-varate C-rgycerdes Is there a represeta0o beder tha the coordate aes? Is t reay ecessary to show a the 53 dmesos? -... what f there are strog correa0os betwee the features? How coud we fd the smaest subspace of the 53- D space that eeps the most formado about the orga data? How ca we vsuaze the other varabes??? dffcut to see or hgher dmesoa spaces A sou0o: Prcpa Compoet Aayss oday Prcpa Compoet Aayss Mo0va0o PCA agorthms Appca0os PCA Shortcomgs ere PCA PCA: Orthogoa proec0o of the of data the data oto a oto ow a ower- dmeso ear space that... mamzes varace of proected data purpe e mmzes mea squared dstace betwee - data pot ad - proec0os sum of bue es
4 Prcpa Compoet Aayss Idea: Gve data pots a d- dmesoa space proect them to a ower dmesoa space whe preservg as much forma0o as possbe. - Fd best paar approma0o to 3D data - Fd best - D approma0o to 0 - D data I par0cuar choose proec0o that mmzes squared error recostruc0g the orga data. Prcpa Compoet Aayss PCA Vectors orgate from the ceter of mass. Prcpa compoet #: pots the drec0o of the argest varace. Each subsequet prcpa compoet - s orthogoa to the prevous oes ad - pots the drec0os of the argest varace of the resdua subspace 3 3 D Gaussa dataset st PCA as 5 5
5 d PCA as PCA agorthm I seque0a Gve the cetered data { m } compute the prcpa vectors: arg ma m w { w } w m st PCA vector We mamze the varace of proecto of w m arg ma {[ w ww ] } w m w PCA recostructo th PCA vector We mamze the varace of the proecto the resdua subspace - w w w w 7 7 w PCA agorthm I seque0a Gve w w - we cacuate w prcpa vector as before: Mamze the varace of proecto of arg ma m w m {[ w w w ] } th PCA vector PCA recostructo PCA agorthm II sampe covarace matr Gve data { m } compute covarace matr m m where m m We mamze the varace of the proecto the resdua subspace w w w w PCA bass vectors the egevectors of w w w w w +w w 9 9 Larger egevaue more mportat egevectors 0 9 0
6 PCA agorthm II sampe covarace matr PCA agorthmx : top egevaues/egevectors % X N m data matr % each data pot coum vector..m m m X subtract mea from each coum vector X X X covarace matr of X { u }..N egevectors/egevaues of N PCA agorthm III SVD SVD of of the the data matr Sguar Vaue Decomposto of the cetered data matr X. X features sampes USV X U S sgfcat ose V sg. sgfcat ose ose Retur { u }.. % top PCA compoets sampes 3 PCA agorthm III oday Coums of U the prcpa vectors { u u } orthogoa ad has ut orm so U U I Ca recostruct the data usg ear combatos of { u u } Matr S Dagoa Shows mportace of each egevector Mo0va0o PCA agorthms Appca0os PCA Shortcomgs ere PCA Coums of V he coeffcets for recostructg the sampes 3 3
7 Mo0va0o PCA agorthms Appca0os - Face Recog0o - Image Compresso - Nose Fterg PCA Shortcomgs ere PCA oday Face Recog0o Wat to de0fy specfc perso based o faca mage Robust to gasses gh0g - Ca t ust use the gve 5 5 pes 5 5 Appyg PCA: Egefaces Computa0oa Compety Method A: Bud a PCA subspace for each perso ad chec whch subspace ca recostruct the test mage the best Method B: Bud oe PCA database for the whoe dataset ad the cassfy based o the weghts. X m 5 5 rea vaues Eampe data set: Images of faces Famous Egeface approach [ur & Petad] [Srovch & rby] Each face s 5 5 vaues umace at ocato 5 5 vew as dm vector Form X [ m ] cetered data mt Compute XX Suppose m staces each of sze N Egefaces: m500 faces each of sze N Gve N N covarace matr ca compute a N egevectors/egevaues ON 3 frst egevectors/egevaues O N But f N EXPENSIVE m faces Probem: s HUGE 7 7 7
8 A Cever Woraroud Prcpe Compoets Method B Note that m<< Use LX X stead of XX If v s egevector of L the Xv s egevector of Proof: L v v X X v v X X X v X v Xv XX X v Xv Xv Xv X m m faces 5 5 rea vaues Prcpe Compoets Method B Shortcomgs Requres carefuy cotroed data: - A faces cetered frame - Same sze - Some ses0vty to age faster f tra wth - oy peope w/out gasses - same gh0g cod0os Method s competey owedge free - some0mes ths s good - Does t ow that faces are wrapped aroud 3D obects heads - Maes o effort to preserve cass ds0c0os
9 Happess subspace method A Dsgust subspace method A Faca Epresso Recog0o Moves 3 Faca Epresso Recog0o Moves
10 Faca Epresso Recog0o Moves Mo0va0o PCA agorthms Appca0os - Face Recog0o - Image Compresso - Nose Fterg PCA Shortcomgs ere PCA oday Orga Image L error ad PCA dm de the orga 379 mage to patches: Dvde the orga 379 mage to patches: - Each patch s a stace Vew each as a - D vector
11 PCA compresso: D > 0D PCA compresso: D > D most mportat egevectors PCA compresso: D > D PCA compresso: D D
12 most mportat egevectors PCA compresso: D > 3D most mportat egevectors PCA compresso: D > D
13 0 most mportat egevectors D Dscrete Cose Bass Loos e the dscrete cose bases of JPG Mo0va0o PCA agorthms Appca0os - Face Recog0o - Image Compresso - Nose Fterg PCA Shortcomgs ere PCA oday Nose Fterg U
14 Nosy mage Deosed mage usg 5 PCA compoets oday Probema0c Data Set for PCA Mo0va0o PCA agorthms Appca0os PCA Shortcomgs ere PCA PCA does t ow abes
15 PCA vs. Fsher Lear Dscrmat Probema0c Data Set for PCA PCA caot capture NON- LINEAR structure PCA mamzes varace depedet of cass mageta FLD attempts to separate casses gree e PCA Cocusos PCA - Fds orthoorma bass for data - Sorts dmesos order of mportace - Dscard ow sgfcace dmesos Uses: - Get compact descrp0o - Igore ose - Improve cassfca0o hopefuy Not magc: - Does t ow cass abes - Ca oy capture ear vara0os Mo0va0o PCA agorthms Appca0os PCA Shortcomgs ere PCA oday Oe of may trcs to reduce dmesoaty
16 Dmesoaty Reduc0o he magc of hgh dmesos Data represeta0o - Iputs are rea- vaued vectors a hgh dmesoa space. Lear structure - Does the date ve a ow dmesoa subspace? Noear structure - Does the data ve o a ow dmesoa submafod? PCA Gve some probem how do we ow what casses of fuc0os are capabe of sovg that probem? VC Vap- Chervoes theory tes us that oqe mappgs whch tae us to a hgher dmesoa space tha the dmeso of the put space provde us wth greater cassfca0o power. Eampe R Eampe: Hgh- Dmesoa Mappg hese casses are eary separabe the put space. We ca mae the probem eary separabe by a smpe mappg Φ : R a + R 3 3 3
17 ere rc Popuar eres Hgh- dmesoa mappg ca serousy crease computa0o 0me. Ca we get aroud ths probem ad s0 get the beeft of hgh- D? Yes ere rc rc Gve ay agorthm that ca be epressed soey terms of dot products ths trc aows us to costruct dfferet oear versos of t. 5 5 ere Prcpe Compoet Aayss PCA Eteds cove0oa prcpa compoet aayss PCA to a hgh dmesoa feature space usg the ere trc. Ca etract up to umber of sampes oear prcpa compoets wthout epesve computa0os. Mag PCA No- Lear Suppose that stead of usg thepots we woud frst map them to some oear feature space - E.g. usg poar coordates stead of cartesa coordates woud hep us dea wth the crce. Etract prcpa compoet that space PCA he resut w be o- ear the orga data space 7 7
18 Derva0o Suppose that the mea of the data the feature space s Covarace: Egevectors µ 0 C Cv λv Derva0o cot d. Egevectors ca be epressed as ear comba0o of features: Proof: thus Cv v λv v v v v λ λ Showg that v v Showg that v v
19 Derva0o cot d. So from before we had ths meas that a sou0os v wth λ 0 e the spa of...e. Fdg the egevectors s equvaet to fdg the coeffcets 73 from before we had v v v λ λ ust a scaar v 73 Derva0o cot d. By subs0tu0g ths bac to the equa0o we get: We ca rewrte t as Mu0pe ths by from the eq: 7 λ λ λ 7 Derva0o cot d. By puggg the ere ad rearragg we get: We ca remove a factor of from both sdes of the matr ths w oy affects the egevectors wth zero egevaue whch w ot be a prcpe compoet ayway: We have a ormaza0o cod0o for vectors: 75 λ λ v v 75 Derva0o cot d. By mu0pyg λ by ad usg the ormaza0o cod0o we get: For a ew pot ts proec0o oto the prcpa compoets s: 7 λ v 7
20 Normazg the feature space I geera may ot be zero mea. Cetered features: he correspodg ere s: 77 ~ + ~ ~ ~ 77 Normazg the feature space cot d. I a matr form where s a matr wth a eemets /. 7 + ~ / / / - ~ + / 7 Summary of ere PCA Pc a ere Costruct the ormazed ere matr of the data dmeso m m: Sove a egevaue probem: For ay data pot ew or od we ca represet t as 79 / / / - ~ + vaue probem: / / / - + ~ λ d y.. 79 Iput pots before ere PCA 0 0
21 Output aqer ere PCA Eampe: De- osg mages he three groups are dstgushabe usg the frst compoet oy Proper0es of PCA ere PCA ca gve a good re- ecodg of the data whe t es aog a o- ear mafod. he ere matr s so ere PCA w have dffcu0es f we have ots of data pots. 3 3
Principal Component Analysis (PCA)
BBM406 - Itroduc0o to ML Sprg 204 Prcpal Compoet Aalyss PCA Aykut Erdem Dept. of Computer Egeerg HaceDepe Uversty Today Mo0va0o PCA algorthms Applca0os PCA shortcomgs Kerel PCA Sldes adopted from Barabás
More informationFace Recognition. Face Recognition. Why is Face Recognition. Automated Face Recognition Difficult? Why is it Difficult?
Face Recogto Face Recogto If I ook at your face I mmedatey recogze that I have see t before Yet there s o mache whch, wth that speed, ca take a pcture of a face ad say eve that t s a ma; ad much ess that
More informationBlack or White Video. Lecture 3: Face Detection. Face Detection. Why is Face Detection Difficult? Automated Face Detection Why is it Difficult?
Back or Whte Veo ecture : Face Detecto Reag: Egeaces oe paper FP pgs 55-5 Haouts: Course Descrpto P Assge Face Detecto Face ocazato egmetato Face rackg Faca eatures ocazato Faca eatures trackg orphg wwwyoutubecom/watch?vzi9oyrwq
More informationComputational learning and discovery
Computatoa earg ad dscover CSI 873 / MAH 689 Istructor: I. Grva Wedesda 7:2-1 pm Gve a set of trag data 1 1 )... ) { 1 1} fd a fucto that ca estmate { 1 1} gve ew ad mmze the frequec of the future error.
More informationLecture 24: Principal Component Analysis. Aykut Erdem May 2016 Hacettepe University
Lecture 4: Principal Component Analysis Aykut Erdem May 016 Hacettepe University This week Motivation PCA algorithms Applications PCA shortcomings Autoencoders Kernel PCA PCA Applications Data Visualization
More informationDimensionality reduction Feature selection
CS 750 Mache Learg Lecture 3 Dmesoalty reducto Feature selecto Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square CS 750 Mache Learg Dmesoalty reducto. Motvato. Classfcato problem eample: We have a put data
More informationAdvanced Introduction to Machine Learning CMU-10715
Advanced Introduction to Machine Learning CMU-10715 Principal Component Analysis Barnabás Póczos Contents Motivation PCA algorithms Applications Some of these slides are taken from Karl Booksh Research
More informationBand structure calculations
Bad structure cacuatos group semar 00-0 Georg Wrth Isttut für Laser Physk Jauary 00 Motvato attce ad stab. aser are outcouped from SM-PM-fber Mcheso terferometer braches overap uder 90 attce forms overappg
More informationLinear models for classification
CS 75 Mache Lear Lecture 9 Lear modes for cassfcato Mos Hausrecht mos@cs.ptt.edu 539 Seott Square ata: { d d.. d} d Cassfcato represets a dscrete cass vaue Goa: ear f : X Y Bar cassfcato A speca case he
More informationQR Factorization and Singular Value Decomposition COS 323
QR Factorzato ad Sgular Value Decomposto COS 33 Why Yet Aother Method? How do we solve least-squares wthout currg codto-squarg effect of ormal equatos (A T A A T b) whe A s sgular, fat, or otherwse poorly-specfed?
More informationBounds for block sparse tensors
A Bouds for bock sparse tesors Oe of the ma bouds to cotro s the spectra orm of the sparse perturbato tesor S The success of the power teratos ad the mprovemet accuracy of recovery over teratve steps of
More informationEconometric Methods. Review of Estimation
Ecoometrc Methods Revew of Estmato Estmatg the populato mea Radom samplg Pot ad terval estmators Lear estmators Ubased estmators Lear Ubased Estmators (LUEs) Effcecy (mmum varace) ad Best Lear Ubased Estmators
More informationAnnouncements. Recognition II. Computer Vision I. Example: Face Detection. Evaluating a binary classifier
Aoucemets Recogto II H3 exteded to toght H4 to be aouced today. Due Frday 2/8. Note wll take a whle to ru some thgs. Fal Exam: hursday 2/4 at 7pm-0pm CSE252A Lecture 7 Example: Face Detecto Evaluatg a
More informationPrincipal Components. Analysis. Basic Intuition. A Method of Self Organized Learning
Prcpal Compoets Aalss A Method of Self Orgazed Learg Prcpal Compoets Aalss Stadard techque for data reducto statstcal patter matchg ad sgal processg Usupervsed learg: lear from examples wthout a teacher
More informationKernel-based Methods and Support Vector Machines
Kerel-based Methods ad Support Vector Maches Larr Holder CptS 570 Mache Learg School of Electrcal Egeerg ad Computer Scece Washgto State Uverst Refereces Muller et al. A Itroducto to Kerel-Based Learg
More informationn -dimensional vectors follow naturally from the one
B. Vectors ad sets B. Vectors Ecoomsts study ecoomc pheomea by buldg hghly stylzed models. Uderstadg ad makg use of almost all such models requres a hgh comfort level wth some key mathematcal sklls. I
More informationBinary classification: Support Vector Machines
CS 57 Itroducto to AI Lecture 6 Bar classfcato: Support Vector Maches Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square CS 57 Itro to AI Supervsed learg Data: D { D, D,.., D} a set of eamples D, (,,,,,
More informationCS 1675 Introduction to Machine Learning Lecture 12 Support vector machines
CS 675 Itroducto to Mache Learg Lecture Support vector maches Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square Mdterm eam October 9, 7 I-class eam Closed book Stud materal: Lecture otes Correspodg chapters
More informationRademacher Complexity. Examples
Algorthmc Foudatos of Learg Lecture 3 Rademacher Complexty. Examples Lecturer: Patrck Rebesch Verso: October 16th 018 3.1 Itroducto I the last lecture we troduced the oto of Rademacher complexty ad showed
More informationGenerative classification models
CS 75 Mache Learg Lecture Geeratve classfcato models Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square Data: D { d, d,.., d} d, Classfcato represets a dscrete class value Goal: lear f : X Y Bar classfcato
More information18.413: Error Correcting Codes Lab March 2, Lecture 8
18.413: Error Correctg Codes Lab March 2, 2004 Lecturer: Dael A. Spelma Lecture 8 8.1 Vector Spaces A set C {0, 1} s a vector space f for x all C ad y C, x + y C, where we take addto to be compoet wse
More informationESS Line Fitting
ESS 5 014 17. Le Fttg A very commo problem data aalyss s lookg for relatoshpetwee dfferet parameters ad fttg les or surfaces to data. The smplest example s fttg a straght le ad we wll dscuss that here
More informationLinear Regression Linear Regression with Shrinkage. Some slides are due to Tommi Jaakkola, MIT AI Lab
Lear Regresso Lear Regresso th Shrkage Some sldes are due to Tomm Jaakkola, MIT AI Lab Itroducto The goal of regresso s to make quattatve real valued predctos o the bass of a vector of features or attrbutes.
More informationSummary of the lecture in Biostatistics
Summary of the lecture Bostatstcs Probablty Desty Fucto For a cotuos radom varable, a probablty desty fucto s a fucto such that: 0 dx a b) b a dx A probablty desty fucto provdes a smple descrpto of the
More informationi 2 σ ) i = 1,2,...,n , and = 3.01 = 4.01
ECO 745, Homework 6 Le Cabrera. Assume that the followg data come from the lear model: ε ε ~ N, σ,,..., -6. -.5 7. 6.9 -. -. -.9. -..6.4.. -.6 -.7.7 Fd the mamum lkelhood estmates of,, ad σ ε s.6. 4. ε
More informationRadial Basis Function Networks
Radal Bass Fucto Netorks Radal Bass Fucto Netorks A specal types of ANN that have three layers Iput layer Hdde layer Output layer Mappg from put to hdde layer s olear Mappg from hdde to output layer s
More informationhp calculators HP 30S Statistics Averages and Standard Deviations Average and Standard Deviation Practice Finding Averages and Standard Deviations
HP 30S Statstcs Averages ad Stadard Devatos Average ad Stadard Devato Practce Fdg Averages ad Stadard Devatos HP 30S Statstcs Averages ad Stadard Devatos Average ad stadard devato The HP 30S provdes several
More information3D Geometry for Computer Graphics. Lesson 2: PCA & SVD
3D Geometry for Computer Graphcs Lesso 2: PCA & SVD Last week - egedecomposto We wat to lear how the matrx A works: A 2 Last week - egedecomposto If we look at arbtrary vectors, t does t tell us much.
More informationSome Different Perspectives on Linear Least Squares
Soe Dfferet Perspectves o Lear Least Squares A stadard proble statstcs s to easure a respose or depedet varable, y, at fed values of oe or ore depedet varables. Soetes there ests a deterstc odel y f (,,
More informationAn Introduction to. Support Vector Machine
A Itroducto to Support Vector Mache Support Vector Mache (SVM) A classfer derved from statstcal learg theory by Vapk, et al. 99 SVM became famous whe, usg mages as put, t gave accuracy comparable to eural-etwork
More informationChapter 13, Part A Analysis of Variance and Experimental Design. Introduction to Analysis of Variance. Introduction to Analysis of Variance
Chapter, Part A Aalyss of Varace ad Epermetal Desg Itroducto to Aalyss of Varace Aalyss of Varace: Testg for the Equalty of Populato Meas Multple Comparso Procedures Itroducto to Aalyss of Varace Aalyss
More informationLandé interval rule (assignment!) l examples
36 - Read CTD, pp. 56-78 AT TIME: O H = ar s ζ(,, ) s adé terva rue (assgmet!) ζ(,, ) ζ exampes ζ (oe ζfor each - term) (oe ζfor etre cofgurato) evauate matrx eemets ater determata bass ad may-e M or M
More informationPART ONE. Solutions to Exercises
PART ONE Soutos to Exercses Chapter Revew of Probabty Soutos to Exercses 1. (a) Probabty dstrbuto fucto for Outcome (umber of heads) 0 1 probabty 0.5 0.50 0.5 Cumuatve probabty dstrbuto fucto for Outcome
More informationCS 2750 Machine Learning. Lecture 8. Linear regression. CS 2750 Machine Learning. Linear regression. is a linear combination of input components x
CS 75 Mache Learg Lecture 8 Lear regresso Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square CS 75 Mache Learg Lear regresso Fucto f : X Y s a lear combato of put compoets f + + + K d d K k - parameters
More information1 Onto functions and bijections Applications to Counting
1 Oto fuctos ad bectos Applcatos to Coutg Now we move o to a ew topc. Defto 1.1 (Surecto. A fucto f : A B s sad to be surectve or oto f for each b B there s some a A so that f(a B. What are examples of
More informationX X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then
Secto 5 Vectors of Radom Varables Whe workg wth several radom varables,,..., to arrage them vector form x, t s ofte coveet We ca the make use of matrx algebra to help us orgaze ad mapulate large umbers
More informationSupervised learning: Linear regression Logistic regression
CS 57 Itroducto to AI Lecture 4 Supervsed learg: Lear regresso Logstc regresso Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square CS 57 Itro to AI Data: D { D D.. D D Supervsed learg d a set of eamples s
More informationCan we take the Mysticism Out of the Pearson Coefficient of Linear Correlation?
Ca we tae the Mstcsm Out of the Pearso Coeffcet of Lear Correlato? Itroducto As the ttle of ths tutoral dcates, our purpose s to egeder a clear uderstadg of the Pearso coeffcet of lear correlato studets
More information0 () t and an equation
DECETRALIZED ODEL REFERECE ADAPTIVE PRECIZE COTROL OF COPLEX OBJECTS S.D. Zemyakov, V.Yu. Rutkovsky, V.. Gumov ad V.. Sukhaov Isttute of Cotro Scece by V.A. Trapezkov Russa Academy of Scece 65 Profsoyuzaya,
More informationLecture Notes 2. The ability to manipulate matrices is critical in economics.
Lecture Notes. Revew of Matrces he ablt to mapulate matrces s crtcal ecoomcs.. Matr a rectagular arra of umbers, parameters, or varables placed rows ad colums. Matrces are assocated wth lear equatos. lemets
More informationA Clustering Algorithm in Group Decision Making
A Custerg Agorthm Group Decso Mag XU Xua-hua,CHEN Xao-hog, LUO Dg 3 (Schoo of Busess, Cetra South Uversty, Chagsha 40083, Hua, P.R.C,xuxh@pubc.cs.h.c) Abstract The homogeeous requremet of the AHP has stfed
More informationENGI 4421 Propagation of Error Page 8-01
ENGI 441 Propagato of Error Page 8-01 Propagato of Error [Navd Chapter 3; ot Devore] Ay realstc measuremet procedure cotas error. Ay calculatos based o that measuremet wll therefore also cota a error.
More informationIntroduction to local (nonparametric) density estimation. methods
Itroducto to local (oparametrc) desty estmato methods A slecture by Yu Lu for ECE 66 Sprg 014 1. Itroducto Ths slecture troduces two local desty estmato methods whch are Parze desty estmato ad k-earest
More informationMachine Learning. Topic 4: Measuring Distance
Mache Learg Topc 4: Measurg Dstace Bra Pardo Mache Learg: EECS 349 Fall 2009 Wh measure dstace? Clusterg requres dstace measures. Local methods requre a measure of localt Search eges requre a measure of
More informationC-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory
ROAD MAP... AE301 Aerodyamcs I UNIT C: 2-D Arfols C-1: Aerodyamcs of Arfols 1 C-2: Aerodyamcs of Arfols 2 C-3: Pael Methods C-4: Th Arfol Theory AE301 Aerodyamcs I Ut C-3: Lst of Subects Problem Solutos?
More informationPTAS for Bin-Packing
CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,
More informationb. There appears to be a positive relationship between X and Y; that is, as X increases, so does Y.
.46. a. The frst varable (X) s the frst umber the par ad s plotted o the horzotal axs, whle the secod varable (Y) s the secod umber the par ad s plotted o the vertcal axs. The scatterplot s show the fgure
More informationLecture 12: Multilayer perceptrons II
Lecture : Multlayer perceptros II Bayes dscrmats ad MLPs he role of hdde uts A eample Itroducto to Patter Recoto Rcardo Guterrez-Osua Wrht State Uversty Bayes dscrmats ad MLPs ( As we have see throuhout
More informationUnsupervised Learning and Other Neural Networks
CSE 53 Soft Computg NOT PART OF THE FINAL Usupervsed Learg ad Other Neural Networs Itroducto Mture Destes ad Idetfablty ML Estmates Applcato to Normal Mtures Other Neural Networs Itroducto Prevously, all
More informationLecture 3 Probability review (cont d)
STATS 00: Itroducto to Statstcal Iferece Autum 06 Lecture 3 Probablty revew (cot d) 3. Jot dstrbutos If radom varables X,..., X k are depedet, the ther dstrbuto may be specfed by specfyg the dvdual dstrbuto
More informationEE 6885 Statistical Pattern Recognition
EE 6885 Sascal Paer Recogo Fall 005 Prof. Shh-Fu Chag hp://.ee.columba.edu/~sfchag Lecure 8 (/8/05 8- Readg Feaure Dmeso Reduco PCA, ICA, LDA, Chaper 3.8, 0.3 ICA Tuoral: Fal Exam Aapo Hyväre ad Erkk Oja,
More informationL5 Polynomial / Spline Curves
L5 Polyomal / Sple Curves Cotets Coc sectos Polyomal Curves Hermte Curves Bezer Curves B-Sples No-Uform Ratoal B-Sples (NURBS) Mapulato ad Represetato of Curves Types of Curve Equatos Implct: Descrbe a
More informationDimensionality Reduction and Learning
CMSC 35900 (Sprg 009) Large Scale Learg Lecture: 3 Dmesoalty Reducto ad Learg Istructors: Sham Kakade ad Greg Shakharovch L Supervsed Methods ad Dmesoalty Reducto The theme of these two lectures s that
More informationSection l h l Stem=Tens. 8l Leaf=Ones. 8h l 03. 9h 58
Secto.. 6l 34 6h 667899 7l 44 7h Stem=Tes 8l 344 Leaf=Oes 8h 5557899 9l 3 9h 58 Ths dsplay brgs out the gap the data: There are o scores the hgh 7's. 6. a. beams cylders 9 5 8 88533 6 6 98877643 7 488
More informationRegression and the LMS Algorithm
CSE 556: Itroducto to Neural Netorks Regresso ad the LMS Algorthm CSE 556: Regresso 1 Problem statemet CSE 556: Regresso Lear regresso th oe varable Gve a set of N pars of data {, d }, appromate d b a
More informationTHE ROYAL STATISTICAL SOCIETY 2016 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5
THE ROYAL STATISTICAL SOCIETY 06 EAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5 The Socety s provdg these solutos to assst cadtes preparg for the examatos 07. The solutos are teded as learg ads ad should
More informationNaïve Bayes MIT Course Notes Cynthia Rudin
Thaks to Şeyda Ertek Credt: Ng, Mtchell Naïve Bayes MIT 5.097 Course Notes Cytha Rud The Naïve Bayes algorthm comes from a geeratve model. There s a mportat dstcto betwee geeratve ad dscrmatve models.
More informationFeature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)
CSE 546: Mache Learg Lecture 6 Feature Selecto: Part 2 Istructor: Sham Kakade Greedy Algorthms (cotued from the last lecture) There are varety of greedy algorthms ad umerous amg covetos for these algorthms.
More informationMean is only appropriate for interval or ratio scales, not ordinal or nominal.
Mea Same as ordary average Sum all the data values ad dvde by the sample sze. x = ( x + x +... + x Usg summato otato, we wrte ths as x = x = x = = ) x Mea s oly approprate for terval or rato scales, ot
More informationCSE 5526: Introduction to Neural Networks Linear Regression
CSE 556: Itroducto to Neural Netorks Lear Regresso Part II 1 Problem statemet Part II Problem statemet Part II 3 Lear regresso th oe varable Gve a set of N pars of data , appromate d by a lear fucto
More informationMultivariate Transformation of Variables and Maximum Likelihood Estimation
Marquette Uversty Multvarate Trasformato of Varables ad Maxmum Lkelhood Estmato Dael B. Rowe, Ph.D. Assocate Professor Departmet of Mathematcs, Statstcs, ad Computer Scece Copyrght 03 by Marquette Uversty
More informationLecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model
Lecture 7. Cofdece Itervals ad Hypothess Tests the Smple CLR Model I lecture 6 we troduced the Classcal Lear Regresso (CLR) model that s the radom expermet of whch the data Y,,, K, are the outcomes. The
More informationENGI 4421 Joint Probability Distributions Page Joint Probability Distributions [Navidi sections 2.5 and 2.6; Devore sections
ENGI 441 Jot Probablty Dstrbutos Page 7-01 Jot Probablty Dstrbutos [Navd sectos.5 ad.6; Devore sectos 5.1-5.] The jot probablty mass fucto of two dscrete radom quattes, s, P ad p x y x y The margal probablty
More informationHYPERPARAMETER SELECTION IN KERNEL PRINCIPAL COMPONENT ANALYSIS
Joura of Computer Scece 0 (7): 39-50, 04 ISSN: 549-3636 04 Scece Pubcatos do:0.3844/cssp.04.39.50 Pubshed Oe 0 (7) 04 (http://www.thescpub.com/cs.toc) HYPERPARAMETER SELECTION IN KERNEL PRINCIPAL COMPONENT
More informationCentroids & Moments of Inertia of Beam Sections
RCH 614 Note Set 8 S017ab Cetrods & Momets of erta of Beam Sectos Notato: b C d d d Fz h c Jo L O Q Q = ame for area = ame for a (base) wdth = desgato for chael secto = ame for cetrod = calculus smbol
More informationFinsler Geometry & Cosmological constants
Avaabe oe at www.peaaresearchbrary.com Peaa esearch Lbrary Advaces Apped Scece esearch, 0, (6):44-48 Fser Geometry & Cosmooca costats. K. Mshra ad Aruesh Padey ISSN: 0976-860 CODEN (USA): AASFC Departmet
More informationSupport vector machines II
CS 75 Mache Learg Lecture Support vector maches II Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square Learl separable classes Learl separable classes: here s a hperplae that separates trag staces th o error
More informationA stopping criterion for Richardson s extrapolation scheme. under finite digit arithmetic.
A stoppg crtero for cardso s extrapoato sceme uder fte dgt artmetc MAKOO MUOFUSHI ad HIEKO NAGASAKA epartmet of Lbera Arts ad Sceces Poytecc Uversty 4-1-1 Hasmotoda,Sagamara,Kaagawa 229-1196 JAPAN Abstract:
More information9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d
9 U-STATISTICS Suppose,,..., are P P..d. wth CDF F. Our goal s to estmate the expectato t (P)=Eh(,,..., m ). Note that ths expectato requres more tha oe cotrast to E, E, or Eh( ). Oe example s E or P((,
More informationInvestigating Cellular Automata
Researcher: Taylor Dupuy Advsor: Aaro Wootto Semester: Fall 4 Ivestgatg Cellular Automata A Overvew of Cellular Automata: Cellular Automata are smple computer programs that geerate rows of black ad whte
More informationQuantitative analysis requires : sound knowledge of chemistry : possibility of interferences WHY do we need to use STATISTICS in Anal. Chem.?
Ch 4. Statstcs 4.1 Quattatve aalyss requres : soud kowledge of chemstry : possblty of terfereces WHY do we eed to use STATISTICS Aal. Chem.? ucertaty ests. wll we accept ucertaty always? f ot, from how
More informationModel Fitting, RANSAC. Jana Kosecka
Model Fttg, RANSAC Jaa Kosecka Fttg: Issues Prevous strateges Le detecto Hough trasform Smple parametrc model, two parameters m, b m + b Votg strateg Hard to geeralze to hgher dmesos a o + a + a 2 2 +
More informationSTK4011 and STK9011 Autumn 2016
STK4 ad STK9 Autum 6 Pot estmato Covers (most of the followg materal from chapter 7: Secto 7.: pages 3-3 Secto 7..: pages 3-33 Secto 7..: pages 35-3 Secto 7..3: pages 34-35 Secto 7.3.: pages 33-33 Secto
More informationMultiple Choice Test. Chapter Adequacy of Models for Regression
Multple Choce Test Chapter 06.0 Adequac of Models for Regresso. For a lear regresso model to be cosdered adequate, the percetage of scaled resduals that eed to be the rage [-,] s greater tha or equal to
More informationPROJECTION PROBLEM FOR REGULAR POLYGONS
Joural of Mathematcal Sceces: Advaces ad Applcatos Volume, Number, 008, Pages 95-50 PROJECTION PROBLEM FOR REGULAR POLYGONS College of Scece Bejg Forestry Uversty Bejg 0008 P. R. Cha e-mal: sl@bjfu.edu.c
More informationECON 482 / WH Hong The Simple Regression Model 1. Definition of the Simple Regression Model
ECON 48 / WH Hog The Smple Regresso Model. Defto of the Smple Regresso Model Smple Regresso Model Expla varable y terms of varable x y = β + β x+ u y : depedet varable, explaed varable, respose varable,
More informationContinuous Distributions
7//3 Cotuous Dstrbutos Radom Varables of the Cotuous Type Desty Curve Percet Desty fucto, f (x) A smooth curve that ft the dstrbuto 3 4 5 6 7 8 9 Test scores Desty Curve Percet Probablty Desty Fucto, f
More informationOverview. Basic concepts of Bayesian learning. Most probable model given data Coin tosses Linear regression Logistic regression
Overvew Basc cocepts of Bayesa learg Most probable model gve data Co tosses Lear regresso Logstc regresso Bayesa predctos Co tosses Lear regresso 30 Recap: regresso problems Iput to learg problem: trag
More informationMOLECULAR VIBRATIONS
MOLECULAR VIBRATIONS Here we wsh to vestgate molecular vbratos ad draw a smlarty betwee the theory of molecular vbratos ad Hückel theory. 1. Smple Harmoc Oscllator Recall that the eergy of a oe-dmesoal
More informationOptimal Constants in the Rosenthal Inequality for Random Variables with Zero Odd Moments.
Optma Costats the Rosetha Iequaty for Radom Varabes wth Zero Odd Momets. The Harvard commuty has made ths artce opey avaabe. Pease share how ths access beefts you. Your story matters Ctato Ibragmov, Rustam
More informationSolutions for HW4. x k n+1. k! n(n + 1) (n + k 1) =.
Exercse 13 (a Proe Soutos for HW4 (1 + x 1 + x 2 1 + (1 + x 2 + x 2 2 + (1 + x + x 2 + by ducto o M(Sν x S x ν(x Souto: Frst ote that sce the mutsets o {x 1 } are determed by ν(x 1 the set of mutsets o
More informationChapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements
Aoucemets No-Parametrc Desty Estmato Techques HW assged Most of ths lecture was o the blacboard. These sldes cover the same materal as preseted DHS Bometrcs CSE 90-a Lecture 7 CSE90a Fall 06 CSE90a Fall
More information= 2. Statistic - function that doesn't depend on any of the known parameters; examples:
of Samplg Theory amples - uemploymet househol cosumpto survey Raom sample - set of rv's... ; 's have ot strbuto [ ] f f s vector of parameters e.g. Statstc - fucto that oes't epe o ay of the ow parameters;
More informationAssignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class)
Assgmet 5/MATH 7/Wter 00 Due: Frday, February 9 class (!) (aswers wll be posted rght after class) As usual, there are peces of text, before the questos [], [], themselves. Recall: For the quadratc form
More informationto the estimation of total sensitivity indices
Applcato of the cotrol o varate ate techque to the estmato of total sestvty dces S KUCHERENKO B DELPUECH Imperal College Lodo (UK) skuchereko@mperalacuk B IOOSS Electrcté de Frace (Frace) S TARANTOLA Jot
More informationChapter 9 Jordan Block Matrices
Chapter 9 Jorda Block atrces I ths chapter we wll solve the followg problem. Gve a lear operator T fd a bass R of F such that the matrx R (T) s as smple as possble. f course smple s a matter of taste.
More informationSTA 108 Applied Linear Models: Regression Analysis Spring Solution for Homework #1
STA 08 Appled Lear Models: Regresso Aalyss Sprg 0 Soluto for Homework #. Let Y the dollar cost per year, X the umber of vsts per year. The the mathematcal relato betwee X ad Y s: Y 300 + X. Ths s a fuctoal
More informationmeans the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.
9.4 Sequeces ad Seres Pre Calculus 9.4 SEQUENCES AND SERIES Learg Targets:. Wrte the terms of a explctly defed sequece.. Wrte the terms of a recursvely defed sequece. 3. Determe whether a sequece s arthmetc,
More informationx y exp λ'. x exp λ 2. x exp 1.
egecosmcd Egevalue-egevector of the secod dervatve operator d /d hs leads to Fourer seres (se, cose, Legedre, Bessel, Chebyshev, etc hs s a eample of a systematc way of geeratg a set of mutually orthogoal
More informationRecall MLR 5 Homskedasticity error u has the same variance given any values of the explanatory variables Var(u x1,...,xk) = 2 or E(UU ) = 2 I
Chapter 8 Heterosedastcty Recall MLR 5 Homsedastcty error u has the same varace gve ay values of the eplaatory varables Varu,..., = or EUU = I Suppose other GM assumptos hold but have heterosedastcty.
More informationDifferent Kinds of Boundary Elements for Solving the Problem of the Compressible Fluid Flow around Bodies-a Comparison Study
Proceedgs of the Word Cogress o Egeerg 8 Vo II WCE 8, Ju - 4, 8, Lodo, U.K. Dfferet Kds of Boudar Eemets for Sovg the Probem of the Compressbe Fud Fow aroud Bodes-a Comparso Stud Lumta Grecu, Gabrea Dema
More informationTESTS BASED ON MAXIMUM LIKELIHOOD
ESE 5 Toy E. Smth. The Basc Example. TESTS BASED ON MAXIMUM LIKELIHOOD To llustrate the propertes of maxmum lkelhood estmates ad tests, we cosder the smplest possble case of estmatg the mea of the ormal
More informationMEASURES OF DISPERSION
MEASURES OF DISPERSION Measure of Cetral Tedecy: Measures of Cetral Tedecy ad Dsperso ) Mathematcal Average: a) Arthmetc mea (A.M.) b) Geometrc mea (G.M.) c) Harmoc mea (H.M.) ) Averages of Posto: a) Meda
More informationAbstract. 1. Introduction
Joura of Mathematca Sceces: Advaces ad Appcatos Voume 4 umber 2 2 Pages 33-34 COVERGECE OF HE PROJECO YPE SHKAWA ERAO PROCESS WH ERRORS FOR A FE FAMY OF OSEF -ASYMPOCAY QUAS-OEXPASVE MAPPGS HUA QU ad S-SHEG
More informationMATH 247/Winter Notes on the adjoint and on normal operators.
MATH 47/Wter 00 Notes o the adjot ad o ormal operators I these otes, V s a fte dmesoal er product space over, wth gve er * product uv, T, S, T, are lear operators o V U, W are subspaces of V Whe we say
More informationPrincipal Component Analysis
B: Chapter 1 HTF: Chapter 1.5 Principal Component Analysis Barnabás Póczos University of Alberta Nov, 009 Contents Motivation PCA algorithms Applications Face recognition Facial expression recognition
More informationBayes (Naïve or not) Classifiers: Generative Approach
Logstc regresso Bayes (Naïve or ot) Classfers: Geeratve Approach What do we mea by Geeratve approach: Lear p(y), p(x y) ad the apply bayes rule to compute p(y x) for makg predctos Ths s essetally makg
More informationMaximum Likelihood Estimation
Marquette Uverst Maxmum Lkelhood Estmato Dael B. Rowe, Ph.D. Professor Departmet of Mathematcs, Statstcs, ad Computer Scece Coprght 08 b Marquette Uverst Maxmum Lkelhood Estmato We have bee sag that ~
More informationCHAPTER 4 RADICAL EXPRESSIONS
6 CHAPTER RADICAL EXPRESSIONS. The th Root of a Real Number A real umber a s called the th root of a real umber b f Thus, for example: s a square root of sce. s also a square root of sce ( ). s a cube
More informationENGI 3423 Simple Linear Regression Page 12-01
ENGI 343 mple Lear Regresso Page - mple Lear Regresso ometmes a expermet s set up where the expermeter has cotrol over the values of oe or more varables X ad measures the resultg values of aother varable
More information