{"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/benchmarking-relief-based-feature-selection","title":"Benchmarking Relief-Based Feature Selection Methods for Bioinformatics Data Mining","arxiv_id":"1711.08477","date":"2017-11-22","proceeding":null,"authors":["Ryan J. Urbanowicz","Randal S. Olson","Peter Schmitt","Melissa Meeker","Jason H. Moore"],"abstract":"Modern biomedical data mining requires feature selection methods that can (1)\nbe applied to large scale feature spaces (e.g. `omics' data), (2) function in\nnoisy problems, (3) detect complex patterns of association (e.g. gene-gene\ninteractions), (4) be flexibly adapted to various problem domains and data\ntypes (e.g. genetic variants, gene expression, and clinical data) and (5) are\ncomputationally tractable. To that end, this work examines a set of\nfilter-style feature selection algorithms inspired by the `Relief' algorithm,\ni.e. Relief-Based algorithms (RBAs). We implement and expand these RBAs in an\nopen source framework called ReBATE (Relief-Based Algorithm Training\nEnvironment). We apply a comprehensive genetic simulation study comparing\nexisting RBAs, a proposed RBA called MultiSURF, and other established feature\nselection methods, over a variety of problems. The results of this study (1)\nsupport the assertion that RBAs are particularly flexible, efficient, and\npowerful feature selection methods that differentiate relevant features having\nunivariate, multivariate, epistatic, or heterogeneous associations, (2) confirm\nthe efficacy of expansions for classification vs. regression, discrete vs.\ncontinuous features, missing data, multiple classes, or class imbalance, (3)\nidentify previously unknown limitations of specific RBAs, and (4) suggest that\nwhile MultiSURF* performs best for explicitly identifying pure 2-way\ninteractions, MultiSURF yields the most reliable feature selection performance\nacross a wide range of problem types.","url_abs":"http://arxiv.org/abs/1711.08477v2","url_pdf":"http://arxiv.org/pdf/1711.08477v2.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":"benchmarking-relief-based-feature-selection","repo_url":"https://github.com/EpistasisLab/ReBATE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"benchmarking-relief-based-feature-selection","repo_url":"https://github.com/EpistasisLab/scikit-rebate","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"benchmarking","task_name":"Benchmarking"},{"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":"EpistasisLab/ReBATE","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"EpistasisLab/scikit-rebate","kind":"official","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":"3b3f5b030f712c5c8f81c10d89cc8438337ee7dddb717864e64cda462b48bb2f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}