Skip to main content
Log in

Applying a novel decision rule to the sphere-structured support vector machines algorithm

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

An Erratum to this article was published on 31 July 2008

Abstract

The traditional sphere-structured support vector machines algorithm is one of the learning methods. It can partition the training samples space by means of constructing the spheres with the minimum volume covering all training samples of each pattern class in high-dimensional feature space. However, the decision rule of the traditional sphere-structured support vector machines cannot assign ambiguous sample points such as some encircled by more than two spheres to valid class labels. Therefore, the traditional sphere-structured support vector machines is insufficient for obtaining the better classification performance. In this article, we propose a novel decision rule applied to the traditional sphere-structured support vector machines. This new decision rule significantly improves the performance of labeling ambiguous points. Experimental results of seven real datasets show the traditional sphere-structured support vector machines based on this new decision rule can not only acquire the better classification accuracies than the traditional sphere-structured support vector machines but also achieve the comparable performance to the classical support vector machines.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Kulkarni SR, Lugosi G, Venkatesh SS (1998) Learning pattern classification: a survey. IEEE Trans Inf Theory 44(6):2178–2206

    MATH  MathSciNet  Google Scholar 

  2. Jain AK, Duin RPW, Mao J (2000) Statistical pattern recognition: a review. IEEE Trans Pattern Anal Mach Intell 22(1):4–37

    Google Scholar 

  3. Burges JC (1998) A tutorial on support vector machines for pattern recognition. Data Min Knowl Dis 2(2):121–167

    Google Scholar 

  4. Zhu ML, Chen SF, Liu XD (2003) Sphere-structured support vector machines for multi-class pattern recognition. Lect Notes Comput Sci 2639:589–593

    Article  Google Scholar 

  5. Schölkopf B, Burges C, Vapnik V (1995) Extracting support data for a given task. In: Proceedings of the first international conference knowledge discovery data mining, pp 252–257

  6. Tax DMJ, Duin RPW (1999) Data domain description by support vectors. In: Verleysen M (ed) Proceedings ESANN. D. Facto, Brussels, pp 251–256

    Google Scholar 

  7. Wolfe P (1961) A duality theorem for nonlinear programming. Q Appl Math 19:239–244

    MATH  MathSciNet  Google Scholar 

  8. Kukn HW, Tucker AW (1951) Nonlinear programming. In: Proceedings of second Berkeley symposium on mathematical statistics and probability, pp 481–492

  9. UCI Machine Learning Repository: http://www.ics.uci.edu/~mlearn/MLRepository.html

  10. LibSVM Datasets. http://www.csie.ntu.edu.tw/~cjlin/libsvmtools/datasets

  11. SPRTool. http://cmp.felk.cvut.cz/cmp/software/stprtool

Download references

Acknowledgments

We thank the anonymous reviewer’s constructive comments for improving presentation of this article.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lei Gu.

Additional information

An erratum to this article can be found at http://dx.doi.org/10.1007/s00521-008-0197-z

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gu, L., Wu, Hz. Applying a novel decision rule to the sphere-structured support vector machines algorithm. Neural Comput & Applic 18, 275–282 (2009). https://doi.org/10.1007/s00521-008-0179-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-008-0179-1

Keywords

Navigation