DOC PREVIEW
CMU CS 10701 - Support Vector Machines

This preview shows page 1-2-15-16-17-32-33 out of 33 pages.

Save
View full document
Premium Document
Do you want full access? Go Premium and unlock all 33 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Support Vector Machines Note to other teachers and users of these slides Andrew would be delighted if you found this source material useful in giving your own lectures Feel free to use these slides verbatim or to modify them to fit your own needs PowerPoint originals are available If you make use of a significant portion of these slides in your own lecture please include this message or the following link to the source repository of Andrew s tutorials http www cs cmu edu awm tutorials Comments and corrections gratefully received Andrew W Moore Professor School of Computer Science Carnegie Mellon University www cs cmu edu awm awm cs cmu edu 412 268 7599 Copyright 2001 2003 Andrew W Moore Linear Classifiers x denotes 1 Nov 23rd 2001 f yest f x w b sign w x b denotes 1 How would you classify this data Copyright 2001 2003 Andrew W Moore Support Vector Machines Slide 2 1 Linear Classifiers x f yest f x w b sign w x b denotes 1 denotes 1 How would you classify this data Copyright 2001 2003 Andrew W Moore Support Vector Machines Slide 3 Linear Classifiers x denotes 1 f yest f x w b sign w x b denotes 1 How would you classify this data Copyright 2001 2003 Andrew W Moore Support Vector Machines Slide 4 2 Linear Classifiers x f yest f x w b sign w x b denotes 1 denotes 1 How would you classify this data Copyright 2001 2003 Andrew W Moore Support Vector Machines Slide 5 Linear Classifiers x denotes 1 f yest f x w b sign w x b denotes 1 Any of these would be fine but which is best Copyright 2001 2003 Andrew W Moore Support Vector Machines Slide 6 3 Classifier Margin x f f x w b sign w x b denotes 1 Define the margin of a linear classifier as the width that the boundary could be increased by before hitting a datapoint denotes 1 Copyright 2001 2003 Andrew W Moore Support Vector Machines Slide 7 Maximum Margin x denotes 1 f yest f x w b sign w x b The maximum margin linear classifier is the linear classifier with the um maximum margin denotes 1 Linear SVM Copyright 2001 2003 Andrew W Moore yest This is the simplest kind of SVM Called an LSVM Support Vector Machines Slide 8 4 Maximum Margin x denotes 1 f f x w b sign w x b The maximum margin linear classifier is the linear classifier with the um maximum margin denotes 1 Support Vectors are those datapoints that the margin pushes up against Linear SVM Copyright 2001 2003 Andrew W Moore yest This is the simplest kind of SVM Called an LSVM Support Vector Machines Slide 9 Why Maximum Margin 1 Intuitively this feels safest denotes 1 denotes 1 Support Vectors are those datapoints that the margin pushes up against f x w b sign w b 2 If we ve made a small error inx the location of the boundary it s been The maximum jolted in its perpendicular direction this gives us leastmargin chance linear of causing a misclassification classifier is the 3 LOOCV is easy since the classifier model is linear immune to removal of any with the nonum support vector datapoints maximum margin 4 There s some theory using VC is the dimension that isThis related to but not kind the same as thesimplest proposition thatof this is a good thing SVM Called an LSVM 5 Empirically it works very very well Copyright 2001 2003 Andrew W Moore Support Vector Machines Slide 10 5 Specifying a line and margin Pr s las e C t c zon edi Pr 1 s las C t c zone edi 1 Plus Plane Classifier Boundary Minus Plane How do we represent this mathematically in m input dimensions Copyright 2001 2003 Andrew W Moore Pr s las e C t c zon edi Pr 1 s las C ct zone edi 1 Copyright 2001 2003 Andrew W Moore Support Vector Machines Slide 11 Plus Plane Classifier Boundary Minus Plane Support Vector Machines Slide 12 6 Specifying a line and margin Pr s las e C t c zon edi 1 b wx 0 b wx b 1 wx Pr 1 s las C t c zone edi 1 Plus Plane Classifier Boundary Minus Plane Plus plane x w x b 1 Minus plane x w x b 1 if w x b 1 1 if w x b 1 Universe explodes if 1 w x b 1 Classify as 1 Copyright 2001 2003 Andrew W Moore Support Vector Machines Slide 13 Computing the margin width 1 s las t C one c i z ed Pr 1 b wx 0 b wx b 1 wx s las C t c zone edi r P M Margin Width 1 How do we compute M in terms of w and b Plus plane x w x b 1 Minus plane x w x b 1 Claim The vector w is perpendicular to the Plus Plane Why Copyright 2001 2003 Andrew W Moore Support Vector Machines Slide 14 7 Computing the margin width Pr s las e C t c zon edi 1 b wx 0 b wx b 1 wx Pr 1 s las C t c zone edi M Margin Width 1 How do we compute M in terms of w and b Plus plane x w x b 1 Minus plane x w x b 1 Claim The vector w is perpendicular to the Plus Plane Why Let u and v be two vectors on the Plus Plane What is w u v And so of course the vector w is also perpendicular to the Minus Plane Copyright 2001 2003 Andrew W Moore Support Vector Machines Slide 15 Computing the margin width 1 x M Margin Width ss a l ct C zone edi r P 1 How do we compute x s s M in terms of w 1 Cla b ict zone 0 wx d e b 1 and b Pr wx b wx Plus plane x w x b 1 Minus plane x w x b 1 The vector w is perpendicular to the Plus Plane Let x be any point on the minus plane Let x be the closest plus plane point to x Copyright 2001 2003 Andrew W Moore Any location in not mm not R necessarily a datapoint Support Vector Machines Slide 16 8 Computing the margin width Pr s las e C t c zon edi 1 b wx 0 b wx b 1 wx Pr 1 x M Margin Width 1 sx las C e t c zon edi How do we compute M in terms of w and b Plus plane x w x b 1 Minus plane x w x b 1 The vector w is perpendicular to the Plus Plane Let x be any point on the minus plane Let x be the closest plus plane point to x Claim x x w for some value of Why Copyright 2001 2003 Andrew W Moore Support Vector Machines …


