Kuiz berkaitan panduan · Sederhana Tahap
One-vs-Rest and One-vs-One Strategies Quiz
Tests OvR and OvO classifier counts, score comparison and voting, plus when pairwise models can suit kernel methods with costly fits.
soalan 1 daripada 8
Untuk masalah pengelasan dengan 6 kelas, berapa banyak pengelas binari yang dilatih oleh strategi satu lawan rehat?
Pratonton setiap soalan8 soalan
Jawapan dan penjelasan muncul semasa anda mengambil kuiz.
- Untuk masalah pengelasan dengan 6 kelas, berapa banyak pengelas binari yang dilatih oleh strategi satu lawan rehat?
- 15
- 6
- 30
- 36
- Untuk masalah 6 kelas yang sama, berapa banyak pengelas yang dilatih satu lawan satu?
- 6
- 12
- 21
- 15
- Dalam satu lawan rehat, bagaimanakah kelas ramalan akhir dipilih di kalangan pengelas terlatih K?
- The classifier with the highest confidence score
- Majority vote among all classifiers
- The first classifier that returns positive
- Random selection among positives
- Dalam satu lawan satu, bagaimanakah kelas ramalan akhir ditentukan?
- The pairwise classifier trained on the most data wins
- Only the first pairwise classifier's output is used
- Each pairwise classifier casts one vote and the class with the most votes wins
- Classes are ranked by training set size
- Mengapakah OvO secara tradisinya merupakan strategi berbilang kelas lalai untuk mesin vektor sokongan kernel?
- Because it always gives higher accuracy than OvR
- Because each pairwise classifier trains on a smaller subset of data, offsetting having more classifiers
- Because it requires no probability calibration ever
- Because OvR cannot be implemented mathematically for SVMs
- What problem can arise specifically in OvR when comparing scores across the K independently trained classifiers?
- The scores are always identical across classifiers
- The classifiers cannot output any confidence measure
- OvR cannot produce ties
- The raw scores may not be on a comparable scale since each classifier was trained separately
- Which algorithms are described as natively handling multiple classes without needing OvR or OvO wrappers?
- Neural networks and gradient-boosted trees using softmax or multinomial objectives
- Basic support vector machines
- Standard logistic regression solvers restricted to binary output
- None of the algorithms mentioned handle multiclass natively
- A rare category is modeled against all other examples in OvR. What training-data pattern may make that classifier difficult to fit?
- Each classifier sees no negative examples
- Each classifier requires a separate test set
- Each classifier's training set can be highly imbalanced since it pits one class against all others combined
- OvR classifiers cannot be trained in parallel