An Efficient Approach to Boost Support Vector Data Description

In this paper, we propose an efficient approach to speed up the training of support vector data description (SVDD). Our approach works in two steps. In the first step, we propose k-farthest neighbors method to identify the samples around the hyper-sphere. These samples are mostly likely to be support vectors which contribute to the construction of the classifier. In the second step, we construct SVDD classifier on the selected samples to boost the training of SVDD and guarantee its accuracy as well. In the end, we conduct extensive experiments to investigate the performance of our approach and the results show that our method can speed up the training of SVDD and hold similar accuracy in comparison of the original SVDD method.

[1]  Hyung Jin Chang,et al.  Fast Support Vector Data Description Using K-Means Clustering , 2007, ISNN.

[2]  Pavel Zezula,et al.  M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.

[3]  Defeng Wang,et al.  Structured One-Class Classification , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[4]  Simon J. Godsill,et al.  Detection of abrupt spectral changes using support vector machines an application to audio signal segmentation , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  Robert P. W. Duin,et al.  Support vector domain description , 1999, Pattern Recognit. Lett..

[6]  Francesco Camastra,et al.  A Novel Kernel Method for Clustering , 2005, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Robert P. W. Duin,et al.  Support Vector Data Description , 2004, Machine Learning.