Red(uced)-RF, a new type of Random Forests that adopts dynamic data reduction and weighted upvoting techniques. Red-RF is favorably applicable to big data: it demonstrates an accurate and efficient performance while achieving a considerable data reduction w.r.t. dataset size.

Manuscripts available on IEEE Xplore:

H. Mohsen, H. Kurban, K. Zimmer, M. Jenne and M. Dalkilic. Red-RF: Reduced Random Forests using priority voting & dynamic data reduction. In IEEE BigData Congress'2015.

H. Mohsen, H. Kurban, M. Jenne and M. Dalkilic (2014). A New Set of Random Forests with Varying Dynamic Data Reduction and Voting Techniques. In IEEE DSAA'2014.

Code, README file, and a sample input file are available in Files/ directory above.

For inquiries, please contact us at hmohsen@imail,iu.edu (or @indiana.edu).

Features

  • Data Reduction
  • Classification
  • Random Forests
  • Weighted Voting
  • Machine Learning
  • Data Mining
  • Big Data

Project Samples

Project Activity

See All Activity >

Categories

Big Data

Follow Red-RF

Red-RF Web Site

Other Useful Business Software
PRTG Catches Network Issues Before They Cause Downtime Icon
PRTG Catches Network Issues Before They Cause Downtime

Threshold-based alerts flag problems early, so your team can act before users notice, not after.

Reactive troubleshooting usually means hearing about a problem from frustrated users, not your monitoring tool. PRTG sets threshold-based alerts across devices, servers and applications, notifying your team by email, SMS or push the moment a metric crosses a set limit. That means catching a failing disk or overloaded server before it becomes an outage and getting time back from firefighting. Start a free trial and set your first alerts today.
Download 30-Day Trial
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Red-RF!

Additional Project Details

Registered

2015-05-01