• DocumentCode
    2313777
  • Title

    An empirical comparison of ensemble classification algorithms with support vector machines

  • Author

    Zhong-Hui, W. ; Li, Wan-Gui ; Cai, Yun-Ze ; Xu, Xiao-Ming

  • Author_Institution
    Dept. of Autom., Shanghai Jiao Tong Univ., China
  • Volume
    6
  • fYear
    2004
  • fDate
    26-29 Aug. 2004
  • Firstpage
    3520
  • Abstract
    An ensemble classifier often has better performance than any of the single learned classifiers in the ensemble. In this paper, the trained support vector machine (SVM) classifiers are used as basic classifiers. The ensemble methods for creating ensemble classifier, such as bagging and boosting, etc., are evaluated on two data sets. Some conclusions are obtained. Bagging with SVM can stably improve classification accuracy, while the improvement obtained by boosting with SVM is not obvious. These two methods largely increase space complexity and time complexity. Comparatively, the multiple SVM decision model, training individual SVM classifiers using training subsets obtained by partitioning the original training set, has a better trade-off between the classification accuracy and efficiency.
  • Keywords
    computational complexity; learning (artificial intelligence); neural nets; pattern classification; support vector machines; empirical comparison; ensemble classification algorithms; space complexity; support vector machines; time complexity; training subsets; Artificial neural networks; Bagging; Boosting; Classification algorithms; Classification tree analysis; Decision trees; Machine learning; Machine learning algorithms; Support vector machine classification; Support vector machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
  • Print_ISBN
    0-7803-8403-2
  • Type

    conf

  • DOI
    10.1109/ICMLC.2004.1380399
  • Filename
    1380399