Guide-yakabatana mibvunzo · Pakati Nhanho

Linear Discriminant Analysis Quiz

Ongorora kurongwa kweLDA uye fungidziro, zvakagovaniswa-covariance fungidziro, zvimiro zverusarura, uye mutsauko kubva kuPCA.

Nzira dzekutungamira dzinoenderanaLinear Discriminant Analysis
Mubvunzo 1 ye 8

Sei zvakajairwa LDA kupatsanura kuburitsa mutsara sarudzo miganhu?

Tarisa mubvunzo wese8 mibvunzo

Mhinduro uye tsananguro zvinoonekwa paunenge uchitora bvunzo.

  1. Sei zvakajairwa LDA kupatsanura kuburitsa mutsara sarudzo miganhu?
    • It uses class-specific covariance matrices in every case
    • It maximizes total feature variance without labels
    • Classes share a covariance matrix in its usual Gaussian model
    • It ignores class priors whenever class sizes differ
  2. Ko LDA inosarudza sei maratidziro muchikamu chayo chakatariswa chekudzikisa?
    • Maximize total variance without labels
    • Favor class separation relative to within-class variation
    • Choose features only by their marginal variance
    • Keep only the original columns with largest means
  3. Nemakirasi eK uye kanenge K kubvisa imwe chete yekuisa maficha, chii chepamusoro chinoshanda kune nhamba yeanobatsira LDA yekusarura nzira?
    • K squared
    • K
    • The number of observations
    • K minus one
  4. Which objective does PCA optimize in contrast to LDA?
    • High overall variance without using class labels
    • Class posterior probability
    • Maximum class separation using labels
    • Minimum classification error at every threshold
  5. Ndeipi nzira yakaderera-yakasiyana-siyana inogona kuve yakakosha kuLDA?
    • When it has the smallest variance regardless of labels
    • Only when PCA has already chosen it
    • When it separates labeled classes
    • Only when every class has the same mean on it
  6. Ndedzipi shanduko muquadratic discriminant analysis ichienzaniswa neyakajairwa LDA?
    • Each class must have the same prior probability
    • Each class may have its own covariance matrix
    • Every class mean is constrained to be equal
    • All quadratic terms are removed from the class comparison
  7. Why can LDA be numerically difficult when features greatly outnumber examples?
    • The number of classes must automatically become larger
    • Class priors cannot be estimated from any labeled sample
    • The shared-covariance assumption removes every conditioning problem
    • Covariance estimates may be singular or unstable
  8. A plot shows separated training groups after LDA projection. What has not yet been established?
    • Reliable generalization on held-out data
    • That labels influenced the projection
    • That a projection was computed
    • That classes were present in training