This lecture covers the concept of linear separability in support vector machines (SVM). It explains how an SVM seeks to find a hyperplane that separates positive and negative points in a dataset. The lecture delves into the margin of a separating hyperplane, the origin of the SVM name, support vectors, and the formulation of SVM with a rigid margin.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace