题目2551 · 机器学习
Why Pre-Pruning Can Miss a Good Two-Step Split 9
Why can an aggressive pre-pruning rule reject a first split that looks weak locally even though it would unlock a much better second-level structure?
打开 →找到 4 个结果
中文题目题目2565 · 机器学习
Validation Pruning With an Alpha Charge 23
Replacing a single leaf by a 3-leaf subtree reduces validation loss by 4.5. If the complexity charge is alpha = 1.2 per extra leaf, should you keep the subtree?
打开 →题目2566 · 机器学习
Choose the Weakest-Link Node to Prune 24
Node A would have leaf error 12 if pruned, while its current subtree has error 7 and 3 leaves. Node B would have leaf error 9 if pruned, while its current subtree has error 6 and 2 leaves. Which node is the weaker link and should be pruned first under cost-complexity pruning?
打开 →题目2547 · 机器学习
Numeric Weakest-Link Alpha 16
A node has leaf error 18 if pruned into a single leaf. Its current subtree has training error 10 and 3 leaves. What is the weakest-link alpha for pruning this subtree?
打开 →