mahout-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Ted Dunning <ted.dunn...@gmail.com>
Subject Re: What's the difference between classic decision tree and Mahout Decision forest algorithm?
Date Thu, 07 Jul 2011 15:48:31 GMT
The summary of the reason is that this was a summer project and
parallelizing the random forest algorithm at all was a big enough project.

Writing a single pass on-line algorithm was considered a bit much for the
project size.  Figuring out how to make multiple passes through an input
split was similarly out of scope.

If you have a good alternative, this would be of substantial interest
because it could improve the currently limited scalability of the decision
forest code.

On Thu, Jul 7, 2011 at 8:20 AM, Xiaobo Gu <guxiaobo1982@gmail.com> wrote:

> Why can't a tree be built against a dataset resides on the disk as
> long as we can read it ?
>

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message