11.07.2015 Views

A Tutorial on Support Vector Machines for Pattern Recognition

A Tutorial on Support Vector Machines for Pattern Recognition

A Tutorial on Support Vector Machines for Pattern Recognition

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

37Pi =1 0 i 1. Then w x+b = P i ifwa i + bg > 0.P may be written x =i ia i TSimilarly, <strong>for</strong> points y 2 C B , w y + b < 0. Hence C A CB = , since otherwise wewould be able to nd a point x = y which simultaneously satises both inequalities.Theorem 1: C<strong>on</strong>sider some set of m points in R n . Choose any <strong>on</strong>e of the points asorigin. Then the m points can be shattered by oriented hyperplanes if and <strong>on</strong>ly if thepositi<strong>on</strong> vectors of the remaining points are linearly independent.Proof: Label the origin O, and assume that the m ; 1 positi<strong>on</strong> vectors of the remainingpoints are linearly independent. C<strong>on</strong>sider any partiti<strong>on</strong> of the m points into two subsets,S 1 and S 2 ,o<strong>for</strong>derm 1 and m 2 respectively, sothatm 1 + m 2 = m. Let S 1 be the subsetc<strong>on</strong>taining O. Then the c<strong>on</strong>vex hull C 1 of S 1 is that set of points whose positi<strong>on</strong> vectors xsatisfyx =Xm 1i=1 i s 1i Xm 1i=1 i =1 i 0 (A.1)where the s 1i are the positi<strong>on</strong> vectors of the m 1 points in S 1 (including the null positi<strong>on</strong>vector of the origin). Similarly, the c<strong>on</strong>vex hull C 2 of S 2 is that set of points whose positi<strong>on</strong>vectors x satisfyx =Xm 2i=1 i s 2i Xm 2i=1 i =1 i 0 (A.2)where the s 2i are the positi<strong>on</strong> vectors of the m 2 points in S 2 . Now suppose that C 1 andC 2 intersect. Then there exists an x 2 R n which simultaneously satises Eq. (A.1) and Eq.(A.2). Subtracting these equati<strong>on</strong>s gives a linear combinati<strong>on</strong> of the m ; 1 n<strong>on</strong>-null positi<strong>on</strong>vectors which vanishes, which c<strong>on</strong>tradicts the assumpti<strong>on</strong> of linear independence. By thelemma, since C 1 and C 2 do not intersect, there exists a hyperplane separating S 1 and S 2 .Since this is true <strong>for</strong> any choice of partiti<strong>on</strong>, the m points can be shattered.It remains to show that if the m;1 n<strong>on</strong>-null positi<strong>on</strong> vectors are not linearly independent,then the m points cannot be shattered by oriented hyperplanes. If the m;1 positi<strong>on</strong> vectorsare not linearly independent, then there exist m ; 1numbers, i ,suchthatm;1Xi=1 i s i =0(A.3)If all the i are of the same sign, then we can scale them so that i 2 [0 1] and P i i =1.Eq. (A.3) then states that the origin lies in the c<strong>on</strong>vex hull of the remaining points hence,by the lemma, the origin cannot be separated from the remaining points by ahyperplane,and the points cannot be shattered.If the i are not all of the same sign, place all the terms with negative i <strong>on</strong> the right:Xj2I 1j j js j = X k2I 2j k js k(A.4)where I 1 , I 2 are the indices of the corresp<strong>on</strong>ding partiti<strong>on</strong> of SnO (i.e. of the set S with theorigin removed). Now scale this equati<strong>on</strong> so that either P j2I 1j j j =1and P k2I 2j k j1,or P j2I 1j j j 1 and P k2I 2j k j =1. Suppose without loss of generality thatthe latterholds. Then the left hand side of Eq. (A.4) is the positi<strong>on</strong> vector of a point lying in the

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!