Skip to main content

Semi-Supervised Support Vector Machines

  • Chapter
Introduction to Semi-Supervised Learning

Abstract

The intuition behind Semi-Supervised Support Vector Machines (S3VMs) is very simple. Figure 6.1(a) shows a completely labeled dataset. If we were to draw a straight line to separate the two classes, where should the line be? One reasonable place is right in the middle, such that its distance to the nearest positive or negative instance is maximized. This is the linear decision boundary found by Support Vector Machines (SVMs), and is shown in Figure 6.1(a). The figure also shows two dotted lines that go through the nearest positive and negative instances. The distance from the decision boundary to a dotted line is called the geometric margin. As mentioned above, this margin is maximized by SVMs.

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 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 37.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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Nature Switzerland AG

About this chapter

Cite this chapter

Zhu, X., Goldberg, A.B. (2009). Semi-Supervised Support Vector Machines. In: Introduction to Semi-Supervised Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning. Springer, Cham. https://doi.org/10.1007/978-3-031-01548-9_6

Download citation

Publish with us

Policies and ethics