CHAPTER 10: LINEAR DISCRIMINATION

Similar documents
CHAPTER 10: LINEAR DISCRIMINATION

CptS 570 Machine Learning School of EECS Washington State University. CptS Machine Learning 1

Name of the Student:

5-1. We apply Newton s second law (specifically, Eq. 5-2). F = ma = ma sin 20.0 = 1.0 kg 2.00 m/s sin 20.0 = 0.684N. ( ) ( )

Advanced Machine Learning & Perception

1 Constant Real Rate C 1

CHAPTER 2: Supervised Learning

Chapter 3: Vectors and Two-Dimensional Motion

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4

Field due to a collection of N discrete point charges: r is in the direction from

Lecture 5. Plane Wave Reflection and Transmission

( ) ( )) ' j, k. These restrictions in turn imply a corresponding set of sample moment conditions:

L4:4. motion from the accelerometer. to recover the simple flutter. Later, we will work out how. readings L4:3

( ) [ ] MAP Decision Rule

Machine Learning Linear Regression

CHAPTER 3 DETECTION TECHNIQUES FOR MIMO SYSTEMS

Modern Energy Functional for Nuclei and Nuclear Matter. By: Alberto Hinojosa, Texas A&M University REU Cyclotron 2008 Mentor: Dr.

Maximum Likelihood Estimation

Support Vector Machines

Dishonest casino as an HMM

Lecture VI Regression

CHAPTER 7: CLUSTERING

Clustering (Bishop ch 9)

I-POLYA PROCESS AND APPLICATIONS Leda D. Minkova

In the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!

Lecture 11 SVM cont

GMM parameter estimation. Xiaoye Lu CMPS290c Final Project

N 1. Time points are determined by the

When to Treat Prostate Cancer Patients Based on their PSA Dynamics

Sections 3.1 and 3.4 Exponential Functions (Growth and Decay)

Go over vector and vector algebra Displacement and position in 2-D Average and instantaneous velocity in 2-D Average and instantaneous acceleration

Lecture 6: Learning for Control (Generalised Linear Regression)

ANSWERS TO ODD NUMBERED EXERCISES IN CHAPTER 2

CHAPTER 5: MULTIVARIATE METHODS

UNIT10 PLANE OF REGRESSION

Variants of Pegasos. December 11, 2009

ScienceDirect. Behavior of Integral Curves of the Quasilinear Second Order Differential Equations. Alma Omerspahic *

University of California, Davis Date: June xx, PRELIMINARY EXAMINATION FOR THE Ph.D. DEGREE ANSWER KEY

Machine Learning 4771

Appendix H: Rarefaction and extrapolation of Hill numbers for incidence data

s = rθ Chapter 10: Rotation 10.1: What is physics?

p E p E d ( ) , we have: [ ] [ ] [ ] Using the law of iterated expectations, we have:

Computing Relevance, Similarity: The Vector Space Model

The Backpropagation Algorithm

Rotations.

( ) α is determined to be a solution of the one-dimensional minimization problem: = 2. min = 2

) from i = 0, instead of i = 1, we have =

Department of Economics University of Toronto

A Brief Guide to Recognizing and Coping With Failures of the Classical Regression Assumptions

FIRMS IN THE TWO-PERIOD FRAMEWORK (CONTINUED)

2 shear strain / L for small angle

Lecture 2 L n i e n a e r a M od o e d l e s

Solution in semi infinite diffusion couples (error function analysis)

Chapter I Matrices, Vectors, & Vector Calculus 1-1, 1-9, 1-10, 1-11, 1-17, 1-18, 1-25, 1-27, 1-36, 1-37, 1-41.

An introduction to Support Vector Machine

Anomaly Detection. Lecture Notes for Chapter 9. Introduction to Data Mining, 2 nd Edition by Tan, Steinbach, Karpatne, Kumar

Lecture Slides for INTRODUCTION TO. Machine Learning. ETHEM ALPAYDIN The MIT Press,

Bayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance

