Theoretical Overview Optimal Separating Hyperplane
Optimal Separating Hyperplane
Problem
1
a set S of n points x
i
∈ R
n
from two classes
x
i
belongs to either of two classes, given label y
i
∈ {−1, 1}
Goal
establish a hyperplane that divides S
st.
leave x
i
of same class on the same side(same label)
maximize the distance between the two classes and the hyperplane
Xianglong Liu (Beihang Univ., China) Support Vector Machine 2008.11 3 / 12
