Theory 42 (1996) 2118-2132] to construct learning algorithms based on greedy approximations which are universally consistent and provide provable convergence rates for large classes of functions.

This paper considers several "greedy" type algorithms based on grouping parts according to exact matching of field lives. Then, a generalization is presented which allows approximate matches. The ...