Using the same derivation in Section 4.2, we obtain the following gain function and update rules: Intuitively, an unlabeled example that has a high-confidence |F (x)| at the current step, will probably receive more weight at the next step.
similar instances become more important when learning and mining subtrees.