À suivreGuide suivant
Projets de classe de machines enseignables
Fondamentaux
GUIDE des fondamentaux
Support vector machines are supervised methods whose classification formulations balance a separating margin with fitting the training labels.
Écoutez ce guideNarré par l'IA · ~3 min
Kernels can provide nonlinear decision functions, while regularization and evaluation determine their usefulness for a particular dataset.
For linearly separable binary training data, a hard-margin SVM seeks a separating hyperplane with a large geometric margin. The formulation should be distinguished from a soft-margin SVM, which permits margin violations and uses a penalty controlled by C. A violation can include a point inside the margin even if its class is predicted correctly, so it is broader than misclassification alone. The kernel SVC decision function uses support vectors, training examples with nonzero dual coefficients. In a soft-margin model, those examples need not be only the nearest correctly classified points: margin-violating and misclassified examples can contribute. Kernel functions replace certain inner products in the formulation. They allow a decision function that is linear in an implicit feature space to be nonlinear in the original inputs. This does not prove that every possible dataset becomes perfectly separable or that kernel computation is always inexpensive. The radial basis function, or RBF kernel, measures similarity through squared input distance. Its gamma parameter affects the range of influence: larger gamma makes similarity fall more rapidly with distance, yielding a more localized influence. C controls the penalty assigned to violations relative to the regularization term, while the resulting boundary depends on data and both parameters. Scaling features can change distances and optimization geometry, making preprocessing important to assess. SVMs can be useful candidates in high-dimensional settings, including cases with more features than examples. That observation is not a guarantee of generalization, and kernel selection and regularization remain important.
Classification du texte et du spam, où les documents comportent des milliers de caractéristiques de mots mais des exemples limités.
Classification d'images sur de petits ensembles de données avant que l'apprentissage profond ne devienne dominant.
Classification du cancer et de l'expression génique en bioinformatique avec de nombreuses fonctionnalités et peu d'échantillons.
Reconnaissance de chiffres manuscrits, une référence SVM classique sur l'ensemble de données MNIST.
SVM formulations can be compared with other classifiers for defined sample sizes, feature representations, and resource constraints. A linear implementation and a kernel SVC can have different computational and output properties, so reports should identify which was used. Evaluation should include selected regularization, kernel parameters, preprocessing, and held-out performance. High-dimensional data can make an SVM worth testing, while small sample size alone does not ensure reliable predictions. A clear mathematical objective provides a useful baseline for comparison without establishing universal superiority over neural networks or tree ensembles.
Newsletter gratuite
Trois histoires d'IA vérifiées chaque matin de la semaine, écrites dans un anglais simple. Gratuit pour toujours, sans publicité.
Un e-mail chaque jour de la semaine. Désabonnez-vous en un clic. Nous ne vendons ni ne partageons jamais votre adresse.
Testez-vous
Commentaires instantanés sur chaque réponse et un certificat partageable avec une pièce d'identité vérifiable une fois que vous avez réussi un cours.
Soutenez l’enseignement gratuit de l’IA. AI Understanding est une organisation à but non lucratif 501(c)(3) : pas de publicité, pas de paywall, jamais. Faire un don
Support vector machines are supervised methods whose classification formulations balance a separating margin with fitting the training labels. Kernels can provide nonlinear decision functions, while regularization and evaluation determine their usefulness for a particular dataset.
The hard-margin formulation seeks a large margin subject to separating the stated training classes.
Soft-margin support vectors can include examples inside the margin or on the wrong side of the boundary.
Kernels provide feature-space inner products without requiring explicit coordinates for that representation.
Margin violations include points inside the margin and can include misclassifications; they are not identical to classification error alone.
Le noyau RBF (gaussien) est un noyau par défaut populaire qui mesure la similarité en fonction de la distance, permettant ainsi des limites non linéaires lisses.
Continuez à apprendre
Plus de guides sélectionnés pour ce sujet
À suivreGuide suivant
Projets de classe de machines enseignables
Fondamentaux