Semi-supervised Learning of Tree-Structured RBF Networks Using Co-training

  • Authors:
  • Mohamed F. Abdel Hady;Friedhelm Schwenker;Günther Palm

  • Affiliations:
  • Institute of Neural Information Processing, University of Ulm, Ulm, Germany D-89069;Institute of Neural Information Processing, University of Ulm, Ulm, Germany D-89069;Institute of Neural Information Processing, University of Ulm, Ulm, Germany D-89069

  • Venue:
  • ICANN '08 Proceedings of the 18th international conference on Artificial Neural Networks, Part I
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Supervised learning requires a large amount of labeled data but the data labeling process can be expensive and time consuming. Co-training is a semi-supervised learning method that reduces the amount of required labeled data through exploiting the available unlabeled data in supervised learning to boost the accuracy. It assumes that the patterns are described by multiple independent feature sets and each feature set is sufficient for classification. On the other hand, most of the real-world pattern recognition tasks involve a large number of categories which may make the task difficult. The tree-structured approach is a multi-class decomposition strategy where a complex multi-class problem is decomposed into tree structured binary sub-problems. In this paper, we propose a framework that combines the tree-structured approach with Co-training. We show that our framework is especially useful for classification tasks involving a large number of classes and a small amount of labeled data where the tree-structured approach does not perform well by itself and when combined with Co-training, the unlabeled data boosts its accuracy.