Fall 2010 Graduate Course on Dynamic Learning

ENGI 4430 Advanced Calculus for Engineering Faculty of Engineering and Applied Science Problem Set 9 Solutions [Theorems of Gauss and Stokes]

Chapter Fifiteen. Surfaces Revisited

Physics 11b Lecture #2. Electric Field Electric Flux Gauss s Law

Dynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005

Set of square-integrable function 2 L : function space F

Chapter 6 DETECTION AND ESTIMATION: Model of digital communication system. Fundamental issues in digital communications are

Detection and Estimation Theory

Normal Random Variable and its discriminant functions

ESS 265 Spring Quarter 2005 Kinetic Simulations

19 The Born-Oppenheimer Approximation

Today - Lecture 13. Today s lecture continue with rotations, torque, Note that chapters 11, 12, 13 all involve rotations

( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model

Lecture Slides for INTRODUCTION TO. Machine Learning. ETHEM ALPAYDIN The MIT Press,

Exponential and Logarithmic Equations and Properties of Logarithms. Properties. Properties. log. Exponential. Logarithmic.

Structural Optimization Using Metamodels

PHYS 1443 Section 001 Lecture #4

MCTDH Approach to Strong Field Dynamics

Chapter Finite Difference Method for Ordinary Differential Equations

Professor Joseph Nygate, PhD

Outline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model

Mechanics Physics 151

Solution to Problem First, the firm minimizes the cost of the inputs: min wl + rk + sf

J i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes.

7 Wave Equation in Higher Dimensions

COMPUTER SCIENCE 349A SAMPLE EXAM QUESTIONS WITH SOLUTIONS PARTS 1, 2

Linear Algebra Math 221

Course Outline. 1. MATLAB tutorial 2. Motion of systems that can be idealized as particles

THEORETICAL AUTOCORRELATIONS. ) if often denoted by γ. Note that

to Assess Climate Change Mitigation International Energy Workshop, Paris, June 2013

Scalars and Vectors Scalar

Discriminative classifier: Logistic Regression. CS534-Machine Learning

Chapters 2 Kinematics. Position, Distance, Displacement

Review of Vector Algebra and Vector Calculus Operations

Displacement, Velocity, and Acceleration. (WHERE and WHEN?)

MATHEMATICAL FOUNDATIONS FOR APPROXIMATING PARTICLE BEHAVIOUR AT RADIUS OF THE PLANCK LENGTH

Pattern Classification

Robustness Experiments with Two Variance Components

Suppose we have observed values t 1, t 2, t n of a random variable T.

Unsupervised Cross-Domain Transfer in Policy Gradient Reinforcement Learning via Manifold Alignment

24-2: Electric Potential Energy. 24-1: What is physics

Backcalculation Analysis of Pavement-layer Moduli Using Pattern Search Algorithms

Transcription:

HAPER : LINEAR DISRIMINAION

Dscmnan-based lassfcaon 3 In classfcaon h K classes ( k ) We defned dsmnan funcon g () = K hen gven an es eample e chose (pedced) s class label as f g () as he mamum among g () g () g k () In pevous chapes e have Used g ()= P( ) hs s called lkelhood classfcaon Whee e used mamum lkelhood esmae echnque fo esmae class lkelhood P( )

4 Lkelhood- vs. Dscmnan-based lassfcaon Lkelhood-based: Assume a model fo p( ) use Baes ule o calculae P( ) g () = P( ) hs eques esmang class condonal denses P( ) Fo hgh-dmensonal daa (man abues/feaues) esmang class condonal denses self s a dffcul ask Dscmnan-based: Assume a model fo g (Φ ); no dens esmaon Paamees Φ descbe he class bounda Esmang he class bounda s enough fo pefomng classfcaon no need o accuael esmae he denses nsde he boundaes

Lnea Dscmnan 5 Lnea dscmnan: g Advanages: Smple: O(d) space/compuaon (d s he numbe of feaues) Knoledge eacon: Weghed sum of abues; posve/negave eghs magnudes (ced scong) Opmal hen p( ) ae Gaussan h shaed cov ma; useful hen classes ae (almos) lneal sepaable d

