On Learning Unions of Pattern Languages and Tree Patterns in the Mistake Bound Model, Authors: Sally A. Goldman and Stephen S. Kwek Email: sg@cs.wustl.edu Source: Theoretical Computer Science Vol. 288, Issue 2, 17 September 2002, pp. 237 - 254. Abstract. We present efficient on-line algorithms for learning unions of a constant number of tree patterns, unions of a constant number of one-variable pattern languages, and unions of a constant number of pattern languages with fixed length substitutions. By fixed length substitutions we mean that each occurrence of variable xi must be substituted by terminal strings of fixed length l(xi). We prove that if arbitrary unions of pattern languages with fixed length substitutions can be learned efficiently then DNFs are efficiently learnable in the mistake bound model. Since we use a reduction to Winnow, our algorithms are robust against attribute noise. Furthermore, they can be modified to handle concept drift. Also, our approach is quite general and we give results to learn a class that generalizes pattern languages.

©Copyright 2002 Elsevier Science B.V.