文章基本信息

标题：Near-Boundary Data Selection for Fast Suppor Vector Machines
本地全文：下载
作者：Doosung Hwang ; Daewon Kim
期刊名称：Malaysian Journal of Computer Science
印刷版ISSN：0127-9084
出版年度：2012
卷号：25
期号：1
出版社：University of Malaya * Faculty of Computer Science and Information Technology
摘要：Support Vector Machines(SVMs) have become more popular than other algorithms for pattern classification. The learning phase of a SVM involves exploring the subset of informative training examples (i.e. support vectors) that makes up a decision boundary. Those support vectors tend to lie close to the learned boundary. In view of nearest neighbor property, the neighbors of a support vector become more heterogeneous than those of a nonsupport vector. In this paper, we propose a data selection method that is based on the geometrical analysis of the relationship between nearest neighbors and boundary examples. With realworld problems, we evaluate the proposed data selection method in terms of generalization performance, data reduction rate, training time and the number of support vectors. The results show that the proposed method achieves a drastic reduction of both training data size and training time without significant impairment to generalization performance compared to the standard SVM.
关键词：Support Vector Machine; Nearest Neighbor Rule; Tomek Link; Data Selection