Resampling vs Reweighting in Boosting a Relational Weak Learner

  • Authors:
  • Marco Botta

  • Affiliations:
  • -

  • Venue:
  • AI*IA 01 Proceedings of the 7th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Boosting is a powerful and thoroughly investigated learning technique that improves the accuracy of any given learning algorithm by weighting training examples and hypotheses. Several authors contributed to the general boosting learning framework with theoretical and experimental results, mainly in the propositional learning framework. In a previous paper, we investigated the applicability of Freund and Schapire's AdaBoost.M1 algorithm to a first order logic weak learner. In this paper, we extend the weak learner in order to directly deal with weighted instances and compare two ways to apply boosting to such a weak learner: resampling instances at each round and using weighted instances.