Fast instance selection for speeding up support vector machines

  • Authors:
  • Jingnian Chen;Caiming Zhang;Xiaoping Xue;Cheng-Lin Liu

  • Affiliations:
  • Department of Information and Computing Science, Shandong University of Finance and Economics, Jinan 250014, China;School of Computer Science and Technology, Shandong University, Jinan 250014, China;School of Electronics and Information, Tongji University, Shanghai 201804, China;National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing 100190, China

  • Venue:
  • Knowledge-Based Systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Support vector machine (SVM) has shown prominent performance for binary classification. How to effectively apply it to massive datasets with large number of classes and instances is still a serious challenge. Instance selection methods have been proposed and shown significant efficacy for reducing the training complexity of SVM, but more or less trade off the generalization performance. This paper presents an instance selection method especially for multi-class problems. With cluster centers of positive class as reference points instances are selected for each one-versus-rest SVM model. The purpose of clustering here is to improve the efficiency of instance selection, other than to select instances directly from clusters as previous methods did. Experiments on a wide variety of datasets demonstrate that the proposed method selects fewer instances than most competitive algorithms and keeps the highest classification accuracy on most datasets. Additionally, experimental results show that this method also performs superiorly for binary problems.