Quadac dscmnan: Hghe-ode (poduc) ems: Map fom o z usng nonlnea bass funcons and use a lnea dscmnan n z-space Genealzed Lnea Model 6 5 4 3 z z z z z g W W k g

Genealzed Lnea Model 7 Eample of non-lnea bass funcons: sn() ep(-( -m) /c) ep(--m /c) Log( ) ( >c) (a +b >c)

o lasses g g g ohese f choose g 8

9 Geome

Undesandng he geome Le he dscmnan funcon s gven b g()= + + = + hee =( ) ake an o pons lng on he decson suface (bounda) g()= g( )=g( )= + = + => ( - )= Noe ha ( - ) s a veco lng on he decson suface (hpeplane) hch means s nomal o an veco lng on he decson suface

Undesandng he geome An daa pon can be en as a sum of o vecos as follos = p +(/) p s nomal poecon of on o decson hpe plane ( p les on he decson hpeplane) s dsance of o he hpeplane g()= + = ( p +(/)+= ( p + )+( )/= /= => =g()/ Smlal f = ll denoe dsance of he hpeplane fom he ogn g()= = => = /

Mulple lasses g hoos e g K mag f lasses ae lneal sepaable

Mulple classes 3 Dung esng gven deall e should have onl one g () = K geae han zeo and all ohes should be less han Hoeve hs s no alas he case Posve half spaces of he hpeplane s ma ovelap O e ma have all g ()< hese ma be aken as eec case Remembeng ha g ()/ s he dsance fom he npu pon o he decson hpeplane assumng all have smla lengh hs assgns pon o he class (among all g ()>) o hose decson hpeplane he pon s mos dsan

Pase Sepaaon g g don' cae f f ohese choos e g f If classes ae no lneal sepaable bu pase lneal sepaable use K(K-)/) pase 4 dscmnans

If he class denses ae Gaussan and shae a common covaance ma he dscmnan funcon s lnea hen p ( ) ~ N ( μ ) Fo he specal case hen hee ae o classes e defne (/(-) s knon as ansfomaon of odds of Fom Dscmnans o Poseos 5 P g μ μ μ ohese and f choose and 5 P P / /.

P P P P P p P p P d / / ep / μ μ d / / ep / μ μ hee μ μ μ μ μ μ he nvese of s sc o sgmod funcon P P sgmod P ep P P 6

Sgmod (Logsc) Funcon 7 alculaeg alculae sgmod andchoose o andchoose f. 5 f g

Gaden-Descen 8 E(X) s eo h paamees on sample X *=ag mn E( X) Gaden E E E E... Gaden-descen: Sas fom andom and updaes eavel n he negave decon of gaden d

Gaden-Descen 9 E E ( ) E ( + ) + η

Gaden-Descen

Gaden-Descen

Logsc Dscmnaon P P P P P p p P P P p p o o ep hee ˆ o classes: Assume lkelhood ao s lnea

anng: o lasses 3 E l E l P ep Benoull X X X ~

anng: Gaden-Descen 4 E d E da d E... sgmoda If X

5

6

K> lasses 7 K o K K E l K P p p... ep ep ˆ ~ Mul X X X sofma

8

Quadac: Sum of bass funcons: hee φ() ae bass funcons. Eamples: Hdden uns n neual neoks (hapes and ) Kenels n SVM (hape 3) Genealzng he Lnea Model 3 K p p W K p p

Dscmnaon b Regesson 3 E l X X N ep ep sgmod hee ~ lasses ae NO muuall eclusve and ehausve

Leanng o Rank 3 Rankng: A dffeen poblem han classfcaon o egesson Le us sa u and v ae o nsances e.g. o moves We pefe u o v mples ha g( u )>g( v ) hee g() s a scoe funcon hee lnea: g()= Fnd a decon such ha e ge he desed anks hen nsances ae poeced along