Network game and boosting

  • Authors:
  • Shijun Wang;Changshui Zhang

  • Affiliations:
  • State Key Laboratory of Intelligent Technology and Systems, Department of Automation, Tsinghua University, Beijing, China;State Key Laboratory of Intelligent Technology and Systems, Department of Automation, Tsinghua University, Beijing, China

  • Venue:
  • ECML'05 Proceedings of the 16th European conference on Machine Learning
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose an ensemble learning method called Network Boosting which combines weak learners together based on a random graph (network). A theoretic analysis based on the game theory shows that the algorithm can learn the target hypothesis asymptotically. The comparison results using several datasets of the UCI machine learning repository and synthetic data are promising and show that Network Boosting has much resistance to the noisy data than AdaBoost through the cooperation of classifiers in the classifier network.