Support vector machines based on weighted scatter degree

  • Authors:
  • A-Long Jin;Xin Zhou;Chi-Zhou Ye

  • Affiliations:
  • Dept. of Commu. & Inform. Eng., Nanjing Univ. of P. & T., Nanjing, China;Dept. of Commu. & Inform. Eng., Nanjing Univ. of P. & T., Nanjing, China;Dept. of Commu. & Inform. Eng., Nanjing Univ. of P. & T., Nanjing, China

  • Venue:
  • AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part III
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Support Vector Machines (SVMs) are efficient tools, which have been widely studied and used in many fields. However, original SVM (C-SVM) only focuses on the scatter between classes, but neglects the global information about the data which are also vital for an optimal classifier. Therefore, C-SVM loses some robustness. To solve this problem, one approach is to translate (i.e., to move without rotation or change of shape) the hyperplane according to the global characteristics of the data. However, parts of existing work using this approach are based on specific distribution assumption (S-SVM), while the rest fail to utilize the global information (GS-SVM). In this paper, we propose a simple but efficient method based on weighted scatter degree (WSD-SVM) to embed the global information into GS-SVM without any distribution assumptions. A comparison of WSD-SVM, C-SVM and GS-SVM is conducted, and the results on several data sets show the advantages of WSD-SVM.