{"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/grafting-for-combinatorial-boolean-model","title":"Grafting for Combinatorial Boolean Model using Frequent Itemset Mining","arxiv_id":"1711.02478","date":"2017-11-07","proceeding":null,"authors":["Taito Lee","Shin Matsushima","Kenji Yamanishi"],"abstract":"This paper introduces the combinatorial Boolean model (CBM), which is defined\nas the class of linear combinations of conjunctions of Boolean attributes. This\npaper addresses the issue of learning CBM from labeled data. CBM is of high\nknowledge interpretability but na\\\"{i}ve learning of it requires exponentially\nlarge computation time with respect to data dimension and sample size. To\novercome this computational difficulty, we propose an algorithm GRAB (GRAfting\nfor Boolean datasets), which efficiently learns CBM within the\n$L_1$-regularized loss minimization framework. The key idea of GRAB is to\nreduce the loss minimization problem to the weighted frequent itemset mining,\nin which frequent patterns are efficiently computable. We employ benchmark\ndatasets to empirically demonstrate that GRAB is effective in terms of\ncomputational efficiency, prediction accuracy and knowledge discovery.","url_abs":"http://arxiv.org/abs/1711.02478v2","url_pdf":"http://arxiv.org/pdf/1711.02478v2.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":"grafting-for-combinatorial-boolean-model","repo_url":"https://gitlab.com/taitor/GRAB-experiments","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"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":"gitlab.com/taitor/GRAB-experiments","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":"e07008a875d6ba64842cc0f1d9edec5fa01d864ce56ffb3295190281ccc40902","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}