View in EDS

An analysis of boosted ensembles of binary fuzzy decision trees.

Saved in:
Bibliographic Details
Title: An analysis of boosted ensembles of binary fuzzy decision trees.
Authors: Barsacchi, Marco1 (AUTHOR), Bechini, Alessio1 (AUTHOR) alessio.bechini@unipi.it, Marcelloni, Francesco1 (AUTHOR) francesco.marcelloni@unipi.it
Source: Expert Systems with Applications. Sep2020, Vol. 154, pN.PAG-N.PAG. 1p.
Subjects: Decision trees, Expert systems
Abstract: • 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. 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. [ABSTRACT FROM AUTHOR]
Copyright of Expert Systems with Applications is the property of Pergamon Press - An Imprint of Elsevier Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 143418147
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: An analysis of boosted ensembles of binary fuzzy decision trees.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Barsacchi%2C+Marco%22">Barsacchi, Marco</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Bechini%2C+Alessio%22">Bechini, Alessio</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> alessio.bechini@unipi.it</i><br /><searchLink fieldCode="AR" term="%22Marcelloni%2C+Francesco%22">Marcelloni, Francesco</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> francesco.marcelloni@unipi.it</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Expert+Systems+with+Applications%22">Expert Systems with Applications</searchLink>. Sep2020, Vol. 154, pN.PAG-N.PAG. 1p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Decision+trees%22">Decision trees</searchLink><br /><searchLink fieldCode="DE" term="%22Expert+systems%22">Expert systems</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: • 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. 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. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Expert Systems with Applications is the property of Pergamon Press - An Imprint of Elsevier Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=143418147
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.eswa.2020.113436
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 1
        StartPage: N.PAG
    Subjects:
      – SubjectFull: Decision trees
        Type: general
      – SubjectFull: Expert systems
        Type: general
    Titles:
      – TitleFull: An analysis of boosted ensembles of binary fuzzy decision trees.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Barsacchi, Marco
      – PersonEntity:
          Name:
            NameFull: Bechini, Alessio
      – PersonEntity:
          Name:
            NameFull: Marcelloni, Francesco
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 09
              Text: Sep2020
              Type: published
              Y: 2020
          Identifiers:
            – Type: issn-print
              Value: 09574174
          Numbering:
            – Type: volume
              Value: 154
          Titles:
            – TitleFull: Expert Systems with Applications
              Type: main
ResultId 1