{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/ranger-a-fast-implementation-of-random","title":"ranger: A Fast Implementation of Random Forests for High Dimensional Data in C++ and R","arxiv_id":"1508.04409","date":"2015-08-18","proceeding":null,"authors":["Marvin N. Wright","Andreas Ziegler"],"abstract":"We introduce the C++ application and R package ranger. The software is a fast\nimplementation of random forests for high dimensional data. Ensembles of\nclassification, regression and survival trees are supported. We describe the\nimplementation, provide examples, validate the package with a reference\nimplementation, and compare runtime and memory usage with other\nimplementations. The new software proves to scale best with the number of\nfeatures, samples, trees, and features tried for splitting. Finally, we show\nthat ranger is the fastest and most memory efficient implementation of random\nforests to analyze data on the scale of a genome-wide association study.","url_abs":"http://arxiv.org/abs/1508.04409v2","url_pdf":"http://arxiv.org/pdf/1508.04409v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"ranger-a-fast-implementation-of-random","repo_url":"https://github.com/cran/missRanger","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"ranger-a-fast-implementation-of-random","repo_url":"https://github.com/mayer79/missRanger","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-2.0"}}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1508.04409","atlas_url":"https://app.syntology.ai/?focus=1508.04409","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1508.04409"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1508.04409\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1508.04409"},"call":"get_concepts_for_paper(arxiv_id=\"1508.04409\")"}],"by_repo":[{"repo":"cran/missRanger","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mayer79/missRanger","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f7e4a8c84a48197b779237a6b431ac94890c9d832e9ee2849e55cfac44b4ec75","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}