1 / 16

Support Vector Machines

Find a linear hyperplane (decision boundary) that will separate the data. Support Vector Machines. One Possible Solution. Support Vector Machines. Another possible solution. Support Vector Machines. Other possible solutions. Support Vector Machines. Which one is better? B1 or B2?

kbeer
Download Presentation

Support Vector Machines

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Find a linear hyperplane (decision boundary) that will separate the data Support Vector Machines

  2. One Possible Solution Support Vector Machines

  3. Another possible solution Support Vector Machines

  4. Other possible solutions Support Vector Machines

  5. Which one is better? B1 or B2? How do you define better? Support Vector Machines

  6. Find hyperplane maximizes the margin => B1 is better than B2 Support Vector Machines

  7. X2 X1 此條線為由原點沿 與 垂直的線 方向走

  8. Support Vector Machines

  9. W•X +b =0 此線在沿法向量走-b/|w|的距離，與法向量垂直 w•x+b=0 x1-x2 x1 d x2 w w•x+b=1 w•x+b = -1 0

  10. 開始推導 • w•x+b=0 這是一條怎樣的線呢？ xa , xb為線上兩點  w•xa+b=0, w•xb+b=0 兩式相減 w •(xa-xb)=0 線上兩點所形成的向量與w垂直 所以w是法向量 • w •xs+b=k ， xs在上面的線k > 0 • w •xc+b=k’ ， xc在下面的線k’ < 0 • 方塊分類為y=1， 圓圈分類為y=-1 • 分類公式 z 是 y=1類或 y=-1類依據：

  11. 調整w與b得到 • w•(x1-x2)=2 • |w|*d=2 • ∴

  12. Support Vector Machines • We want to maximize: • Which is equivalent to minimizing: • But subjected to the following constraints: • This is a constrained optimization problem • Numerical approaches to solve it (e.g., quadratic programming)

  13. Min f(w)= • Subject to • Change to • Min f(w)= • Subject to

  14. Nonlinear Support Vector Machines • What if decision boundary is not linear?

  15. Nonlinear Support Vector Machines • Transform data into higher dimensional space

More Related