Details
-
New Feature
-
Status: Resolved
-
Major
-
Resolution: Incomplete
-
1.0.0
-
None
Description
This task involves creating an alternate approximate random forest implementation where each tree is constructed per partition.
The tasks involves:
- Justifying with theory and experimental results why this algorithm is a good choice.
- Comparing the various tradeoffs and finalizing the algorithm before implementation
- Code implementation
- Unit tests
- Functional tests
- Performance tests
- Documentation
Attachments
Attachments
Issue Links
- is required by
-
SPARK-3703 Ensemble learning methods
- Resolved