Gids-gekoppelde quiz · Moeilijk Niveau
Ondersteuning van vectormachinesquiz
Bekijk harde-marge-scheiding, zachte-marge-ondersteuningsvectoren, kernels, C, RBF-overeenkomst, hoogdimensionaal gebruik, gamma en functieschaling.
Vraag 1 van 8
For linearly separable binary data, what geometric quantity does a hard-margin SVM seek to maximize?
Bekijk elke vraag8 vragen
Antwoorden en uitleg verschijnen terwijl je de quiz doet.
- For linearly separable binary data, what geometric quantity does a hard-margin SVM seek to maximize?
- The number of deleted training rows
- The image brightness of every input
- The separating margin
- The number of hidden network layers
- Which training examples contribute as support vectors in a kernel soft-margin SVC decision function?
- Only correctly classified points nearest the boundary in every case
- Examples with nonzero dual coefficients, including possible margin violators
- Every training example with exactly equal weight by definition
- Only the class label strings without their feature values
- What computation does a kernel function replace in the SVM formulation?
- All training labels
- The requirement for any input examples
- Every numerical comparison with an alphabetical sort
- Inner products in an implicit feature representation
- What does C weight in a standard soft-margin SVM objective?
- The penalty for margin violations relative to regularization
- The mandatory number of output colors
- The file extension of every training example
- The number of classes in every possible task
- Welke kernel wordt vaak gebruikt om flexibele, gebogen grenzen te creëren?
- De JPEG-kernel
- De radiale basisfunctie (RBF) kernel
- De TCP-kernel
- De alfabetkern
- Which setting makes an SVM a candidate worth evaluating, without guaranteeing its performance?
- Only inputs with no feature representation
- A rule that billions of examples are always inexpensive to fit
- Many input features relative to the number of examples
- Only audio files with no numerical encoding
- With a fixed RBF input distance, what does a larger positive gamma do to similarity decay as distance increases?
- Make it decay more rapidly, producing more localized influence
- Make it decay more slowly, producing a broader range of influence
- Make the similarity equal for all nonzero distances
- Set the penalty for margin violations while leaving similarity unchanged
- Why can changing feature units affect an RBF SVM unless preprocessing addresses the scales?
- RBF compares category order while ignoring coordinate distances
- A constant C automatically cancels every change of feature units
- A learned intercept always standardizes every input coordinate
- The kernel uses distances that depend on feature magnitudes