Kuis terkait panduan · Mudah Tingkat

Kuis Klasifikasi Teks

Uji penetapan label teks, tugas multi-label, ketidakseimbangan, penarikan kembali, penggunaan zero-shot khusus tugas, penyematan, aritmatika presisi, dan skor keluaran.

Jalur panduan terkaitKlasifikasi Teks
Pertanyaan 1 dari 8

How does a text classifier structure the output for an input document?

Pratinjau setiap pertanyaan8 pertanyaan

Jawaban dan penjelasan muncul saat Anda mengikuti kuis.

  1. How does a text classifier structure the output for an input document?
    • By necessarily translating it into another language
    • By assigning one or more predefined category labels
    • By generating only a new unrelated paragraph
    • By changing its compressed file format
  2. Skenario manakah yang merupakan contoh klasifikasi multi-label?
    • Menandai email sebagai spam atau bukan spam
    • Merutekan tiket ke satu departemen saja
    • Memilih peringkat bintang tunggal
    • Menandai artikel dengan 'politik' dan 'ekonomi' sekaligus
  3. On a text dataset dominated by one class, what can a high overall accuracy conceal?
    • An inability to calculate any metric
    • Proof that recall equals one for every category
    • Failure to identify cases of a rare class
    • A guarantee that every minority example is correct
  4. Apa yang diukur dengan recall dalam tugas klasifikasi?
    • Berapa banyak kasus nyata yang berhasil ditangkap oleh sistem
    • Berapa banyak item yang ditandai yang benar
    • Seberapa cepat model berjalan
    • Seberapa besar modelnya
  5. In task-specific zero-shot text classification, what is absent for the new classification task?
    • All model pretraining of any kind
    • Every description of the candidate categories
    • The ability to use any learned representation
    • Labeled training examples for that task
  6. How can learned text embeddings contribute to a classification pipeline?
    • They guarantee perfect predictions on every new domain
    • They provide numerical features used to compute label scores
    • They delete every grammatical distinction by definition
    • They replace all label definitions with filenames
  7. A stated text-classification evaluation has six true positives and two false positives. What is precision for the designated positive class?
    • 75 percent
    • 25 percent
    • 100 percent
    • Six percent
  8. Which output-score design permits several text labels to score highly at once rather than requiring scores to sum to one?
    • A single softmax over mutually exclusive classes
    • A rule requiring exactly one positive label
    • A separate sigmoid output for each label
    • A filename-only representation without label scores