algorithm - 减少错误修剪算法

Question

我对此算法有疑问：

Partition training data in “grow” and “validation” sets.
Build a complete tree from the “grow” data.
Until accuracy on validation set decreases do:
    For each non-leaf node, n, in the tree do:
        Temporarily prune the subtree below n and replace it with a leaf labeled with
                                              the current majority class at that node.
        Measure and record the accuracy of the pruned tree on the validation set.
    Permanently prune the node that results in the greatest increase in accuracy on the
                                                                         validation set.

我不明白“永久修剪可以最大程度提高验证集准确性的节点”部分。我们应该保留提高准确性的节点并修剪那些增加错误率的节点。我错了吗？

Answer 1

我什至不知道该算法适用于哪个领域，但据我了解，提高准确性的节点是未被修剪的节点，因此您引用的短语没有矛盾。也许可以改写

永久修剪在修剪时会导致验证集准确性最大提高的节点

让它更清楚。