Random Forest classification implementation in Java based on Breiman's algorithm (2001). It assumes the data is in the form [ X_1, X_2, . . ., X_M, Y ] where Y \in {0, 1, . . ., C}. The user must define M, C, and m initially.

Project Activity

See All Activity >

License

Academic Free License (AFL)

Follow Random Forests (Breiman) in Java

Random Forests (Breiman) in Java Web Site

Other Useful Business Software
Outgrown Windows Task Scheduler? Icon
Outgrown Windows Task Scheduler?

Free diagnostic identifies where your workflow is breaking down—with instant analysis of your scheduling environment.

Windows Task Scheduler wasn't built for complex, cross-platform automation. Get a free diagnostic that shows exactly where things are failing and provides remediation recommendations. Interactive HTML report delivered in minutes.
Download Free Tool
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Random Forests (Breiman) in Java!

Additional Project Details

Intended Audience

Developers

Programming Language

Java

Related Categories

Java Artificial Intelligence Software

Registered

2007-01-02