Gentle AdaBoost Algorithm with Score Function Dependent on the Distance to Decision Boundary
- 409 Downloads
This paper presents a new extension of Gentle AdaBoost algorithm based on the distance of the object to the decision boundary, which is defined by the weak classifier used in boosting. In the proposed approach this distance is transformed by Gaussian function and defines the value of a score function. The assumed form of transforming functions means that the objects closest or farthest located from the decision boundary of the basic classifier have the lowest value of the scoring function. The described algorithm was tested on four data sets from UCI repository and compared with Gentle AdaBoost algorithm.
KeywordsGentle AdaBoost algorithm Distance to the decision boundary Score function
This work was supported in part by the National Science Centre, Poland under the grant no. 2017/25/B/ST6/01750.
- 2.Burduk, R.: The AdaBoost algorithm with the imprecision determine the weights of the observations. In: Nguyen, N.T., Attachoo, B., Trawiński, B., Somboonviwat, K. (eds.) ACIIDS 2014. LNCS (LNAI), vol. 8398, pp. 110–116. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-05458-2_12CrossRefGoogle Scholar
- 5.Freund, Y., Schapire, R.: Experiments with a new boosting algorithm. In: Proceedings of the Thirteenth International Conference on Machine Learning, Bari, Italy, pp. 148–156 (1996)Google Scholar
- 10.Szenkovits, A., Meszlényi, R., Buza, K., Gaskó, N., Lung, R.I., Suciu, M.: Feature selection with a genetic algorithm for classification of brain imaging data. In: Stańczyk, U., Zielosko, B., Jain, L.C. (eds.) Advances in Feature Selection for Data and Pattern Recognition. ISRL, vol. 138, pp. 185–202. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-67588-6_10CrossRefGoogle Scholar
- 12.Dmitrienko, A., Chuang-Stein, C.: Pharmaceutical Statistics Using SAS: A Practical Guide. SAS Press, Cary (2007)Google Scholar