Skip to main content

SUPPORT VECTOR MACHINE

                 SUPPORT VECTOR MACHINE:-

Support vector machine:-it is a type of supervised learning algorithm it is used to solve both classification and regression problem.

Note:- It is mostly used for classification problems.

what we are going to learn in SVM:

a) Support vectors

b) Hyperplane

c) Marginal Distance

d) Linear Separable

e) Non-linear separable

f) support kernels


NOw we will discuss everything in detail.


Hyper plane:-


in the above diagram, we have drawn three lines(A, B, C) separating two data points(stars and reds) The lines (A, B, C) are called Hyperplanes.

Note:-“Select the hyper-plane which segregates the two classes better”

i.e above there are three hyperplanes how to select the best hyperplane?

b)Marginal Distance:-

When we draw a hyperplane the plane creates two new(------) dotted lines one line above the hyperplane and one line below the hyperplane line. see the below image you will get an idea


Suppose c line is my hyperplane and B and A are my marginal lines.
 Now, what is marginal distance:

 we have to measure The maximum distance between the stars and red, The distance is called Marginal distance
Note:-The distance is should always Maximum.

 Support vectors:
what are support vectors 

support vectors are nothing but the nearest data point to the marginal line is called a support vector.
if see the above image there is a small line from the Star symbol to the line B that the data point is called the support vector.  

Note:-The hyperplane is should have a maximum marginal distance near to the data points.


Linear Separable:
linear separable means how the marginal line separating the data points

see below image
how the line is linearly separating the data points this is called linear separable. 




 If you see the below image there is a star in red that data point is called an outlier.
SVM is robust to outliers.
if you are working with SVM to treat outliers.



 Non-linear separable:
I tried to draw the best diagram adjust😂😁
Non-linear separable means see the below image there are red stars and black stars and we create a hyperplane it is separating the data points.
Question: How to solve this issue?
Answer:-when we draw a hyperplane between data points it won't separate data points cleary,
So what will happen means some of the data points are on one side and some of the data are on another side so it will affect the accuracy.
How to solve the above problem.


if you see the above image we have created a small hyperplane
 with the help of support kernels, we are able to do that,
it converts our low dimension data into the high dimension.  


Support kernel:
Support kernel is nothing but converting low dimension data into the high dimension to separate the data points this is called a SUPPORT KERNEL.


for code, part check my GitHub.

Comments

Post a Comment

Popular posts from this blog

KNN Interview Questions

                           KNN interview questions 1) Which of the following distance metric can not be used in k-NN? A) Euclidean Distance B) Manhatten Distance c) Hamming Distance E) Minkowski Distance F) Jaccard Distance G) All the above Answer:- G All of these distance metric can be used as a distance metric for KNN 2)Knn is for regression or classification? Answer:- Knn is used for both classification and regression problems. 3) When we use Manhatten Distance? Answer:-Manhatten distance is used for continuous variables. 4) You have given the following 2 statements, find which of these options is/are true in case of k-NN? In the case of very large value of k , we may include points from other classes into the neighborhood, so it leads to overfitting. In case of too small value of k the algorithm is very sensitive to noise.(it will affect our model performance). Answer:-The above two points are answers. 5...
Post a Comment
Read more

K-NN

                           K-Nearest Neighbour The k-nearest neighbors (KNN) algorithm is a simple, easy-to-implement supervised machine learning algorithm that can be used to solve both classification and regression problems. KNN means in short Similar things near to each other. The KNN algorithm uses ‘ feature similarity ’ to predict the values of any new data points. I am going to explain this knn with a simple example:- In the above table, we have S.No, Height, Weight & Age in our table for S.No.5 the weight is missing, So now we need to predict the weight of the person based on his Height and Age. graph example in the above graph, X_axis represents the age and the y_axis represents the Height of a person. in the above graph, I write 5 numbers, in that  4 values have output and one id not having output now see How KNN help us. the 5th number I want to predict which is circled. hint:-By seeing th...
Post a Comment
Read more