{"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/optimized-realization-of-bayesian-networks-in","title":"Optimized Realization of Bayesian Networks in Reduced Normal Form using Latent Variable Model","arxiv_id":"1901.06201","date":"2019-01-18","proceeding":null,"authors":["Giovanni Di Gennaro","Amedeo Buonanno","Francesco A. N. Palmieri"],"abstract":"Bayesian networks in their Factor Graph Reduced Normal Form (FGrn) are a\npowerful paradigm for implementing inference graphs. Unfortunately, the\ncomputational and memory costs of these networks may be considerable, even for\nrelatively small networks, and this is one of the main reasons why these\nstructures have often been underused in practice. In this work, through a\ndetailed algorithmic and structural analysis, various solutions for cost\nreduction are proposed. An online version of the classic batch learning\nalgorithm is also analyzed, showing very similar results (in an unsupervised\ncontext); which is essential even if multilevel structures are to be built. The\nsolutions proposed, together with the possible online learning algorithm, are\nincluded in a C++ library that is quite efficient, especially if compared to\nthe direct use of the well-known sum-product and Maximum Likelihood (ML)\nalgorithms. The results are discussed with particular reference to a Latent\nVariable Model (LVM) structure.","url_abs":"http://arxiv.org/abs/1901.06201v1","url_pdf":"http://arxiv.org/pdf/1901.06201v1.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":"optimized-realization-of-bayesian-networks-in","repo_url":"https://github.com/mlunicampania/FGrnLib","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"form","task_name":"Form"}],"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":"mlunicampania/FGrnLib","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":"5991dbcd01b1c0fcc1e92d416665c33bed893f3407e56fafe2142c1d4d3eb268","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}