Skip to main content

A Simple and Effective Lagrangian-Based Combinatorial Algorithm for S\(^3\)VMs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10710))

Abstract

Many optimization techniques have been developed in the last decade to include the unlabeled patterns in the Support Vector Machines formulation. Two broad strategies are followed: continuous and combinatorial. The approach presented in this paper belongs to the latter family and is especially suitable when a fair estimation of the proportion of positive and negative samples is available. Our method is very simple and requires a very light parameter selection. Experiments on both artificial and real-world datasets have been carried out, proving the effectiveness and the efficiency of the proposed algorithm.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Notes

  1. 1.

    The idea of employing Lagrangian techniques to relax the balance constraint is proposed also in [15], but for a totally different formulation.

References

  1. Bertsekas, D.P.: Nonlinear Programming. Athena Scientific (2003)

    Google Scholar 

  2. Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2, 27:1–27:27 (2011)

    Article  Google Scholar 

  3. Chapelle, O., Chi, M., Zien, A.: A continuation method for semi-supervised SVMs. In: ICML 2006, pp. 185–192. Max-Planck-Gesellschaft, ACM Press, New York, June 2006

    Google Scholar 

  4. Chapelle, O., Sindhwani, V., Keerthi, S.S.: Branch and bound for semi-supervised support vector machines. Technical report, Max Plank Institute (2006)

    Google Scholar 

  5. Chapelle, O., Sindhwani, V., Keerthi, S.S.: Optimization techniques for semi-supervised support vector machines. J. Mach. Learn. Res. 9, 203–233 (2008)

    MATH  Google Scholar 

  6. Collobert, R., Sinz, F., Weston, J., Bottou, L.: Large scale transductive SVMs. J. Mach. Learn. Res. 7, 1687–1712 (2006)

    MathSciNet  MATH  Google Scholar 

  7. De Bie, T., Cristianini, N.: Semi-supervised Learning Using Semi-definite Programming. MIT Press, Cambridge (2006)

    Google Scholar 

  8. Gieseke, F., Airola, A., Pahikkala, T., Kramer, O.: Fast and simple gradient-based optimization for semi-supervised support vector machines. Neurocomputing 123, 23–32 (2014). Contains Special issue articles: Advances in Pattern Recognition Applications and Methods

    Article  Google Scholar 

  9. Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. Springer Series in Statistics. Springer, New York (2001). https://doi.org/10.1007/978-0-387-84858-7

    Book  MATH  Google Scholar 

  10. Joachims, T.: Transductive inference for text classification using support vector machines. In: Proceedings of the Sixteenth International Conference on Machine Learning, ICML 1999, pp. 200–209. Morgan Kaufmann Publishers Inc., San Francisco (1999)

    Google Scholar 

  11. Li, B., Yang, Z., Zhu, Y., Meng, H., Levow, G., King, I.: Predicting user evaluations of spoken dialog systems using semi-supervised learning. In: 2010 IEEE Spoken Language Technology Workshop (SLT) (2010)

    Google Scholar 

  12. Li, Y.F., Zhou, Z.H.: Towards making unlabeled data never hurt. IEEE Trans. Pattern Anal. Mach. Intell. 37(1), 175–188 (2015)

    Article  Google Scholar 

  13. Li, Y., Tsang, I.W., Kwok, J.T., Zhou, Z.: Convex and scalable weakly labeled SVMs. CoRR abs/1303.1271 (2013)

    Google Scholar 

  14. Nene, S.A., Nayar, S.K., Murase, H.: Columbia Object Image Library (COIL-100). Technical report, February 1996

    Google Scholar 

  15. Sindhwani, V., Keerthi, S.S., Chapelle, O.: Deterministic annealing for semi-supervised kernel machines. In: Proceedings of the 23rd International Conference on Machine Learning, ICML 2006, pp. 841–848. ACM, New York (2006)

    Google Scholar 

  16. Timsina, P., Liu, J., El-Gayar, O., Shang, Y.: Using semi-supervised learning for the creation of medical systematic review: an exploratory analysis. In: 2016 49th Hawaii International Conference on System Sciences (HICSS) (2016)

    Google Scholar 

  17. Vapnik, V.N., Sterin, A.: On structural risk minimization or overall risk in a problem of pattern recognition. Autom. Remote Control 10(3), 1495–1503 (1977)

    MATH  Google Scholar 

  18. Yang, W., Yin, X., Xia, G.S.: Learning high-level features for satellite image classification with limited labeled samples. IEEE Trans. Geosci. Remote Sens. 53(8), 4472–4482 (2015)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Francesco Bagattini .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bagattini, F., Cappanera, P., Schoen, F. (2018). A Simple and Effective Lagrangian-Based Combinatorial Algorithm for S\(^3\)VMs. In: Nicosia, G., Pardalos, P., Giuffrida, G., Umeton, R. (eds) Machine Learning, Optimization, and Big Data. MOD 2017. Lecture Notes in Computer Science(), vol 10710. Springer, Cham. https://doi.org/10.1007/978-3-319-72926-8_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72926-8_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72925-1

  • Online ISBN: 978-3-319-72926-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics