• DocumentCode
    499057
  • Title

    Improving BAS Committee with ETL Voting

  • Author

    Milidiu, Ruy Luiz ; Duarte, Julio Cesar

  • Author_Institution
    Dept. de Inf., Pontificia Univ. Catolica do Rio de Janeiro, Rio de Janeiro, Brazil
  • Volume
    1
  • fYear
    2009
  • fDate
    12-15 July 2009
  • Firstpage
    61
  • Lastpage
    66
  • Abstract
    Boosting is a machine learning technique that combines several weak classifiers to improve the overall accuracy. A well known algorithm based on boosting is AdaBoost. Boosting at start (BAS) is a boosting framework that generalizes AdaBoost by allowing any initial weight distribution. BAS Committee is a scheme that uses feature clustering to determine the best weight assignments in the BAS framework. One of the drawbacks of BAS committee is its final step which uses a simple majority voting approach over the chosen classifiers. Entropy guided transformation learning (ETL) is a machine learning strategy that combines decision trees and transformation based learning avoiding the explicit need of template design. Here, we present ETL voting BAS committee, a scheme that combines ETL and BAS Committee in order to determine the best combination for the classifiers of the ensemble. Besides that, since no extra assumption is made, ETL voting is generic and can be used in any committee approach. Our empirical findings indicate that the BAS performance can be improved with a new combination of the classifiers determined by ETL voting.
  • Keywords
    decision trees; learning (artificial intelligence); AdaBoost; ETL voting; ETL voting BAS committee; decision trees; entropy guided transformation learning; machine learning technique; of template design; simple majority voting approach; Cybernetics; Machine learning; Voting; BAS; Boosting; Ensemble Algorithms; Machine Learning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Cybernetics, 2009 International Conference on
  • Conference_Location
    Baoding
  • Print_ISBN
    978-1-4244-3702-3
  • Electronic_ISBN
    978-1-4244-3703-0
  • Type

    conf

  • DOI
    10.1109/ICMLC.2009.5212540
  • Filename
    5212540