Transcription of Part V Support Vector Machines
{{id}} {{{paragraph}}}
CS229 LecturenotesAndrewNgPartVSupportVectorMa chinesThissetof notespresents theSupportVectorMachine(SVM) (andmany believe is indeedthebest)\o -the-shelf" telltheSVMstory, we'llneedto rsttalkaboutmarginsandtheideaof separatingdatawitha large\gap."Next,we'lltalkabouttheoptimal marginclassi er,which willleadus into a digressiononLagrangeduality. We'llalsoseekernels,which givea way to applySVMse cientlyin veryhighdimensional(such as in nite-dimensional)featurespaces,and nally, we'llcloseo thestorywiththeSMOalgorithm,which gives ane cient implementationof :IntuitionWe'llstartourstoryonSVMsby theintuitionsaboutmarginsandaboutthe\con dence"of ourpredic-tions;theseideaswillbe madeformalin ,wheretheprobabilityp(y= 1jx; ) is mod-eledbyh (x) =g( Tx).
Support Vector Machines This set of notes presents the Support Vector Machine (SVM) learning al-gorithm. SVMs are among the best (and many believe is indeed the best) \o -the-shelf" supervised learning algorithm. To tell the SVM story, we’ll need to rst talk about margins and the idea of separating data with a large \gap."
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}