Knowledge-based Support Vector Machine Classifiers via Nearest Points

详细信息	查看全文 | 推荐本文 |

• 作者：Xuchan Ju^a ; Yingjie Tian^b ; ^{tyj@gucas.ac.cn}
• 关键词：support vector machines ; knowledge ; nearest point ; classification ; machine learning
• 刊名：Procedia Computer Science
• 出版年：2012
• 期刊代码：pc74_18770509
• 类别：cp
• 出版时间：2012
• 卷：9
• 期：Complete
• 页码：1240-1248
• 文件大小：137 K

摘要

Prior knowledge in the form of multiple polyhedral sets or more general nonlinear sets was incorporated into Support Vector Machines (SVMs) as linear constraints in a linear programming by Mangasarian and his co-worker. However, these methods lead to rather complex optimization problems that require fairly sophisticated convex optimization tools, which can be a barrier for practitioners. In this paper we introduce a simple and practical method to incorporate prior knowledge in support vector machines. After transforming the prior knowledge into lots of bound ary points by computing the shortest distances between the original training points and the knowledge sets, we get an augmented training set therefore standard SVMs and existing powerful SVM tools can be used directly to obtain the solution fast and exactly. Numerical experiments show the effectiveness of the proposed approach.