支持向量机原理_支持向量机

支持向量机原理

Abbreviated as SVM, support vector machine learning algorithm is commonly used for classification problems. It gives us a better way to understand a non-linear decision boundary.

支持向量机学习算法缩写为SVM，通常用于分类问题。 它为我们提供了一种更好的理解非线性决策边界的方法。

Let’s begin by considering a scenario where one might want to classify the following data —

让我们首先考虑一种情况，在这种情况下，您可能希望对以下数据进行分类-

It is quite evident that the data can be separated into their respective classes using a simple linear decision boundary. However, there are multiple such decision boundaries that can be used to separate the two classes. In fact, there are an infinite number of linear decision boundaries that can be drawn to separate the red and the blue class. Consider the following decision boundaries —

很明显，可以使用简单的线性决策边界将数据分为各自的类别。 但是，可以使用多个这样的决策边界来分隔两个类别。 实际上，可以绘制无限数量的线性决策边界来分离红色和蓝色类别。 考虑以下决策边界-

Possible decision boundaries that can be used to classify the data.

可用于对数据进行分类的可能决策边界。

• The one on the left is too close to the blue class implying “whenever in doubt classify the point to be red”.
  左边的那个离蓝色等级太近了，暗示着“只要有疑问，就将红色等级分类”。
• The decision boundary in the middle graph is closer to the red class. The decision boundary being close to the red class implies that if a model classifies a point as being red then it is more sure of its decision had it classified the same point as being blue, thereby following “whenever in doubt classify the point as blue”. Also, intuition says we can do better than a perfectly straight decision boundary.
  中间图中的决策边界更接近红色类别。 决策边界接近红色类别意味着，如果模型将一个点归类为红色，则如果将相同的点归类为蓝色，则可以更加确定其决策，因此遵循“只要有疑问，就将该点归类为蓝色”。 。 同样，直觉说我们可以做的比完全正确的决策边界要好。
• In the last graph, the decision boundary is close to the instances of both the red and the blue classes.
  在最后一张图中，决策边界接近红色和蓝色类的实例。

From the above discussion, we may conclude that we want a decision boundary that is not too close to either of the two classes. To help us find such a line, SVM is used.

从上面的讨论中，我们可以得出结论，我们希望决策边界不太接近两个类别中的任何一个。 为了帮助我们找到这样一条线，使用了SVM。

Support vector machine learning algorithm concentrates on those points of both the classes that are close to eac