First,the two convex hulls from the training set of approximate linear classification are similarly squeezed into the linearly separable ones,and based on the two similarly squeezed linearly separable convex hulls,an optimal separating hyperplane is figured out by using the method of halving the nearest points and the maximal margin method.
首先对近似线性分类中的训练集所形成的两类凸壳进行了相似压缩,使压缩后的凸壳线性可分;基于压缩后线性可分的凸壳,再用平分最近点和最大间隔法求出最优的分划超平面。
