{"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/cfm-bd-a-distributed-rule-induction-algorithm","title":"CFM-BD: a distributed rule induction algorithm for building Compact Fuzzy Models in Big Data classification problems","arxiv_id":"1902.09357","date":"2019-02-25","proceeding":null,"authors":["Mikel Elkano","Jose Sanz","Edurne Barrenechea","Humberto Bustince","Mikel Galar"],"abstract":"Interpretability has always been a major concern for fuzzy rule-based\nclassifiers. The usage of human-readable models allows them to explain the\nreasoning behind their predictions and decisions. However, when it comes to Big\nData classification problems, fuzzy rule-based classifiers have not been able\nto maintain the good trade-off between accuracy and interpretability that has\ncharacterized these techniques in non-Big Data environments. The most accurate\nmethods build too complex models composed of a large number of rules and fuzzy\nsets, while those approaches focusing on interpretability do not provide\nstate-of-the-art discrimination capabilities. In this paper, we propose a new\ndistributed learning algorithm named CFM-BD to construct accurate and compact\nfuzzy rule-based classification systems for Big Data. This method has been\nspecifically designed from scratch for Big Data problems and does not adapt or\nextend any existing algorithm. The proposed learning process consists of three\nstages: 1) pre-processing based on the probability integral transform theorem;\n2) rule induction inspired by CHI-BD and Apriori algorithms; 3) rule selection\nby means of a global evolutionary optimization. We conducted a complete\nempirical study to test the performance of our approach in terms of accuracy,\ncomplexity, and runtime. The results obtained were compared and contrasted with\nfour state-of-the-art fuzzy classifiers for Big Data (FBDT, FMDT, Chi-Spark-RS,\nand CHI-BD). According to this study, CFM-BD is able to provide competitive\ndiscrimination capabilities using significantly simpler models composed of a\nfew rules of less than 3 antecedents, employing 5 linguistic labels for all\nvariables.","url_abs":"http://arxiv.org/abs/1902.09357v1","url_pdf":"http://arxiv.org/pdf/1902.09357v1.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":"cfm-bd-a-distributed-rule-induction-algorithm","repo_url":"https://github.com/melkano/cfm-bd","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"classification","task_name":"General Classification"}],"methods":[{"method_slug":"interpretability","method_name":"Interpretability"}],"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":"melkano/cfm-bd","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":"3692519b4a43d0e90c650da7fa2f735d54ef070212e5ef630b6e30d537dc765a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}