4: SVM Flashcards

1
Q

Is SVM SL or UL?

A

SL

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

In what kind of domain is it used?

A

In various domains that require high discrimination power & accurate classification and prediction algorithms. Moreover, this algorithm can operate on both continuous and categorical data and can solve both linear and nonlinear problems. (imagine classification, text categorization, face detection, sentiment analysis, hand writing recognition)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is SVM about?

A

A mathematical model within the class of supervised learning for:
accurate classification & prediction
both continuous & categorical data
both linear & non-linear problems
high efficiency & effectivity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

When is the hyperplane learned?

A

It is detected during the training phase. The SVM algorithm uses the training instances to construct the linear function of the hyperplane. The goal is to use that description of the hyperplane to construct a function that maps each training instance x to a function value f(x) for which holds f(x) > 0 for instances of one class, and f(x) < 0 for members of the other class.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How does SVM work?

A
  1. The position of the hyperplane is derived in the training phase of the SVM algorithm.
  2. In the testing phase, the new non-labeled instance is classified as class according to its location relative to the hyperplane.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

The hyperplane above is represented as a straight line that passes through the middle of a gap. Where does the gap lie?

A

This gap lies between the closest instances of the different classes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the goal of SVM?

A

The goal of the SVM algorithm is to detect (or learn) the hyperplane that maximizes the width of the margin. The width of this margin is measured based on the perpendicular distance from the separating hyperplane to the support vectors.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What are the support vectors?

A

The data points that determine the margin.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the margin?

A

The boundary gap between two point-sets.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the hyperplane?

A

A separating boundary that helps to classify the points. The hyperplane in SVM forms a space that separates the instances of different classes. This hyperplane is a straight line if the space is two-dimensional, and is a plane if the space is three-dimensional, and so on. In other words, in n-dimensional space, the hyperplane constitutes an -dimensional subspace.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is a hyperplane?

A

The SVM algorithm is a supervised classifier as it uses labeled instances in training to learn how to classify new non-labeled instances.The SVM classifier finds the maximum margin hyperplane in the training data to classify non-labeled instances in the testing phase.The hyperplane maximizes the margin between data points of differing non-classes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What are the different methonds in SVM?

A
  • classification hard margin - classification soft margin primal form - classification soft margin dual form - regression (SVR)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

SVM Algorithm:

A
  1. The separating hyperplane is detected (learned) by maximizing the margin width 2. The margin width is measured based on the perpendicular distance from the separating hyperplane to the support vectors
  2. Large margin ensures good generalization
  3. This method is memory efficient, as it uses only a subset of training points (support vectors)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

How is the HARD margin found?

A

Training the model without training errors.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is required to determine the linear equation of a hyperplane in machine learning?

A

The determination of the hyperplane linear equation requires the calculation of the weight vector w and the displacement value b, such that the margin between the support vectors is maximized by this specific hyperplane. However, it is not always possible to find a hyperplane {represented by w and b }, where all instances are satisfying this optimization formula (hard margin). It pre-supposes that all training instances are on the correct side of the hyperplane, and this case is often not feasible in real-life data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

How does the soft margin in SVM handle data instances that are not perfectly linearly separable?

A

The formula of the hard margin is extended to consider data instances that lie on the wrong side of the margin. This adjusted form of the hard margin is named as the primal form of soft margin. This form allows SVM to classify instances that are almost linearly separable. T

17
Q

What would be the solution to constructing a separating place to not linearly separable data?

A

A possible solution for this problem is to transform the nonlinearly separable data to linearly separable data. This transformation typically involves increasing the number of dimensions in the feature space of the data. The decision boundary that can separate between the two classes is a circle. Accordingly, a new dimension Z is added to the two-dimensional feature vector (X,Y) , to form a three-dimensional space instead of a two-dimensional space. PROBLEMS: Overfitting is the first problem that is caused by the curse of dimensionality. The second problem is the high cost in terms of the computational power needed due to the large size of the transformed feature vectors.