An analysis of boosted ensembles of binary fuzzy decision trees. (15th September 2020)

• Record Type: Journal Article
• Authors: Barsacchi, Marco; Bechini, Alessio; Marcelloni, Francesco
• Is Part Of: Expert systems with applications. Volume 154(2020)
• Publication Date: 2020-09-15
• Subjects: Ensemble classifiers -- Boosting -- Fuzzy characterization -- Fuzzy decision trees -- Rule-based classifiers; Expert systems (Computer science) -- Periodicals; Systèmes experts (Informatique) -- Périodiques; Electronic journals; 006.33
• DOI: 10.1016/j.eswa.2020.113436
• Languages: English
• ISSNs: 0957-4174

Abstract

Highlights: An approach to boosting with fuzzy binary decision trees. Experimental analysis and extensive comparison with other fuzzy classifiers. Study of the parametrization through a convergence analysis. Abstract: Classification is a functionality that plays a central role in the development of modern expert systems, across a wide variety of application fields: using accurate, efficient, and compact classification models is often a prime requirement. Boosting (and AdaBoost in particular) is a well-known technique to obtain robust classifiers from properly-learned weak classifiers, thus it is particularly attracting in many practical settings. Although the use of traditional classifiers as base learners in AdaBoost has already been widely studied, the adoption of fuzzy weak learners still requires further investigations. In this paper we describe FDT-Boost, a boosting approach shaped according to the SAMME-AdaBoost scheme, which leverages fuzzy binary decision trees as multi-class base classifiers. Such trees are kept compact by constraining their depth, without lowering the classification accuracy. The experimental evaluation of FDT-Boost has been carried out using a benchmark containing eighteen classification datasets. Comparing our approach with FURIA, one of the most popular fuzzy classifiers, with a fuzzy binary decision tree, and with a fuzzy multi-way decision tree, we show that FDT-Boost is accurate, getting to results that are statistically better than those achieved by the other approaches. Moreover, compared to a crisp SAMME-AdaBoost implementation, FDT-Boost shows similar performances, but the relative produced models are significantly less complex, thus opening up further exploitation chances also in memory-constrained systems.