Supervised Learning - Classification Week 7 Challenge

Ans1.

Advantages of SVMs

SVMs are powerful machine learning algorithms that have the following advantages:

·        Effective in high-dimensional spaces. High-dimensional data refers to data in which the number of features is larger than the number of observations, i.e., data points. SVMs perform well even when the number of features is larger than the number of samples. They can handle high-dimensional data efficiently, making them suitable for applications with a large number of features.

·        Resistant to overfitting. SVMs are less prone to overfitting compared to other algorithms, like decision trees -- overfitting is where a model performs extremely well on the training data but becomes too specific to that data and can't generalize to new data. SVMs' use of the margin maximization principle helps in generalizing well to unseen data.

·        Versatile. SVMs can be applied to both classification and regression problems. They support different kernel functions, enabling flexibility in capturing complex relationships in the data. This versatility makes SVMs applicable to a wide range of tasks.

·        Effective in cases of limited data. SVMs can work well even when the training data set is small. The use of support vectors ensures that only a subset of data points influences the decision boundary, which can be beneficial when data is limited.

·        Ability to handle nonlinear data. SVMs can implicitly handle non-linearly separable data by using kernel functions. The kernel trick enables SVMs to transform the input space into a higher-dimensional feature space, making it possible to find linear decision boundaries.

Disadvantages of SVMs

While support vector machines are popular for the reasons listed above, they also come with some limitations and potential issues:

·        Computationally intensive. SVMs can be computationally expensive, especially when dealing with large data sets. The training time and memory requirements increase significantly with the number of training samples.

·        Sensitive to parameter tuning. SVMs have parameters such as the regularization parameter and the choice of kernel function. The performance of SVMs can be sensitive to these parameter settings. Improper tuning can lead to suboptimal results or longer training times.

·        Lack of probabilistic outputs. SVMs provide binary classification outputs and do not directly estimate class probabilities. Additional techniques, such as Platt scaling or cross-validation, are needed to obtain probability estimates.

·        Difficulty in interpreting complex models. SVMs can create complex decision boundaries, especially when using nonlinear kernels. This complexity may make it challenging to interpret the model and understand the underlying patterns in the data.

·        Scalability issues. SVMs may face scalability issues when applied to extremely large data sets. Training an SVM on millions of samples can become impractical due to memory and computational constraints.