N-learners problem: Fusion of concepts.

摘要

We are given N learners each capable of learning concepts (subsets) of a domain set X in the sense of Valiant, i.e. for any c (element of) C (improper subset) 2(sup X), given a finite set of examples of the form < x(sub 1), M(sub c)(x(sub 1)) >; < x(sub 2 ...