{"id":403,"date":"2018-10-07T16:30:34","date_gmt":"2018-10-07T22:30:34","guid":{"rendered":"http:\/\/www.jacobsoft.com.mx\/?p=403"},"modified":"2025-02-20T13:37:51","modified_gmt":"2025-02-20T19:37:51","slug":"support-vector-regression","status":"publish","type":"post","link":"https:\/\/www.jacobsoft.com.mx\/en\/support-vector-regression\/","title":{"rendered":"Support Vector Regression (SVR)"},"content":{"rendered":"

Regression Vector Support (Support Vector Regression - SVR)<\/h2>\n\n\n\n

Support Vector Regression is a variant of the analysis model Support Vector Machine<\/strong> used to classify, however, with this variant the support vector model is used as a regression scheme to predict values.<\/p>\n\n\n\n

Vector Support Machine (SVM)<\/h3>\n\n\n\n

It is a set of supervised learning algorithms directly related to problems of classification and regression where, from a set of training data or samples and labeled classes, an SVM is trained to build the model that predicts the class of a new sample. .<\/p>\n\n\n\n

Intuitively, the SVM is a model that represents the points of the sample in space, separating the classes into two spaces as wide as possible by means of a separation hyperplane, which is defined as the vector between the two points of the two more classes close and this vector is called support vector.<\/p>\n\n\n\n

When a new sample is put in correspondence with said model, depending on the space to which it belongs, then it can be classified to one or another class. A good separation between the classes will allow a correct classification.<\/p>\n\n\n\n

In this sense, an SVM constructs a hyperplane or a set of hyperplanes in a space of very high or even infinite dimensionality that can be used in problems of classification or regression.<\/p>\n\n\n\n

The models based on SVM are related to neural networks. Using a kernel function, we obtain an alternative training method for polynomial classifiers, radial base function and multilayer perceptron.<\/p>\n\n\n\n

As with most supervised classification methods, the input data is viewed as a p-dimensional vector (an ordered list of p numbers). The SVM looks for a hyperplane that separates optimally the points of one class with respect to another, that previously could have been projected in a space of superior dimensionality.<\/p>\n\n\n\n

In this concept of optimal separation is where the fundamental characteristic of the SVM resides, looking for the hyperplane to have the maximum distance with the points closest to it. In this way the points of the vector that are on one side of the hyperplane are labeled with a category and those that are on the other side, are labeled with another category.<\/p>\n\n\n\n

The predictor variable is called an attribute and the attributes used to define the hyperplane are called characteristics. The choice of the most appropriate representation of the universe studied is carried out through a process called feature selection. The vector formed by the points closest to the hyperplane is called the support vector.<\/p>\n\n\n\n

\"\"
Suppose this data set<\/figcaption><\/figure>\n\n\n\n

The SVM will choose a hyperplane to separate the groups, with the greatest possible distance:<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

A good margin is one in which you have the maximum distance from the support vectors to the two classes.<\/p>\n\n\n\n

When the data set is more complex, the SVM converts the data into a linear space using some equations to reach a higher dimensional space, use for example: z = x2<\/sup> + and2<\/sup><\/p>\n\n\n\n

Support Vector Regression<\/h2>\n\n\n\n

Support Vector Regression uses the same principle with some minor changes. In principle, since the output is a real number, it becomes difficult to predict the information by hand since there are infinite possibilities. For the case of regression, then a margin of tolerance (epsilon) is established near the vector in order to minimize the error taking into account that part of that error is tolerated.<\/p>\n\n\n\n

\"\"
fuente: http:\/\/www.saedsayad.com\/support_vector_machine_reg.htm<\/figcaption><\/figure>\n\n\n\n

In the case of a linear problem, the SVR is given by<\/p>\n\n\n\n

\"\"<\/figure><\/div>\n\n\n\n

When the problem is not linear, the Kernel function transforms the data into a higher dimensional space characteristic to make it possible to perform the linear separation:<\/p>\n\n\n\n

\"\"<\/figure><\/div>\n\n\n\n
\"\"
fuente: http:\/\/www.saedsayad.com\/support_vector_machine_reg.htm
<\/figcaption><\/figure>\n\n\n\n

The most common Kernel functions are:<\/p>\n\n\n\n

\"\"<\/figure><\/div>\n\n\n\n
\n