PARF- Parallel Random Forest Algorithm

By | September 22, 2011

The random forests algorithm is one of the best among the known classification algorithms, able to classify big quantities of data with great accuracy. Also, this algorithm is inherently parallelisable. Originally, the algorithm was written in the programming language Fortran 77, which is obsolete and does not provide many of the capabilities of modern programming languages; also, the original code is not an example of “clear” programming, so it is very hard to employ in education. The program is adapted to Fortran 90. PARF is adapted and ported to Grid infrastructure.

Name
PARF- Parallel Random Forest Algorithm
Documentation
Protocol
REST
WSDL
Endpoint
http://www.irb.hr/en/research/projects/it/2004/2004-111/
Topic
Biology
Type
Statistics
Tags
Description

The random forests algorithm is one of the best among the known classification algorithms, able to classify big quantities of [...]

Further information

The random forests algorithm is one of the best among the known classification algorithms, able to classify big quantities of data with great accuracy. Also, this algorithm is inherently parallelisable. Originally, the algorithm was written in the programming language Fortran 77, which is obsolete and does not provide many of the capabilities of modern programming languages; also, the original code is not an example of “clear” programming, so it is very hard to employ in education. The program is adapted to Fortran 90. PARF is adapted and ported to Grid infrastructure.

Original source
BioCatalogue

Leave Your Comment

Your email will not be published or shared. Required fields are marked *

*

*

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>