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.
Categories
Artificial IntelligenceLicense
Academic Free License (AFL)Follow Random Forests (Breiman) in Java
Other Useful Business Software
Compliant and Reliable File Transfers Backed by Top Security Certifications
Stop relying on non-certified, legacy file transfer tools that creak under the weight of modern security demands. Get full audit trails, advanced access controls and more supported by an award-winning team of experts. Start your free 25-day trial today.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Random Forests (Breiman) in Java!