Support Vector Machine: Finding the Widest Street
A Support Vector Machine (SVM) finds the widest possible "street" to separate data classes. It's used for classification tasks like text analysis. The footgun is forgetting the "kernel trick," which lets SVMs solve non-linear problems, not just draw lines.
Think of an SVM as drawing the widest possible "street" to separate two groups of data points. The points on the edge of this street are the "support vectors" that define the boundary. This max-margin approach makes it robust for classification tasks like image recognition. The main footgun is assuming SVMs are only for linear problems; the "kernel trick" allows them to find complex, non-linear boundaries, but choosing the right kernel is a difficult art.
Read the original → Wikipedia: Support vector machine
- #machine learning
- #classification
- #supervised learning
- #svm
Get five bites like this every day.
Tezvyn delivers a daily feed of 60-second tech bites with quizzes to lock in what you learn.