{"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/approximate-false-positive-rate-control-in","title":"Approximate False Positive Rate Control in Selection Frequency for Random Forest","arxiv_id":"1410.2838","date":"2014-10-10","proceeding":null,"authors":["Ender Konukoglu","Melanie Ganz"],"abstract":"Random Forest has become one of the most popular tools for feature selection.\nIts ability to deal with high-dimensional data makes this algorithm especially\nuseful for studies in neuroimaging and bioinformatics. Despite its popularity\nand wide use, feature selection in Random Forest still lacks a crucial\ningredient: false positive rate control. To date there is no efficient,\nprincipled and computationally light-weight solution to this shortcoming. As a\nresult, researchers using Random Forest for feature selection have to resort to\nusing heuristically set thresholds on feature rankings. This article builds an\napproximate probabilistic model for the feature selection process in random\nforest training, which allows us to compute an estimated false positive rate\nfor a given threshold on selection frequency. Hence, it presents a principled\nway to determine thresholds for the selection of relevant features without any\nadditional computational load. Experimental analysis with synthetic data\ndemonstrates that the proposed approach can limit false positive rates on the\norder of the desired values and keep false negative rates low. Results show\nthat this holds even in the presence of a complex correlation structure between\nfeatures. Its good statistical properties and light-weight computational needs\nmake this approach widely applicable to feature selection for a wide-range of\napplications.","url_abs":"http://arxiv.org/abs/1410.2838v1","url_pdf":"http://arxiv.org/pdf/1410.2838v1.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":"approximate-false-positive-rate-control-in","repo_url":"https://github.com/aberHRML/forestControl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"feature-selection","task_name":"feature selection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"aberHRML/forestControl","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":"0c3a4226cc1b9917a64ae0f5dea7ccbb1fa7ce14f04588dbe56104dcbb12613c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}