Embed presentation
Download as PDF, PPTX























This document provides a summary of a lecture on support vector machines (SVMs). The lecture discusses how SVMs find the optimal separating hyperplane between two classes by maximizing the margin between them. It covers both the separable and non-separable cases, and how SVMs can be extended to non-linear classification using kernel tricks. The lecture concludes by mentioning further issues like multi-class classification and algorithms for building SVMs.






















