Dual Strategy Active Learning

  • Authors:
  • Pinar Donmez;Jaime G. Carbonell;Paul N. Bennett

  • Affiliations:
  • School of Computer Science, Carnegie Mellon University, 5000 Forbes Ave, Pittsburgh PA, 15213, USA;School of Computer Science, Carnegie Mellon University, 5000 Forbes Ave, Pittsburgh PA, 15213, USA;Microsoft Research, 1 Microsoft Way, Redmond, WA 98052, USA

  • Venue:
  • ECML '07 Proceedings of the 18th European conference on Machine Learning
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Active Learning methods rely on static strategies for sampling unlabeled point(s). These strategies range from uncertainty sampling and density estimation to multi-factor methods with learn-once-use-always model parameters. This paper proposes a dynamic approach, called DUAL, where the strategy selection parameters are adaptively updated based on estimated future residual error reduction after each actively sampled point. The objective of dual is to outperform static strategies over a large operating range: from very few to very many labeled points. Empirical results over six datasets demonstrate that DUAL outperforms several state-of-the-art methods on most datasets.