earticle

논문검색

Step Function Approximation for Support Vector Reduction

초록

영어

Since introduction, the Support Vector Machines (SVM) has been popularly used in machine learning and data mining tasks due to their strong mathematical background and promising result. Nevertheless, they are noticeably slow in the prediction stage. The speed is influenced by number of support vectors determined in the training phase. Motivated by this fact, several studies are done to reduce the number of support vectors. The reduction should consider the degeneration of learning quality and preserve it at much as possible. Most previous methodologies either reduce the training set or apply a post-processing step to reduce the number of support vectors. In this paper, we proposed a new SVM cost function called Step Regularized Support Vector Machine (SRSVM), which is a standard SVM with extra constrained to reduce the number of support vectors, which can be defined by user. Experimental results are done to evaluate the efficiency and speed of proposed algorithm. SRSVM are also compared to other related SVM algorithms. The comparisons showed that the proposed method is effective in reducing number of support vectors while preserving the high performance of the classifier.

목차

Abstract
 1. Introduction
 2. Preliminary
  2.1. Support Vector Machines and their Computational Cost
 3. Related Work
 4. Proposed Algorithm
 5. Experimental Result
  5.1. Setup
  5.2. Performance Measure
  5.3. Datasets
  5.4. Experiment on Synthetic Dataset
  5.5. Experiment on UCI Dataset
 6. Conclusion
 References

저자정보

  • Amin Allahyar Department of Computer Engineering, Ferdowsi University of Mashhad, Mashhad, Iran
  • Hadi Sadoghi Yazdi Department of Computer Engineering, Ferdowsi University of Mashhad, Mashhad, Iran, Center of Excellence on Soft Computing and Intelligent Information Processing, Ferdowsi University of Mashhad

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.