Fix △ = k where k ∈ {− 2 , − 1 , 0 , 1 , 2 } . ∀ k ∈ {− 1 , 0 , 1 , 2 } , the value △ = k should be preferred to the value ∆ = k − 1 iff the corresponding Z is smaller, that is :

$$W_{+}\,\times\,e^{-\,{\frac{k}{2}}}+W_{-}\,\times\,e^{\,{\frac{k}{2}}}\;\;<\;\;\;W_{+}\,\times\,e^{-\,{\frac{k-1}{2}}}+W_{-}\,\times\,e^{\,{\frac{k-1}{2}}}\;\;.$$
$W_{\,+\,}\times\,\frac{1}{e^{\frac{h}{k}}}$
$$\left(33\right)$$

Rearranging terms gives W_ < W+ x 

## References

Bauer, E., & Kohavi, R. (1999). An empirical comparison of voting classification algorithms:
Bagging, boosting, and variants. Machine Learning, 36, 105–139.

Blake, C. L., Keogh, E., & Merz, C. (1998). UCI repository of machine learning databases..

http://www.ics.uci.edu/~mlearn/MLRepository.html.

Breiman, L. (1996). Bagging predictors. Machine Learning, 24, 123–140.

Breiman, L., Freidman, J. H., Olshen, R. A., & Stone, C. J. (1984).  Classification and Regression Trees. Wadsworth.

Buja, A., & Lee, Y.-S. (2001). Data mining criteria for tree-based regression and classification. In Proceedings of the Xh International Conference on Knowledge Discovery in Databases, pp. 27-36.

Buntine, W., & Niblett, T. (1992). A further comparison of splitting rules for Decision-Tree induction. Machine Learning, 8, 75-85.

Clark, P., & Boswell, R. (1991). Rule induction with CN2: some recent improvements. In Proceedings of the 6 th European Working Session in Learning, pp. 155-161.

Cohen, W. W., & Singer, Y. (1999). A Simple, Fast and Effective Rule Learner. In Proceedings of the 1 H  National Conference on Artificial Intelligence, pp. 335–342.

de Carvalho Gomes, F. A., & Gascuel, O. (1994). SDL, a stochastic algorithm for learning decision lists with limited complexity. Annals of Mathematics and Artificial Intelligence, 10, 281-302.

Dietterich, T. G. (200). An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, 40, 139-157.

Domingos, P. (1998). A Process-oriented Heuristic for Model selection. In Proceedings of the 15 th International Conference on Machine Learning, pp. 127-135.

Feige, U. (1996). A threshold of In n for approximating set cover. In Proceedings of the 28 th  ACM Symposium on the Theory of Computing, pp. 314–318.

Franck, E., & Witten, I. (1998). Using a Permutation Test for Attribute selection in Decision Trees. In Proceedings of the 15 th International Conference on Machine Learning, pp.

152-160.

Freund, Y., & Mason, L. (1999). The alternating decision tree learning algorithm. In Proceedings of the 16 ih International Conference on Machine Learning, pp. 124–133.