作者: Ming Zeng , Yu Yang , Jinde Zheng , Junsheng Cheng
DOI: 10.1016/J.NEUCOM.2014.07.038
关键词: Convex hull 、 Convex polytope 、 Combinatorics 、 Proper convex function 、 Orthogonal convex hull 、 Convex analysis 、 Convex set 、 Mathematical optimization 、 Convex optimization 、 Mathematics 、 Convex combination
摘要: Based on defining a flexible convex hull, maximum margin classification based hulls (MMC-FCH) is presented in this work. The hull defined our work class region approximation looser than but tighter an affine hull. MMC-FCH approximates each with of its training samples, and then finds linear separating hyperplane that maximizes the between by solving closest pair points problem. method can be extended to nonlinear case using kernel trick, multi-class problems are dealt constructing binary pairwise classifiers as support vector machine (SVM). experiments several databases show proposed compares favorably (MMC-CH) or (MMC-AH). A for approximation.Maximum work.MMC-FCH hull.MMC-FCH optimal