View Full Document

CMU CS 10701 - Support Vector Machines

Documents in this Course
lecture

lecture

12 pages

lecture

lecture

17 pages

HMMs

HMMs

40 pages

lecture

lecture

15 pages

lecture

lecture

20 pages

Notes

Notes

10 pages

Notes

Notes

15 pages

Lecture

Lecture

22 pages

Lecture

Lecture

13 pages

Lecture

Lecture

24 pages

Lecture9

Lecture9

38 pages

lecture

lecture

26 pages

lecture

lecture

13 pages

Lecture

Lecture

5 pages

lecture

lecture

18 pages

lecture

lecture

22 pages

Boosting

Boosting

11 pages

lecture

lecture

16 pages

lecture

lecture

20 pages

Lecture

Lecture

20 pages

Lecture

Lecture

39 pages

Lecture

Lecture

14 pages

Lecture

Lecture

18 pages

Lecture

Lecture

13 pages

Exam

Exam

10 pages

Lecture

Lecture

27 pages

Lecture

Lecture

15 pages

Lecture

Lecture

24 pages

Lecture

Lecture

16 pages

Lecture

Lecture

23 pages

Lecture6

Lecture6

28 pages

Notes

Notes

34 pages

lecture

lecture

15 pages

Midterm

Midterm

11 pages

lecture

lecture

11 pages

lecture

lecture

23 pages

Boosting

Boosting

35 pages

Lecture

Lecture

49 pages

Lecture

Lecture

22 pages

Lecture

Lecture

16 pages

Lecture

Lecture

18 pages

Lecture

Lecture

35 pages

lecture

lecture

22 pages

lecture

lecture

24 pages

Midterm

Midterm

17 pages

exam

exam

15 pages

Lecture12

Lecture12

32 pages

lecture

lecture

19 pages

Lecture

Lecture

32 pages

boosting

boosting

11 pages

pca-mdps

pca-mdps

56 pages

bns

bns

45 pages

mdps

mdps

42 pages

svms

svms

10 pages

Notes

Notes

12 pages

lecture

lecture

42 pages

lecture

lecture

29 pages

lecture

lecture

15 pages

Lecture

Lecture

12 pages

Lecture

Lecture

24 pages

Lecture

Lecture

22 pages

Midterm

Midterm

5 pages

mdps-rl

mdps-rl

26 pages

Load more
Download Support Vector Machines
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Support Vector Machines and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Support Vector Machines and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?