Very similar, but I was talking about building trees on each split of the data (a la map reduce split).
That would give many small splits and would thus give very different results from bagging because the splits would be small and contigous rather than large and random. On Thu, Jun 18, 2009 at 1:37 AM, deneche abdelhakim <a_dene...@yahoo.fr>wrote: > "build multiple trees for different portions of the data" > > What's the difference with the basic bagging algorithm, which builds 'each > tree' using a different portion (about 2/3) of the data ?
