Gentle AdaBoost Algorithm with Score Function Dependent on the Distance to Decision Boundary

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11703)


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.


Gentle 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.


  1. 1.
    Kearns, M., Valiant, L.: Cryptographic limitations on learning boolean formulae and finite automata. J. Assoc. Comput. Mach. 41(1), 67–95 (1994)MathSciNetCrossRefGoogle Scholar
  2. 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). Scholar
  3. 3.
    Chunhua, S., Hanxi, L.: On the dual formulation of boosting algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 32(12), 2216–2231 (2010)CrossRefGoogle Scholar
  4. 4.
    Oza, N.C.: Boosting with averaged weight vectors. In: Windeatt, T., Roli, F. (eds.) MCS 2003. LNCS, vol. 2709, pp. 15–24. Springer, Heidelberg (2003). Scholar
  5. 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
  6. 6.
    Wozniak, M.: Proposition of boosting algorithm for probabilistic decision support system. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol. 3036, pp. 675–678. Springer, Heidelberg (2004). Scholar
  7. 7.
    Wu, S., Nagahashi, H.: Analysis of generalization ability for different AdaBoost variants based on classification and regression trees. J. Electr. Comput. Eng. 2015, Article ID 835357, 17 pages (2015). Scholar
  8. 8.
    Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3, 1157–1182 (2003)zbMATHGoogle Scholar
  9. 9.
    Rejer, I.: Genetic algorithms for feature selection for brain computer interface. Int. J. Pattern Recogn. Artif. Intell. 29(5), 1559008 (2015)MathSciNetCrossRefGoogle Scholar
  10. 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). Scholar
  11. 11.
    Freund, Y., Schapire, R.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55(1), 119–139 (1997)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Dmitrienko, A., Chuang-Stein, C.: Pharmaceutical Statistics Using SAS: A Practical Guide. SAS Press, Cary (2007)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Faculty of ElectronicWroclaw University of Science and TechnologyWroclawPoland

Personalised recommendations