• DocumentCode
    2656036
  • Title

    A New Ensemble Learning Algorithm Based on Improved K-Means for Training Neural Network Ensembles

  • Author

    Gan Zhi-gang ; Xiao Nan-Feng

  • Author_Institution
    Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou
  • fYear
    2009
  • fDate
    23-25 Jan. 2009
  • Firstpage
    8
  • Lastpage
    11
  • Abstract
    The diversity of individual neural network will affect the forecast error of neural network ensemble. In this paper, a new training method for neural network ensemble which is based on the improved K-means algorithm is presented. The space diversity among the sample datasets can be realized by clustering the entire dataset using K-means algorithm. To avoiding the sample subset too simple, the sample subsets are interpolated some samples which are randomly chosen from the entire sample space. By contrast experiments with Boosting and Bagging, the presented learning algorithm is proved that can reduce the prediction error of neural network ensemble and enhance the prediction accuracy.
  • Keywords
    interpolation; learning (artificial intelligence); set theory; K-means algorithm; interpolation; neural network ensemble training method; space diversity; subset; Bagging; Boosting; Clustering algorithms; Computer security; Data security; Informatics; Information security; Information technology; Intelligent networks; Neural networks; K-Means; diversity; learning; neural network ensemble;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Information Technology and Security Informatics, 2009. IITSI '09. Second International Symposium on
  • Conference_Location
    Moscow
  • Print_ISBN
    978-1-4244-3580-7
  • Type

    conf

  • DOI
    10.1109/IITSI.2009.8
  • Filename
    4777537