Concept boundary detection for speeding up SVMs

Support Vector Machines (SVMs) suffer from an O(n2 ) training cost, where n denotes the number of training instances. In this paper, we propose an algorithm to select boundary instances as training data to substantially reduce n. Our proposed algorithm is motivated by the result of (Burges, 1999) that, removing non-support vectors from the training set does not change SVM training results. Our algorithm eliminates instances that are likely to be non-support vectors. In the conceptindependent preprocessing step of our algorithm, we prepare nearest-neighbor lists for training instances. In the concept-specific sampling step, we can then effectively select useful training data for each target concept. Empirical studies show our algorithm to be effective in reducing n, outperforming other competing downsampling algorithms without significantly compromising testing accuracy.

• Type: Conference
• Year: 2006
• Where: ICML
• Authors: Navneet Panda, Edward Y. Chang, Gang Wu
• Keywords: Algorithm Eliminates Instances, ICML 2006, Machine Learning, Select Useful Training, Training Instances