GitHub user NathanHowell opened a pull request:
https://github.com/apache/spark/pull/8246
[SPARK-10064] [ML] Parallelize decision tree bin split calculations
Reimplement `DecisionTree.findSplitsBins` via `RDD` to parallelize bin
calculation.
With large feature spaces the current implementation is very slow. This
change limits the features that are distributed (or collected) to just the
continuous features, and performs the split calculations in parallel. It
completes on a real multi terabyte dataset in less than a minute instead of
multiple hours.
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/NathanHowell/spark SPARK-10064
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/spark/pull/8246.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #8246
----
commit 93c9e71f6c62b122647c4bdd2f9dead710ae360f
Author: Nathan Howell <[email protected]>
Date: 2015-08-14T23:39:20Z
[SPARK-10064] [ML] Parallelize decision tree bin split calculations
----
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
