SVM
SVM
Imagine you have two types of points (e.g., red circles and blue squares)
on a graph.
SVM tries to find a line (or a plane in higher dimensions) that clearly
separates the two groups.
The goal is to keep the maximum possible distance between the closest
points of both groups.
3. Support Vectors:
The points closest to the separating line are called support vectors.
4. Classification:
Once the best boundary is found, SVM uses it to classify new data points.
Imagine a road dividing two neighborhoods (A and B). The wider the road,
the clearer the separation between the two areas.
Any new house will be classified based on which side of the road it falls
on.
Pros & Cons of SVM