{"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/belief-a-distance-based-redundancy-proof","title":"BELIEF: A distance-based redundancy-proof feature selection method for Big Data","arxiv_id":"1804.05774","date":"2018-04-16","proceeding":null,"authors":["Sergio Ramírez-Gallego","Salvador García","Ning Xiong","Francisco Herrera"],"abstract":"With the advent of Big Data era, data reduction methods are highly demanded\ngiven its ability to simplify huge data, and ease complex learning processes.\nConcretely, algorithms that are able to filter relevant dimensions from a set\nof millions are of huge importance. Although effective, these techniques suffer\nfrom the \"scalability\" curse as well.\n  In this work, we propose a distributed feature weighting algorithm, which is\nable to rank millions of features in parallel using large samples. This method,\ninspired by the well-known RELIEF algorithm, introduces a novel redundancy\nelimination measure that provides similar schemes to those based on entropy at\na much lower cost. It also allows smooth scale up when more instances are\ndemanded in feature estimations. Empirical tests performed on our method show\nits estimation ability in manifold huge sets --both in number of features and\ninstances--, as well as its simplified runtime cost (specially, at the\nredundancy detection step).","url_abs":"http://arxiv.org/abs/1804.05774v1","url_pdf":"http://arxiv.org/pdf/1804.05774v1.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":"belief-a-distance-based-redundancy-proof","repo_url":"https://github.com/sramirez/spark-RELIEFFC-fselection","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"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":"sramirez/spark-RELIEFFC-fselection","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":"2fe81ec4b70e6424dec58907485c759256c24ba6c056cb5a33ad425cbea8d89f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}