Re: DM: CHAID vs. CARTŪ

[Mike Muratet]

Ronny Kohavi wrote:

> Since the theory says that it's impossible for one algorithm to
> uniformly beat any other on generalization accuracy in 
>classification
> tasks (where uniformly is for all possible target concepts), the
> question is *when* (under what conditions) one algorithm is better
> than another, not *whether*.
>

Do you have a reference to the paper or book that describes such a 
theory?
Thanks.

Mike