For many classiication tasks, the set of available task instances can be roughly divided into regular instances and exceptions. We investigate three learning algorithms that apply a diierent method of learning with respect to regularities and exceptions, viz. (i) back-propagation, (ii) cascade back-propagation (a constructive version of back-propagation), and (iii) information-gain tree (an ind...