Visualiseer de maximalemarge-scheider

In deze oefening voeg je de maximalemarge-scheider toe aan de spreidingsplot die je in een eerdere oefening hebt gemaakt. De plot is rechts opnieuw weergegeven.

Deze oefening maakt deel uit van de cursus

Support Vector Machines in R

Cursus bekijken

Oefeninstructies

Maak een dataframe genaamd separator met de maximalemarge-scheider. Deze staat in de variabele mm_separator (voer mm_separator uit om hem te bekijken)
Gebruik het aangemaakte dataframe om de maximalemarge-scheider toe te voegen aan de spreidingsplot van het suikergehalte uit de eerdere oefening en toon het resultaat.

Praktische interactieve oefening

Probeer deze oefening eens door deze voorbeeldcode in te vullen.

#create data frame containing the maximum margin separator
separator <- data.frame(sep = ___)

#add ggplot layer 
plot_sep <- plot_ + geom_point(data = ___, aes(x = ___, y = 0), color = "blue", size = 4)

#display plot
plot_sep

Code bewerken en uitvoeren

Deze oefening maakt deel uit van de cursus

Support Vector Machines in R

SkillTag.level.intermediateSkillTag.label

4.9+

Begin de cursus gratis

This chapter introduces some key concepts of support vector machines through a simple 1-dimensional example. Students are also walked through the creation of a linearly separable dataset that is used in the subsequent chapter.

Exercise 1: Suikergehalte van frisdranken Exercise 2: Een gegevensset met suikergehalte visualiseren Exercise 3: Beslissingsgrenzen herkennen Exercise 4: Zoek de scheider met maximale marge Exercise 5: Visualiseer de maximalemarge-scheider

Huidige oefening

Exercise 6: Een lineair te scheiden gegevensset genereren Exercise 7: Genereer een 2D uniform verdeelde gegevensset.Exercise 8: Maak een beslissingsgrens Exercise 9: Voeg een marge toe aan de gegevensset

Introduces students to the basic concepts of support vector machines by applying the svm algorithm to a dataset that is linearly separable. Key concepts are illustrated through ggplot visualisations that are built from the outputs of the algorithm and the role of the cost parameter is highlighted via a simple example. The chapter closes with a section on how the algorithm deals with multiclass problems.

Exercise 1: Linear Support Vector Machines Exercise 2: Creating training and test datasets Exercise 3: Building a linear SVM classifier Exercise 4: Exploring the model and calculating accuracy Exercise 5: Visualizing Linear SVMs Exercise 6: Visualizing support vectors using ggplot Exercise 7: Visualizing decision & margin bounds using `ggplot2`Exercise 8: Visualizing decision & margin bounds using `plot()`Exercise 9: Tuning linear SVMs Exercise 10: Tuning a linear SVM Exercise 11: Visualizing decision boundaries and margins Exercise 12: When are soft margin classifiers useful?Exercise 13: Multiclass problems Exercise 14: A multiclass classification problem Exercise 15: Iris redux - a more robust accuracy.

Provides an introduction to polynomial kernels via a dataset that is radially separable (i.e. has a circular decision boundary). After demonstrating the inadequacy of linear kernels for this dataset, students will see how a simple transformation renders the problem linearly separable thus motivating an intuitive discussion of the kernel trick. Students will then apply the polynomial kernel to the dataset and tune the resulting classifier.

Exercise 1: Generating a radially separable dataset Exercise 2: Generating a 2d radially separable dataset Exercise 3: Visualizing the dataset Exercise 4: Linear SVMs on radially separable data Exercise 5: Linear SVM for a radially separable dataset Exercise 6: Average accuracy for linear SVM Exercise 7: The kernel trick Exercise 8: Visualizing transformed radially separable data Exercise 9: SVM with polynomial kernel Exercise 10: Tuning SVMs Exercise 11: Using `tune.svm()`Exercise 12: Building and visualizing the tuned model

Builds on the previous three chapters by introducing the highly flexible Radial Basis Function (RBF) kernel. Students will create a "complex" dataset that shows up the limitations of polynomial kernels. Then, following an intuitive motivation for the RBF kernel, students see how it addresses the shortcomings of the other kernels discussed in this course.

Exercise 1: Generating a complex dataset Exercise 2: Generating a complex dataset - part 1 Exercise 3: Generating a complex dataset - part 2 Exercise 4: Visualizing the dataset Exercise 5: Motivating the RBF kernel Exercise 6: Linear SVM for complex dataset Exercise 7: Quadratic SVM for complex dataset Exercise 8: The RBF Kernel Exercise 9: Polynomial SVM on a complex dataset Exercise 10: RBF SVM on a complex dataset Exercise 11: Tuning an RBF kernel SVM