{"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/scalable-exact-parent-sets-identification-in","title":"Scalable Exact Parent Sets Identification in Bayesian Networks Learning with Apache Spark","arxiv_id":"1705.06390","date":"2017-05-18","proceeding":null,"authors":["Subhadeep Karan","Jaroslaw Zola"],"abstract":"In Machine Learning, the parent set identification problem is to find a set\nof random variables that best explain selected variable given the data and some\npredefined scoring function. This problem is a critical component to structure\nlearning of Bayesian networks and Markov blankets discovery, and thus has many\npractical applications, ranging from fraud detection to clinical decision\nsupport. In this paper, we introduce a new distributed memory approach to the\nexact parent sets assignment problem. To achieve scalability, we derive\ntheoretical bounds to constraint the search space when MDL scoring function is\nused, and we reorganize the underlying dynamic programming such that the\ncomputational density is increased and fine-grain synchronization is\neliminated. We then design efficient realization of our approach in the Apache\nSpark platform. Through experimental results, we demonstrate that the method\nmaintains strong scalability on a 500-core standalone Spark cluster, and it can\nbe used to efficiently process data sets with 70 variables, far beyond the\nreach of the currently available solutions.","url_abs":"http://arxiv.org/abs/1705.06390v2","url_pdf":"http://arxiv.org/pdf/1705.06390v2.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":"scalable-exact-parent-sets-identification-in","repo_url":"https://gitlab.com/SCoRe-Group/SABNA-Release","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"fraud-detection","task_name":"Fraud Detection"}],"methods":[{"method_slug":"mdl","method_name":"MDL"}],"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/SCoRe-Group/SABNA-Release","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":"ad4214cebf593dae96fd0d13fa1bb5b3d086216d3fbefdd72cfd2bef49282cbd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}