Quiz collegato alla guida · Medio Livello
Entropy and Information Gain Quiz
Checks binary entropy, weighted child impurity, a numerical information-gain example, greedy splits, overfitting, and limits of the metric.
Domanda 1 di 8
Usando logaritmi in base due, qual è l'entropia di un nodo con etichette sì e no in pari quantità?
Anteprima di ogni domanda8 domande
Le risposte e le spiegazioni vengono visualizzate mentre rispondi al quiz.
- Usando logaritmi in base due, qual è l'entropia di un nodo con etichette sì e no in pari quantità?
- A value determined only by the feature scale
- Zero bits because the classes cancel
- Two bits because there are two labels
- One bit
- Un nodo figlio contiene solo una classe. Qual è la sua entropia di etichetta?
- It equals the parent entropy
- Zero, because its class label is pure
- It grows with the feature's units
- One bit for every example in the node
- Perché le entropie dei figli sono pesate per la dimensione del figlio quando si calcola il guadagno di informazione?
- To give every child equal influence regardless of sample count
- To use a child's entropy itself as its numerical weight
- Each child should contribute in proportion to the examples it contains
- To sum child impurities without normalizing for parent size
- Un padre binario equilibrato ha un bit di entropia. Due figli di dimensioni uguali hanno ciascuno circa 0,811 bit. Qual è il guadagno della divisione?
- About 0.189 bits, the parent minus weighted children
- One bit, because the parent is balanced
- About 1.811 bits, the sum of parent and child entropy
- About 0.811 bits, the average child entropy
- In un nodo, cosa cerca un albero di classificazione basato sull'entropia tra le divisioni candidate?
- The feature with the largest raw numeric values
- A large local reduction in weighted label impurity
- The split with the most children regardless of labels
- The feature with the strongest causal effect
- Why does the largest training-set information gain at a node not guarantee the best deployed tree?
- The choice is local and may overfit small training groups
- Information gain is always negative for useful splits
- All candidate features necessarily yield identical gain
- A high-gain split proves future outcomes are deterministic
- A split sharply separates historical labels using a location proxy. What does high information gain fail to establish?
- That the training labels were divided into children
- That the children have a weighted entropy
- That the split reduced the observed label mixture
- That the feature is causal, appropriate, or fair to use
- If a team switches from base-two logs to another log base for every candidate at the same node, what happens?
- The training labels change
- Only pure-node entropy becomes positive
- Gain values rescale, but the candidate ranking stays the same
- Information gain stops requiring child-size weights