引導式測驗 · 簡單 等級

基尼雜質測驗

計算節點雜質和加權分割增益,然後將基尼的局部建樹作用與預測評估區分開來。

相關引導路徑基尼雜質
問題 1 的 8

A binary node has class proportions 0.8 and 0.2. What is its Gini impurity?

預覽每個問題8 問題

當您參加測驗時,就會出現答案和解釋。

  1. A binary node has class proportions 0.8 and 0.2. What is its Gini impurity?
    • 0.32
    • 0.20
    • 0.64
    • 0.80
  2. Which value describes impurity in a node containing only one class?
    • 0.5
    • 0
    • 1
    • It depends on the number of predictors
  3. How should child impurities be combined when evaluating a candidate split?
    • Add child scores without considering child sizes
    • Take the largest child impurity only
    • Weight each child by its share of the parent observations
    • Use only the purity of the smallest child
  4. What does a Gini decrease represent in tree construction?
    • The probability that a feature is causal
    • The fraction of training labels predicted incorrectly on test data
    • The number of classes in the target
    • Parent impurity minus weighted child impurity
  5. For two equally common classes in a binary node, what is Gini impurity?
    • 0
    • 0.5
    • 0.25
    • 1
  6. Which distinction between Gini and entropy is accurate?
    • Entropy is a distance between predictor vectors
    • Gini evaluates held-out accuracy while entropy builds trees
    • They are different local impurity criteria with different scales
    • Gini is always numerically larger for every split
  7. A deep tree has nearly pure training leaves. What should be checked before concluding it generalizes well?
    • Whether every feature has a positive value
    • Whether every leaf has zero entropy only
    • The alphabetical order of class labels
    • Performance on appropriately held-out data
  8. What does node-local Gini impurity describe?
    • Class mixing among observations in that node
    • The global class balance in every dataset
    • The probability the fitted model is calibrated
    • Feature importance across all possible models