Fast Single-Shot Multiclass Proximal Support Vector Machines and Perceptions

  • Authors:
  • K. P. Soman;R. Loganathan;M. S. Vijaya;V. Ajay;K. Shivsubramani

  • Affiliations:
  • Amrita Vishwa Vidyapeetham, India;Amrita Vishwa Vidyapeetham, India;Amrita Vishwa Vidyapeetham, India;Amrita Vishwa Vidyapeetham, India;Amrita Vishwa Vidyapeetham, India

  • Venue:
  • ICCTA '07 Proceedings of the International Conference on Computing: Theory and Applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently Sandor Szedmak and John Shawe-Taylor [1] showed that Multiclass Support Vector Machines [3, 4] can be implemented with single class complexity. In this paper we show that computational complexity of their algorithm can be further reduced by modelling the problem as a Multiclass Proximal Support Vector Machines. The new formulation requires only a linear equation solver. The paper then discusses the multiclass transformation of Iterative Single data Algorithm [8]. This method is faster than the first method. The two algorithm are so much simple that SVM training and testing of huge datasets can be implemented even in a spreadsheet.