Skip to main content

Robust Unsupervised and Semi-supervised Bounded ν − Support Vector Machines

  • Conference paper
Advances in Neural Networks – ISNN 2009 (ISNN 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5552))

Included in the following conference series:

Abstract

Support Vector Machines (SVMs) have been dominant learning techniques for more than ten years, and mostly applied to supervised learning problems. These years two-class unsupervised and semi-supervised classification algorithms based on Bounded C-SVMs, Bounded ν-SVMs, Lagrangian SVMs (LSVMs) and robust version to Bounded C − SVMs respectively, which are relaxed to Semi-definite Programming (SDP), get good classification results. But the parameter C in Bounded C-SVMs has no specific in quantification. Therefore we proposed robust version to unsupervised and semi-supervised classification algorithms based on Bounded ν− Support Vector Machines (Bν−SVMs). Numerical results confirm the robustness of proposed methods and show that our new algorithms based on robust version to Bν−SVM often obtain more accurate results than other algorithms.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sim, M.: Robust Optimization, Phd.Thesis MIT (2004)

    Google Scholar 

  2. Bertsimas, D., Sim, M.: The price of robustness. Opertions Research 52, 35–53 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21, 1154–1157 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ben-Tal, A., Nemirovski, A.: Rubust convex optimization. Math. Oper. Res. 23, 769–805 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ben-Tal, A., Nemirovski, A.: Rubust solutions to uncertain programs. Oper. Res. Letters 25, 1–13 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ben-Tal, A., Nemirovski, A.: Rubust solutions of linear programming problems constrained with uncertain data. Math. Program. 88, 411–424 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. El-Ghaoui, L., Lebret, H.: Rubust solutions to least-square problems to uncertain data matrices. SIAM J. Matrix Anal. Appl. 18, 1035–1064 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  8. El-Ghaoui, L., Oustry, F., Lebret, H.: Rubust solutions to semidefinite programs. SIAM J. Optim. 9, 33–52 (1998)

    Article  MATH  Google Scholar 

  9. Schoelkopf, B., Smola, A.: Learning with kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, Cambridge (2002)

    Google Scholar 

  10. Lanckriet, G., Cristianini, N., Bartlett, P., Ghaoui, L., Jordan, M.: Learning the kernel matrix with semidefinite programming. Journal of Machine learning research 5 (2004)

    Google Scholar 

  11. De Bie, T., Crisrianini, N.: Convex methods for transduction. In: Advances in Neural Information Processing Systems (NIPS 2003), vol. 16 (2003)

    Google Scholar 

  12. Xu, L., Neufeld, J., Larson, B., Schuurmans, D.: Maximum margin clustering. In: Advances in Neural Information Processing Systems (NIPS 2004), vol. 17 (2004)

    Google Scholar 

  13. Kun, Z., Yingjie, T., Naiyang, D.: Unsupervised and Semi-Supervised Two-class Support Vector Machines. In: Proceedings of the Sixth IEEE International Conference on Data Mining Workshops, pp. 813–817 (2006)

    Google Scholar 

  14. Kun, Z., Yingjie, T., Naiyang, D.: Unsupervised and Semi-Supervised Lagrangian Support Vector Machines. In: Proceedings of the Seventh International Conference on Computational Science Workshops, pp. 882–889 (2007)

    Google Scholar 

  15. Kun, Z., Yingjie, T., Naiyang, D.: Robust Unsupervised and Semisupervised Bounded C − Support Vector Machines. In: Proceedings of the Seventh IEEE International Conference on Data Mining Workshops, pp. 331–336 (2007)

    Google Scholar 

  16. Friess, T., Christianini, C.N., Campbell, C.: The Kernel Adatron Algorithm: A Fast and Simple Learning Procedure for Support Vector Machines. In: Proceeding of 15th Intl. Con Machine Learning, Morgan Kaufman Publishers, San Francisco (1998)

    Google Scholar 

  17. Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, Cambridge (2000)

    Book  MATH  Google Scholar 

  18. Jos, F.S.: Using SeDuMi1.02, A Matlab Toolbox for Optimization over Symmetric Cones. Optimization Methods and Software 11-12, 625–653 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, K., Tian, Yj., Deng, Ny. (2009). Robust Unsupervised and Semi-supervised Bounded ν − Support Vector Machines . In: Yu, W., He, H., Zhang, N. (eds) Advances in Neural Networks – ISNN 2009. ISNN 2009. Lecture Notes in Computer Science, vol 5552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01510-6_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01510-6_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01509-0

  • Online ISBN: 978-3-642-01510-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics