SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1508.04409 · 2015

ranger: A Fast Implementation of Random Forests for High Dimensional Data in C++ and R

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We introduce the C++ application and R package ranger. The software is a fast implementation of random forests for high dimensional data. Ensembles of classification, regression and survival trees are supported. We describe the implementation, provide examples, validate the package with a reference implementation, and compare runtime and memory usage with other implementations. The new software proves to scale best with the number of features, samples, trees, and features tried for splitting. Finally, we show that ranger is the fastest and most memory efficient implementation of random forests to analyze data on the scale of a genome-wide association study.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1508.04409")
get_code_for_paper("1508.04409")
have("1508.04409")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1508.04409.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1508.04409.svg)](https://syntology.ai/paper/1508.04409)

Connect an agent — have() is free.