Pattern Classification (III) & Pattern Verification
|
|
- Kelly Carol Lawrence
- 5 years ago
- Views:
Transcription
1 Preare by Prof. Hu Jang CSE CSE Seech & Language Processng o.5 Paern Classfcaon III & Paern Verfcaon Prof. Hu Jang Dearmen of Comuer Scence an Engneerng York Unversy Moel Parameer Esmaon Maxmum Lkelhoo ML Esmaon: ML meho: mos oular moel esmaon EM Exece-Maxmzaon algorhm Examles: Unvarae Gaussan srbuon Mulvarae Gaussan srbuon Mulnomal srbuon Gaussan Mxure moel Markov chan moel: n-gram for language moelng Hen Markov Moel HMM Dscrmnave Tranng alernave moel esmaon meho Maxmum Muual Informaon MMI Mnmum Classfcaon Error MCE Large Margn Esamon LME Bayesan Moel Esmaon: Bayesan heory MDI Mnmum Dscrmnaon Informaon De. of CSE York Unv.
2 Preare by Prof. Hu Jang CSE De. of CSE York Unv. Dscrmnave TranngI: Maxmum Muual Informaon Esmaon The moel s vewe as a nosy aa generaon channel class observaon feaure. Deermne moel arameers o maxmze muual nformaon beween an. close relaon beween an nosy aa generaon channel I log log log log arg max } { I MMI Dscrmnave TranngI: Maxmum Muual Informaon Esmaon Dffculy: jon srbuon s unknown. Soluon: collec a reresenave ranng se T T o aroxmae he jon srbuon. Omzaon: Ierave graen-ascen meho Growh-ransformaon meho T MMI I log arg max log arg max arg max } {
3 Preare by Prof. Hu Jang CSE Dscrmnave TranngII: Mnmum Classfcaon Error Esmaon In a -class aern classfcaon roblem gven a se of ranng aa D{ T T} esmae moel arameers for all class o mnmze oal classfcaon errors n D. MCE: mnmze emrcal classfcaon errors Objecve funcon oal classfcaon errors n D For each ranng aa efne msclassfcaon measure: or + max ' ' ln[ ] + max ln[ ' ] ' f > ncorrec classfcaon for error f < correc classfcaon for error ' ' Dscrmnave TranngII: Mnmum Classfcaon Error Esmaon Sof-max: aroxmae by a fferenable funcon: + ln ex[ η ' ] ' ' or ln[ ] + ln ex[ η ln ' ] ' ' where η>. / η / η De. of CSE York Unv. 3
4 Preare by Prof. Hu Jang CSE Dscrmnave TranngII: Mnmum Classfcaon Error Esmaon 3 Error coun for one aa s H where H. s se funcon. Toal errors n ranng se: T Q Λ H Se funcon s no fferenable aroxmae by a sgmo funcon smoohe oal errors n ranng se. Q Λ Q' Λ l where T l + e a a> s a arameer o conrol s shae. Dscrmnave TranngII: Mnmum Classfcaon Error Esmaon 3 MCE esmaon of moel arameers for all classes: { } MCE arg mn Q' Omzaon: no smle soluon s avalable Ierave graen escen meho. GPD generalze robablsc escen meho. n+ n ε ' Q n De. of CSE York Unv. 4
5 Preare by Prof. Hu Jang CSE De. of CSE York Unv. 5 The MCE/GPD Meho Fn nal moel arameers e.g. ML esmaes Calculae graen of he objecve funcon Calculae he value of he graen base on he curren moel arameers Uae moel arameers Ierae unl convergence ' n n n Q ε + How o calculae graen? The key ssue n MCE/GPD s how o se a roer se sze exermenally. [ ] T T T l l a l l Q ] [ '
6 Preare by Prof. Hu Jang CSE Overranng Overfng Low classfcaon error rae n ranng se oes no always lea o a low error rae n a new es se ue o overranng. Measurng Performance of MCE Objecve funcon Classfcaon Error n % When o converge: monor hree quanes n he MCE/GPD The objecve funcon Error rae n ranng se Error rae n es se De. of CSE York Unv. 6
7 Preare by Prof. Hu Jang CSE Large Margn Esmaon searaon bounary FΛ-F Λ moel Λ moel Λ Large-Margn Classfer orgnal searaon bounary FΛ-F Λ Λ Λ Λ Λ new searaon bounary FΛ -FΛ De. of CSE York Unv. 7
8 Preare by Prof. Hu Jang CSE How o efne searaon margn? In -class searable roblem: For a aa oken x of class Λ x FxΛ FxΛ > For a aa oken x of class Λ x Fx Λ Fx Λ > How o efne searaon margn? Exen o mulle-class roblem: classes Λ Λ Λ For a aa oken x of class Λ x FxΛ max FxΛ j mn j [ FxΛ FxΛ ] j j De. of CSE York Unv. 8
9 Preare by Prof. Hu Jang CSE Large Margn Esmaon An -class roblem: each class s reresene by one moel Λ Λ Λ Λ { Gven a ranng se D efne a subse calle suor oken se S base on nal moel as: S { D an ε} } Large-Margn Esmaon LME: Λ ˆ arg max mn subjec o all > Λ S Bayesan Theory Bayesan mehos vew moel arameers as ranom varables havng some known ror srbuon. Pror secfcaon Secfy ror srbuon of moel arameers θ as θ. Tranng aa D allow us o conver he ror srbuon no a oseror srbuon. Bayesan learnng θ D θ θ D θ D θ D We nfer or ece everyhng solely base on he oseror srbuon. Bayesan nference Moel esmaon: he MAP maxmum a oseror esmaon Paern Classfcaon: Bayesan classfcaon Sequenal on-lne ncremenal learnng Ohers: recon moel selecon ec. De. of CSE York Unv. 9
10 Preare by Prof. Hu Jang CSE Bayesan Learnng Poseror θ D Lkelhoo P D θ Pror θ θmap θml θ The MAP esmaon of moel arameers Do a on esmae abou θ base on he oseror srbuon θ MAP arg max θ D arg max θ D θ θ Then θmap s reae as esmae of moel arameers jus lke ML esmae. Somemes nee he EM algorhm o erve. θ MAP esmaon omally combne ror knowlege wh new nformaon rove by aa. MAP esmaon s use n seech recognon o aa seech moels o a arcular seaker o coe wh varous accens From a generc seaker-neenen seech moel ror Collec a small se of aa from a arcular seaker The MAP esmae gve a seaker-aave moel whch su beer o hs arcular seaker. De. of CSE York Unv.
11 Preare by Prof. Hu Jang CSE Bayesan Classfcaon Assume we have classes each class has a classcononal f θ wh arameers θ. The ror knowlege abou θ s nclue n a ror θ. For each class we have a ranng aa se D. Problem: classfy an unknown aa Y no one of he classes. The Bayesan classfcaon s one as: Y arg max Y D arg max Y θ θ D θ where θ D θ θ D θ D θ D Recursve Bayes Learnng Sequenal Bayesan Learnng Bayesan heory roves a framework for on-lne learnng a.k.a. ncremenal learnng aave learnng. When we observe ranng aa one by one we can ynamcally ajus he moel o learn ncremenally from aa. Assume we observe ranng aa se D{ n} one by one θ θ θ θ D n Learnng Rule: oseror ror lkelhoo Knowlege abou Moel a hs sage Knowlege abou Moel a hs sage Knowlege abou Moel a hs sage Knowlege abou Moel a hs sage De. of CSE York Unv.
12 Preare by Prof. Hu Jang CSE De. of CSE York Unv. How o secfy rors onnformave rors In case we on have enough ror knowlege jus use a fla ror a he begnnng. Conjugae rors: for comuaon convenence For some moels f her robably funcons are a reroucng ensy we can choose he ror as a secal form calle conjugae ror so ha afer Bayesan leanng he oseror wll have he exac same funcon form as he ror exce he all arameers are uae. o every moel has conjugae ror. Conjugae Pror For a unvarae Gaussan moel wh only unknown mean: If we choose he ror as a Gaussan srbuon Gaussan s conjugae ror s Gaussan Afer observng a new aa x he oseror wll sll be Gaussan: ] ex[ π x x x ] ex[ π where ] ex[ π x x
13 Preare by Prof. Hu Jang CSE The sequenal MAP Esmae of Gaussan For unvarae Gaussan wh unknown mean he MAP esmae of s mean afer observng x: x Afer observng nex aa x: x De. of CSE York Unv. 3
Pattern Classification (VI) 杜俊
Paern lassificaion VI 杜俊 jundu@usc.edu.cn Ouline Bayesian Decision Theory How o make he oimal decision? Maximum a oserior MAP decision rule Generaive Models Join disribuion of observaion and label sequences
More informationCHAPTER 5: MULTIVARIATE METHODS
CHAPER 5: MULIVARIAE MEHODS Mulvarae Daa 3 Mulple measuremens (sensors) npus/feaures/arbues: -varae N nsances/observaons/eamples Each row s an eample Each column represens a feaure X a b correspons o he
More informationVariants of Pegasos. December 11, 2009
Inroducon Varans of Pegasos SooWoong Ryu bshboy@sanford.edu December, 009 Youngsoo Cho yc344@sanford.edu Developng a new SVM algorhm s ongong research opc. Among many exng SVM algorhms, we wll focus on
More information( ) [ ] MAP Decision Rule
Announcemens Bayes Decson Theory wh Normal Dsrbuons HW0 due oday HW o be assgned soon Proec descrpon posed Bomercs CSE 90 Lecure 4 CSE90, Sprng 04 CSE90, Sprng 04 Key Probables 4 ω class label X feaure
More informationClustering (Bishop ch 9)
Cluserng (Bshop ch 9) Reference: Daa Mnng by Margare Dunham (a slde source) 1 Cluserng Cluserng s unsupervsed learnng, here are no class labels Wan o fnd groups of smlar nsances Ofen use a dsance measure
More informationChapter 3: Maximum-Likelihood & Bayesian Parameter Estimation (part 1)
Aoucemes Reags o E-reserves Proec roosal ue oay Parameer Esmao Bomercs CSE 9-a Lecure 6 CSE9a Fall 6 CSE9a Fall 6 Paer Classfcao Chaer 3: Mamum-Lelhoo & Bayesa Parameer Esmao ar All maerals hese sles were
More informationFace Detection: The Problem
Face Deecon and Head Trackng Yng Wu yngwu@ece.norhwesern.edu Elecrcal Engneerng & Comuer Scence Norhwesern Unversy, Evanson, IL h://www.ece.norhwesern.edu/~yngwu Face Deecon: The Problem The Goal: Idenfy
More informationCHAPTER 2: Supervised Learning
HATER 2: Supervsed Learnng Learnng a lass from Eamples lass of a famly car redcon: Is car a famly car? Knowledge eracon: Wha do people epec from a famly car? Oupu: osve (+) and negave ( ) eamples Inpu
More informationFall 2010 Graduate Course on Dynamic Learning
Fall 200 Graduae Course on Dynamc Learnng Chaper 4: Parcle Flers Sepember 27, 200 Byoung-Tak Zhang School of Compuer Scence and Engneerng & Cognve Scence and Bran Scence Programs Seoul aonal Unversy hp://b.snu.ac.kr/~bzhang/
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4
CS434a/54a: Paern Recognon Prof. Olga Veksler Lecure 4 Oulne Normal Random Varable Properes Dscrmnan funcons Why Normal Random Varables? Analycally racable Works well when observaon comes form a corruped
More informationIntroduction ( Week 1-2) Course introduction A brief introduction to molecular biology A brief introduction to sequence comparison Part I: Algorithms
Course organzaon Inroducon Wee -2) Course nroducon A bref nroducon o molecular bology A bref nroducon o sequence comparson Par I: Algorhms for Sequence Analyss Wee 3-8) Chaper -3, Models and heores» Probably
More informationMachine Learning Linear Regression
Machne Learnng Lnear Regresson Lesson 3 Lnear Regresson Bascs of Regresson Leas Squares esmaon Polynomal Regresson Bass funcons Regresson model Regularzed Regresson Sascal Regresson Mamum Lkelhood (ML)
More informationBayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance
INF 43 3.. Repeon Anne Solberg (anne@f.uo.no Bayes rule for a classfcaon problem Suppose we have J, =,...J classes. s he class label for a pxel, and x s he observed feaure vecor. We can use Bayes rule
More informationOutline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model
Probablsc Model for Tme-seres Daa: Hdden Markov Model Hrosh Mamsuka Bonformacs Cener Kyoo Unversy Oulne Three Problems for probablsc models n machne learnng. Compung lkelhood 2. Learnng 3. Parsng (predcon
More informationAdvanced Machine Learning & Perception
Advanced Machne Learnng & Percepon Insrucor: Tony Jebara SVM Feaure & Kernel Selecon SVM Eensons Feaure Selecon (Flerng and Wrappng) SVM Feaure Selecon SVM Kernel Selecon SVM Eensons Classfcaon Feaure/Kernel
More informationLecture 6: Learning for Control (Generalised Linear Regression)
Lecure 6: Learnng for Conrol (Generalsed Lnear Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure 6: RLSC - Prof. Sehu Vjayakumar Lnear Regresson
More informationRobust and Accurate Cancer Classification with Gene Expression Profiling
Robus and Accurae Cancer Classfcaon wh Gene Expresson Proflng (Compuaonal ysems Bology, 2005) Auhor: Hafeng L, Keshu Zhang, ao Jang Oulne Background LDA (lnear dscrmnan analyss) and small sample sze problem
More informationMachine Learning 2nd Edition
INTRODUCTION TO Lecure Sldes for Machne Learnng nd Edon ETHEM ALPAYDIN, modfed by Leonardo Bobadlla and some pars from hp://www.cs.au.ac.l/~aparzn/machnelearnng/ The MIT Press, 00 alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/mle
More informationLecture Slides for INTRODUCTION TO. Machine Learning. ETHEM ALPAYDIN The MIT Press,
Lecure Sldes for INTRDUCTIN T Machne Learnng ETHEM ALAYDIN The MIT ress, 2004 alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/2ml CHATER 3: Hdden Marov Models Inroducon Modelng dependences n npu; no
More informationOP = OO' + Ut + Vn + Wb. Material We Will Cover Today. Computer Vision Lecture 3. Multi-view Geometry I. Amnon Shashua
Comuer Vson 27 Lecure 3 Mul-vew Geomer I Amnon Shashua Maeral We Wll Cover oa he srucure of 3D->2D rojecon mar omograh Marces A rmer on rojecve geomer of he lane Eolar Geomer an Funamenal Mar ebrew Unvers
More informationA New Method for Computing EM Algorithm Parameters in Speaker Identification Using Gaussian Mixture Models
0 IACSI Hong Kong Conferences IPCSI vol. 9 (0) (0) IACSI Press, Sngaore A New ehod for Comung E Algorhm Parameers n Seaker Idenfcaon Usng Gaussan xure odels ohsen Bazyar +, Ahmad Keshavarz, and Khaoon
More informationDynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005
Dynamc Team Decson Theory EECS 558 Proec Shruvandana Sharma and Davd Shuman December 0, 005 Oulne Inroducon o Team Decson Theory Decomposon of he Dynamc Team Decson Problem Equvalence of Sac and Dynamc
More informationDepartment of Economics University of Toronto
Deparmen of Economcs Unversy of Torono ECO408F M.A. Economercs Lecure Noes on Heeroskedascy Heeroskedascy o Ths lecure nvolves lookng a modfcaons we need o make o deal wh he regresson model when some of
More informationIntroduction to Boosting
Inroducon o Boosng Cynha Rudn PACM, Prnceon Unversy Advsors Ingrd Daubeches and Rober Schapre Say you have a daabase of news arcles, +, +, -, -, +, +, -, -, +, +, -, -, +, +, -, + where arcles are labeled
More informationNPTEL Project. Econometric Modelling. Module23: Granger Causality Test. Lecture35: Granger Causality Test. Vinod Gupta School of Management
P age NPTEL Proec Economerc Modellng Vnod Gua School of Managemen Module23: Granger Causaly Tes Lecure35: Granger Causaly Tes Rudra P. Pradhan Vnod Gua School of Managemen Indan Insue of Technology Kharagur,
More informationWiH Wei He
Sysem Idenfcaon of onlnear Sae-Space Space Baery odels WH We He wehe@calce.umd.edu Advsor: Dr. Chaochao Chen Deparmen of echancal Engneerng Unversy of aryland, College Par 1 Unversy of aryland Bacground
More informationFoundations of State Estimation Part II
Foundaons of Sae Esmaon Par II Tocs: Hdden Markov Models Parcle Flers Addonal readng: L.R. Rabner, A uoral on hdden Markov models," Proceedngs of he IEEE, vol. 77,. 57-86, 989. Sequenal Mone Carlo Mehods
More informationCHAPTER 10: LINEAR DISCRIMINATION
CHAPER : LINEAR DISCRIMINAION Dscrmnan-based Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g
More informationLecture VI Regression
Lecure VI Regresson (Lnear Mehods for Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure VI: MLSC - Dr. Sehu Vjayakumar Lnear Regresson Model M
More informationLecture 11 SVM cont
Lecure SVM con. 0 008 Wha we have done so far We have esalshed ha we wan o fnd a lnear decson oundary whose margn s he larges We know how o measure he margn of a lnear decson oundary Tha s: he mnmum geomerc
More informationHidden Markov Models Following a lecture by Andrew W. Moore Carnegie Mellon University
Hdden Markov Models Followng a lecure by Andrew W. Moore Carnege Mellon Unversy www.cs.cmu.edu/~awm/uorals A Markov Sysem Has N saes, called s, s 2.. s N s 2 There are dscree meseps, 0,, s s 3 N 3 0 Hdden
More informationAn introduction to Support Vector Machine
An nroducon o Suppor Vecor Machne 報告者 : 黃立德 References: Smon Haykn, "Neural Neworks: a comprehensve foundaon, second edon, 999, Chaper 2,6 Nello Chrsann, John Shawe-Tayer, An Inroducon o Suppor Vecor Machnes,
More informationDiscrete Markov Process. Introduction. Example: Balls and Urns. Stochastic Automaton. INTRODUCTION TO Machine Learning 3rd Edition
EHEM ALPAYDI he MI Press, 04 Lecure Sldes for IRODUCIO O Machne Learnng 3rd Edon alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/ml3e Sldes from exboo resource page. Slghly eded and wh addonal examples
More informationJanuary Examinations 2012
Page of 5 EC79 January Examnaons No. of Pages: 5 No. of Quesons: 8 Subjec ECONOMICS (POSTGRADUATE) Tle of Paper EC79 QUANTITATIVE METHODS FOR BUSINESS AND FINANCE Tme Allowed Two Hours ( hours) Insrucons
More informationHidden Markov Models with Kernel Density Estimation of Emission Probabilities and their Use in Activity Recognition
Hdden Markov Models wh Kernel Densy Esmaon of Emsson Probables and her Use n Acvy Recognon Massmo Pccard Faculy of Informaon echnology Unversy of echnology, Sydney massmo@.us.edu.au Absrac In hs aer, we
More informationLecture 18: The Laplace Transform (See Sections and 14.7 in Boas)
Lecure 8: The Lalace Transform (See Secons 88- and 47 n Boas) Recall ha our bg-cure goal s he analyss of he dfferenal equaon, ax bx cx F, where we emloy varous exansons for he drvng funcon F deendng on
More informationLecture Slides for INTRODUCTION TO. Machine Learning. ETHEM ALPAYDIN The MIT Press,
Lecure Sdes for INTRODUCTION TO Machne Learnng ETHEM ALPAYDIN The MIT Press, 2004 aaydn@boun.edu.r h://www.cme.boun.edu.r/~ehem/2m CHAPTER 7: Cuserng Semaramerc Densy Esmaon Paramerc: Assume a snge mode
More informationNormal Random Variable and its discriminant functions
Noral Rando Varable and s dscrnan funcons Oulne Noral Rando Varable Properes Dscrnan funcons Why Noral Rando Varables? Analycally racable Works well when observaon coes for a corruped snle prooype 3 The
More informationCalculating Model Parameters Using Gaussian Mixture Models; Based on Vector Quantization in Speaker Identification
IJCSNS Inernaonal Journal of Comuer Scence and Newor Secury, VOL.7 No., February 07 3 Calculang Model Parameers Usng Gaussan Mxure Models; Based on Vecor Quanzaon n Seaer Idenfcaon Hamdeh Rezae-Nezhad
More informationRobustness Experiments with Two Variance Components
Naonal Insue of Sandards and Technology (NIST) Informaon Technology Laboraory (ITL) Sascal Engneerng Dvson (SED) Robusness Expermens wh Two Varance Componens by Ana Ivelsse Avlés avles@ns.gov Conference
More informationBayesian Decision Theory
No.4 Bayesan Decson Theory Hu Jang Deartment of Electrcal Engneerng and Comuter Scence Lassonde School of Engneerng York Unversty, Toronto, Canada Outlne attern Classfcaton roblems Bayesan Decson Theory
More informationGraduate Macroeconomics 2 Problem set 5. - Solutions
Graduae Macroeconomcs 2 Problem se. - Soluons Queson 1 To answer hs queson we need he frms frs order condons and he equaon ha deermnes he number of frms n equlbrum. The frms frs order condons are: F K
More informationPattern Classification (II) 杜俊
attern lassfcaton II 杜俊 junu@ustc.eu.cn Revew roalty & Statstcs Bayes theorem Ranom varales: screte vs. contnuous roalty struton: DF an DF Statstcs: mean, varance, moment arameter estmaton: MLE Informaton
More informationEP2200 Queuing theory and teletraffic systems. 3rd lecture Markov chains Birth-death process - Poisson process. Viktoria Fodor KTH EES
EP Queung heory and eleraffc sysems 3rd lecure Marov chans Brh-deah rocess - Posson rocess Vora Fodor KTH EES Oulne for oday Marov rocesses Connuous-me Marov-chans Grah and marx reresenaon Transen and
More informationLearning of Graphical Models Parameter Estimation and Structure Learning
Learg of Grahal Models Parameer Esmao ad Sruure Learg e Fukumzu he Isue of Sasal Mahemas Comuaoal Mehodology Sasal Iferee II Work wh Grahal Models Deermg sruure Sruure gve by modelg d e.g. Mxure model
More informationEcon107 Applied Econometrics Topic 5: Specification: Choosing Independent Variables (Studenmund, Chapter 6)
Econ7 Appled Economercs Topc 5: Specfcaon: Choosng Independen Varables (Sudenmund, Chaper 6 Specfcaon errors ha we wll deal wh: wrong ndependen varable; wrong funconal form. Ths lecure deals wh wrong ndependen
More informationBayesian Learning based Negotiation Agents for Supporting Negotiation with Incomplete Information
ayesan Learnng base Negoaon Agens for upporng Negoaon wh Incomplee Informaon Jeonghwan Gwak an Kwang Mong m Absrac An opmal negoaon agen shoul have capably for mamzng s uly even for negoaon wh ncomplee
More informationHidden Markov Models
11-755 Machne Learnng for Sgnal Processng Hdden Markov Models Class 15. 12 Oc 2010 1 Admnsrva HW2 due Tuesday Is everyone on he projecs page? Where are your projec proposals? 2 Recap: Wha s an HMM Probablsc
More informationDigital Speech Processing Lecture 20. The Hidden Markov Model (HMM)
Dgal Speech Processng Lecure 20 The Hdden Markov Model (HMM) Lecure Oulne Theory of Markov Models dscree Markov processes hdden Markov processes Soluons o he Three Basc Problems of HMM s compuaon of observaon
More informationハイブリッドモンテカルロ法に よる実現確率的ボラティリティモデルのベイズ推定
ハイブリッドモンテカルロ法に よる実現確率的ボラティリティモデルのベイズ推定 Tesuya Takas Hrosma Unversy of Economcs Oulne of resenaon 1 Inroducon Realzed volaly 3 Realzed socasc volaly 4 Bayesan nference 5 Hybrd Mone Carlo 6 Mnmum Norm negraor
More informationMIMA Group. Chapter 2 Bayesian Decision Theory. School of Computer Science and Technology, Shandong University. Xin-Shun SDU
Group M D L M Chapter Bayesan Decson heory Xn-Shun Xu @ SDU School of Computer Scence and echnology, Shandong Unversty Bayesan Decson heory Bayesan decson theory s a statstcal approach to data mnng/pattern
More informationMachine learning: Density estimation
CS 70 Foundatons of AI Lecture 3 Machne learnng: ensty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 539 Sennott Square ata: ensty estmaton {.. n} x a vector of attrbute values Objectve: estmate the model of
More informationCS 536: Machine Learning. Nonparametric Density Estimation Unsupervised Learning - Clustering
CS 536: Machne Learnng Nonparamerc Densy Esmaon Unsupervsed Learnng - Cluserng Fall 2005 Ahmed Elgammal Dep of Compuer Scence Rugers Unversy CS 536 Densy Esmaon - Cluserng - 1 Oulnes Densy esmaon Nonparamerc
More informationFACIAL IMAGE FEATURE EXTRACTION USING SUPPORT VECTOR MACHINES
FACIAL IMAGE FEATURE EXTRACTION USING SUPPORT VECTOR MACHINES H. Abrsham Moghaddam K. N. Toos Unversy of Technology, P.O. Box 635-355, Tehran, Iran moghadam@saba.knu.ac.r M. Ghayoum Islamc Azad Unversy,
More informationEndogeneity. Is the term given to the situation when one or more of the regressors in the model are correlated with the error term such that
s row Endogeney Is he erm gven o he suaon when one or more of he regressors n he model are correlaed wh he error erm such ha E( u 0 The 3 man causes of endogeney are: Measuremen error n he rgh hand sde
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 information5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015)
5h Inernaonal onference on Advanced Desgn and Manufacurng Engneerng (IADME 5 The Falure Rae Expermenal Sudy of Specal N Machne Tool hunshan He, a, *, La Pan,b and Bng Hu 3,c,,3 ollege of Mechancal and
More informationPavel Azizurovich Rahman Ufa State Petroleum Technological University, Kosmonavtov St., 1, Ufa, Russian Federation
VOL., NO. 5, MARCH 8 ISSN 89-668 ARN Journal of Engneerng and Aled Scences 6-8 Asan Research ublshng Nework ARN. All rghs reserved. www.arnjournals.com A CALCULATION METHOD FOR ESTIMATION OF THE MEAN TIME
More informationChapter 6: AC Circuits
Chaper 6: AC Crcus Chaper 6: Oulne Phasors and he AC Seady Sae AC Crcus A sable, lnear crcu operang n he seady sae wh snusodal excaon (.e., snusodal seady sae. Complee response forced response naural response.
More informationStatistical Paradigm
EE 688 Overvew of Sascal Models for Vdeo Indexng Prof. ShhFu Chang Columba Unversy TA: Erc Zavesky Fall 7, Lecure 4 Course web se: hp://www.ee.columba.edu/~sfchang/course/sva Sascal Paradgm Many problems
More information( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model
BGC1: Survval and even hsory analyss Oslo, March-May 212 Monday May 7h and Tuesday May 8h The addve regresson model Ørnulf Borgan Deparmen of Mahemacs Unversy of Oslo Oulne of program: Recapulaon Counng
More informationFTCS Solution to the Heat Equation
FTCS Soluon o he Hea Equaon ME 448/548 Noes Gerald Reckenwald Porland Sae Unversy Deparmen of Mechancal Engneerng gerry@pdxedu ME 448/548: FTCS Soluon o he Hea Equaon Overvew Use he forward fne d erence
More informationClustering with Gaussian Mixtures
Noe o oher eachers and users of hese sldes. Andrew would be delghed f you found hs source maeral useful n gvng your own lecures. Feel free o use hese sldes verbam, or o modfy hem o f your own needs. PowerPon
More informationImperfect Information
Imerfec Informaon Comlee Informaon - all layers know: Se of layers Se of sraeges for each layer Oucomes as a funcon of he sraeges Payoffs for each oucome (.e. uly funcon for each layer Incomlee Informaon
More informationConsider processes where state transitions are time independent, i.e., System of distinct states,
Dgal Speech Processng Lecure 0 he Hdden Marov Model (HMM) Lecure Oulne heory of Marov Models dscree Marov processes hdden Marov processes Soluons o he hree Basc Problems of HMM s compuaon of observaon
More informationOutline. Energy-Efficient Target Coverage in Wireless Sensor Networks. Sensor Node. Introduction. Characteristics of WSN
Ener-Effcen Tare Coverae n Wreless Sensor Newors Presened b M Trà Tá -4-4 Inroducon Bacround Relaed Wor Our Proosal Oulne Maxmum Se Covers (MSC) Problem MSC Problem s NP-Comlee MSC Heursc Concluson Sensor
More informationM. Y. Adamu Mathematical Sciences Programme, AbubakarTafawaBalewa University, Bauchi, Nigeria
IOSR Journal of Mahemacs (IOSR-JM e-issn: 78-578, p-issn: 9-765X. Volume 0, Issue 4 Ver. IV (Jul-Aug. 04, PP 40-44 Mulple SolonSoluons for a (+-dmensonalhroa-sasuma shallow waer wave equaon UsngPanlevé-Bӓclund
More informationCurves. Curves. Many objects we want to model are not straight. How can we represent a curve? Ex. Text, sketches, etc.
Curves Ton Sellarès Unversa e Grona Curves Many objecs we wan o moel are no sragh. Ex. Tex skeches ec. How can we reresen a curve? A large number of ons on he curve. Aroxmae wh connece lne segmens. ecewse
More informationROC Curves for Multivariate Biometric Matching Models
ROC Curves for Mulvarae Bomerc Machng Moels Sung-Hyuk Cha an Charles C. Tapper Absrac The bomerc machng problem s a wo class whn or beween ) classfcaon problem where wo ypes of errors an ) occur. Whle
More informationVideo-Based Face Recognition Using Adaptive Hidden Markov Models
Vdeo-Based Face Recognon Usng Adapve Hdden Markov Models Xaomng Lu and suhan Chen Elecrcal and Compuer Engneerng, Carnege Mellon Unversy, Psburgh, PA, 523, U.S.A. xaomng@andrew.cmu.edu suhan@cmu.edu Absrac
More informationJohn Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany
Herarchcal Markov Normal Mxure models wh Applcaons o Fnancal Asse Reurns Appendx: Proofs of Theorems and Condonal Poseror Dsrbuons John Geweke a and Gann Amsano b a Deparmens of Economcs and Sascs, Unversy
More informationFI 3103 Quantum Physics
/9/4 FI 33 Quanum Physcs Aleander A. Iskandar Physcs of Magnesm and Phooncs Research Grou Insu Teknolog Bandung Basc Conces n Quanum Physcs Probably and Eecaon Value Hesenberg Uncerany Prncle Wave Funcon
More informationAuthor s Accepted Manuscript
Auhor s Acceped anuscrp Dscrmnave srucure selecon mehod of gaussan mxure models wh s applcaon o handwren dg recognon Xuefeng Chen Xab Lu Yunde Ja PII: S095-3(0)0047-6 DOI: do:0.06/j.neucom.00..00 Reference:
More informationDEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL
DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL Sco Wsdom, John Hershey 2, Jonahan Le Roux 2, and Shnj Waanabe 2 Deparmen o Elecrcal Engneerng, Unversy o Washngon, Seale, WA, USA
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
Ths documen s downloaded from DR-NTU, Nanyang Technologcal Unversy Lbrary, Sngapore. Tle A smplfed verb machng algorhm for word paron n vsual speech processng( Acceped verson ) Auhor(s) Foo, Say We; Yong,
More informationAdvanced time-series analysis (University of Lund, Economic History Department)
Advanced me-seres analss (Unvers of Lund, Economc Hsor Dearmen) 3 Jan-3 Februar and 6-3 March Lecure 4 Economerc echnues for saonar seres : Unvarae sochasc models wh Box- Jenns mehodolog, smle forecasng
More informationTime-interval analysis of β decay. V. Horvat and J. C. Hardy
Tme-nerval analyss of β decay V. Horva and J. C. Hardy Work on he even analyss of β decay [1] connued and resuled n he developmen of a novel mehod of bea-decay me-nerval analyss ha produces hghly accurae
More informationIn the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!
ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL The frs hng o es n wo-way ANOVA: Is here neracon? "No neracon" means: The man effecs model would f. Ths n urn means: In he neracon plo (wh A on he horzonal
More informationENG 8801/ Special Topics in Computer Engineering: Pattern Recognition. Memorial University of Newfoundland Pattern Recognition
EG 880/988 - Specal opcs n Computer Engneerng: Pattern Recognton Memoral Unversty of ewfoundland Pattern Recognton Lecture 7 May 3, 006 http://wwwengrmunca/~charlesr Offce Hours: uesdays hursdays 8:30-9:30
More informationABSTRACT KEYWORDS. Bonus-malus systems, frequency component, severity component. 1. INTRODUCTION
EERAIED BU-MAU YTEM ITH A FREQUECY AD A EVERITY CMET A IDIVIDUA BAI I AUTMBIE IURACE* BY RAHIM MAHMUDVAD AD HEI HAAI ABTRACT Frangos and Vronos (2001) proposed an opmal bonus-malus sysems wh a frequency
More informationEEL 6266 Power System Operation and Control. Chapter 5 Unit Commitment
EEL 6266 Power Sysem Operaon and Conrol Chaper 5 Un Commmen Dynamc programmng chef advanage over enumeraon schemes s he reducon n he dmensonaly of he problem n a src prory order scheme, here are only N
More informationDishonest casino as an HMM
Dshnes casn as an HMM N = 2, ={F,L} M=2, O = {h,} A = F B= [. F L F L 0.95 0.0 0] h 0.5 0. L 0.05 0.90 0.5 0.9 c Deva ubramanan, 2009 63 A generave mdel fr CpG slands There are w hdden saes: CpG and nn-cpg.
More informationTranscription: Messenger RNA, mrna, is produced and transported to Ribosomes
Quanave Cenral Dogma I Reference hp//book.bonumbers.org Inaon ranscrpon RNA polymerase and ranscrpon Facor (F) s bnds o promoer regon of DNA ranscrpon Meenger RNA, mrna, s produced and ranspored o Rbosomes
More informationCHAPTER 7: CLUSTERING
CHAPTER 7: CLUSTERING Semparamerc Densy Esmaon 3 Paramerc: Assume a snge mode for p ( C ) (Chapers 4 and 5) Semparamerc: p ( C ) s a mure of denses Mupe possbe epanaons/prooypes: Dfferen handwrng syes,
More informationAttribute Reduction Algorithm Based on Discernibility Matrix with Algebraic Method GAO Jing1,a, Ma Hui1, Han Zhidong2,b
Inernaonal Indusral Informacs and Compuer Engneerng Conference (IIICEC 05) Arbue educon Algorhm Based on Dscernbly Marx wh Algebrac Mehod GAO Jng,a, Ma Hu, Han Zhdong,b Informaon School, Capal Unversy
More informationUsing Fuzzy Pattern Recognition to Detect Unknown Malicious Executables Code
Usng Fuzzy Paern Recognon o Deec Unknown Malcous Execuables Code Boyun Zhang,, Janpng Yn, and Jngbo Hao School of Compuer Scence, Naonal Unversy of Defense Technology, Changsha 40073, Chna hnxzby@yahoo.com.cn
More information(,,, ) (,,, ). In addition, there are three other consumers, -2, -1, and 0. Consumer -2 has the utility function
MACROECONOMIC THEORY T J KEHOE ECON 87 SPRING 5 PROBLEM SET # Conder an overlappng generaon economy le ha n queon 5 on problem e n whch conumer lve for perod The uly funcon of he conumer born n perod,
More informationSupervised Learning in Multilayer Networks
Copyrgh Cambrdge Unversy Press 23. On-screen vewng permed. Prnng no permed. hp://www.cambrdge.org/521642981 You can buy hs book for 3 pounds or $5. See hp://www.nference.phy.cam.ac.uk/mackay/la/ for lnks.
More informationMachine Learning for Language Technology Lecture 8: Decision Trees and k- Nearest Neighbors
Machne Learnng for Language Technology Lecture 8: Decson Trees and k- Nearest Neghbors Marna San:n Department of Lngus:cs and Phlology Uppsala Unversty, Uppsala, Sweden Autumn 2014 Acknowledgement: Thanks
More informationInverse Joint Moments of Multivariate. Random Variables
In J Conem Mah Scences Vol 7 0 no 46 45-5 Inverse Jon Momens of Mulvarae Rom Varables M A Hussan Dearmen of Mahemacal Sascs Insue of Sascal Sudes Research ISSR Caro Unversy Egy Curren address: Kng Saud
More informationBayesian Inference of the GARCH model with Rational Errors
0 Inernaonal Conference on Economcs, Busness and Markeng Managemen IPEDR vol.9 (0) (0) IACSIT Press, Sngapore Bayesan Inference of he GARCH model wh Raonal Errors Tesuya Takash + and Tng Tng Chen Hroshma
More informationMLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012
MLE and Bayesan Estmaton Je Tang Department of Computer Scence & Technology Tsnghua Unversty 01 1 Lnear Regresson? As the frst step, we need to decde how we re gong to represent the functon f. One example:
More informationBeyond Balanced Growth : Some Further Results
eyond alanced Growh : Some Furher Resuls by Dens Sec and Helmu Wagner Dscusson Paer o. 49 ay 27 Dskussonsberäge der Fakulä für Wrschafswssenschaf der FernUnversä n Hagen Herausgegeben vom Dekan der Fakulä
More informationFiltrage particulaire et suivi multi-pistes Carine Hue Jean-Pierre Le Cadre and Patrick Pérez
Chaînes de Markov cachées e flrage parculare 2-22 anver 2002 Flrage parculare e suv mul-pses Carne Hue Jean-Perre Le Cadre and Parck Pérez Conex Applcaons: Sgnal processng: arge rackng bearngs-onl rackng
More informationDensity estimation III.
Lecure 6 esy esmao III. Mlos Hausrec mlos@cs..eu 539 Seo Square Oule Oule: esy esmao: Bomal srbuo Mulomal srbuo ormal srbuo Eoeal famly aa: esy esmao {.. } a vecor of arbue values Objecve: ry o esmae e
More informationSupport Vector Machines
Separatng boundary, defned by w Support Vector Machnes CISC 5800 Professor Danel Leeds Separatng hyperplane splts class 0 and class 1 Plane s defned by lne w perpendcular to plan Is data pont x n class
More informationNew M-Estimator Objective Function. in Simultaneous Equations Model. (A Comparative Study)
Inernaonal Mahemacal Forum, Vol. 8, 3, no., 7 - HIKARI Ld, www.m-hkar.com hp://dx.do.org/.988/mf.3.3488 New M-Esmaor Objecve Funcon n Smulaneous Equaons Model (A Comparave Sudy) Ahmed H. Youssef Professor
More informationMarkov Chain applications to non parametric option pricing theory
IJCSS Inernaonal Journal of Comuer Scence and ewor Secury, VOL.8 o.6, June 2008 99 Marov Chan alcaons o non aramerc oon rcng heory Summary In hs aer we roose o use a Marov chan n order o rce conngen clams.
More informationComparison of the Bayesian and Maximum Likelihood Estimation for Weibull Distribution
Joural of Mahemacs ad Sascs 6 (2): 1-14, 21 ISSN 1549-3644 21 Scece Publcaos Comarso of he Bayesa ad Maxmum Lkelhood Esmao for Webull Dsrbuo Al Omar Mohammed Ahmed, Hadeel Salm Al-Kuub ad Noor Akma Ibrahm
More informationOnline Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading
Onlne Supplemen for Dynamc Mul-Technology Producon-Invenory Problem wh Emssons Tradng by We Zhang Zhongsheng Hua Yu Xa and Baofeng Huo Proof of Lemma For any ( qr ) Θ s easy o verfy ha he lnear programmng
More information