引導式測驗 · 硬 等級
支援向量機測驗
查看硬邊距分離、軟邊距支援向量、內核、C、RBF 相似性、高維度使用、伽瑪和特徵縮放。
問題 1 的 8
For linearly separable binary data, what geometric quantity does a hard-margin SVM seek to maximize?
預覽每個問題8 問題
當您參加測驗時,就會出現答案和解釋。
- 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
- 哪個內核通常用於創建靈活的彎曲邊界?
- JPEG 內核
- 徑向基底函數 (RBF) 內核
- TCP 核心
- 字母內核
- 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