HackerPapers

arXiv:1508.04409stat.ML

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

Marvin N. Wright, Andreas Ziegler

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
Journal reference
Wright, M. N. & Ziegler, A. (2017). ranger: A fast implementation of random forests for high dimensional data in C++ and R. Journal of Statistical Software 77:1-17
DOI
doi:10.18637/jss.v077.i01
Subjects
stat.MLMachine Learning (Statistics) stat.COComputation (Statistics)

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Apr 2020 to Apr 2020.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. R 4.0 1 comment
    • > How likely is it that R packages, written by specialists (or grad students) whose main focus is often not programming but some other discipline, in a language full of "quirks," are going to be really reliable? Do you have the data to back that up or is just a question that you…

      anthony_doanView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.