Loading…

Optimized realization of Bayesian networks in reduced normal form using latent variable model

Bayesian networks in their Factor Graph Reduced Normal Form are a powerful paradigm for implementing inference graphs. Unfortunately, the computational and memory costs of these networks may be considerable even for relatively small networks, and this is one of the main reasons why these structures...

Full description

Saved in:
Bibliographic Details
Published in:Soft computing (Berlin, Germany) Germany), 2021-05, Vol.25 (10), p.7029-7040
Main Authors: Gennaro, Giovanni Di, Buonanno, Amedeo, Palmieri, Francesco A. N.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c363t-a9c6c46b2e59bbff8140745f17912e886e6fd10b5f63ab9dc2ef9a90b69f9f4e3
cites cdi_FETCH-LOGICAL-c363t-a9c6c46b2e59bbff8140745f17912e886e6fd10b5f63ab9dc2ef9a90b69f9f4e3
container_end_page 7040
container_issue 10
container_start_page 7029
container_title Soft computing (Berlin, Germany)
container_volume 25
creator Gennaro, Giovanni Di
Buonanno, Amedeo
Palmieri, Francesco A. N.
description Bayesian networks in their Factor Graph Reduced Normal Form are a powerful paradigm for implementing inference graphs. Unfortunately, the computational and memory costs of these networks may be considerable even for relatively small networks, and this is one of the main reasons why these structures have often been underused in practice. In this work, through a detailed algorithmic and structural analysis, various solutions for cost reduction are proposed. Moreover, an online version of the classic batch learning algorithm is also analysed, showing very similar results in an unsupervised context but with much better performance; which may be essential if multi-level structures are to be built. The solutions proposed, together with the possible online learning algorithm, are included in a C++ library that is quite efficient, especially if compared to the direct use of the well-known sum-product and Maximum Likelihood algorithms. The results obtained are discussed with particular reference to a Latent Variable Model structure.
doi_str_mv 10.1007/s00500-021-05642-3
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2917911716</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2917911716</sourcerecordid><originalsourceid>FETCH-LOGICAL-c363t-a9c6c46b2e59bbff8140745f17912e886e6fd10b5f63ab9dc2ef9a90b69f9f4e3</originalsourceid><addsrcrecordid>eNp9kM1KAzEYRYMoWKsv4CrgOpq_SZqlFv-g0I0uJWRmkpI6TWoyo7RPb-wI7lzdb3Hu_eAAcEnwNcFY3mSMK4wRpgThSnCK2BGYEM4Yklyq48NNkRScnYKznNe4kLJiE_C23PZ-4_e2hcmazu9N72OA0cE7s7PZmwCD7b9ies_Qh8K0Q1PYENPGdNCVgEP2YQU709vQw0-TvKk7Czextd05OHGmy_biN6fg9eH-Zf6EFsvH5_ntAjVMsB4Z1YiGi5raStW1czPCseSVI1IRamczYYVrCa4rJ5ipVdtQ65RRuBbKKcctm4KrcXeb4sdgc6_XcUihvNRU_awQSUSh6Eg1KeacrNPb5Dcm7TTB-kejHjXqIkcfNGpWSmws5QKHlU1_0_-0vgEI53bK</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2917911716</pqid></control><display><type>article</type><title>Optimized realization of Bayesian networks in reduced normal form using latent variable model</title><source>Springer Nature</source><creator>Gennaro, Giovanni Di ; Buonanno, Amedeo ; Palmieri, Francesco A. N.</creator><creatorcontrib>Gennaro, Giovanni Di ; Buonanno, Amedeo ; Palmieri, Francesco A. N.</creatorcontrib><description>Bayesian networks in their Factor Graph Reduced Normal Form are a powerful paradigm for implementing inference graphs. Unfortunately, the computational and memory costs of these networks may be considerable even for relatively small networks, and this is one of the main reasons why these structures have often been underused in practice. In this work, through a detailed algorithmic and structural analysis, various solutions for cost reduction are proposed. Moreover, an online version of the classic batch learning algorithm is also analysed, showing very similar results in an unsupervised context but with much better performance; which may be essential if multi-level structures are to be built. The solutions proposed, together with the possible online learning algorithm, are included in a C++ library that is quite efficient, especially if compared to the direct use of the well-known sum-product and Maximum Likelihood algorithms. The results obtained are discussed with particular reference to a Latent Variable Model structure.</description><identifier>ISSN: 1432-7643</identifier><identifier>EISSN: 1433-7479</identifier><identifier>DOI: 10.1007/s00500-021-05642-3</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithms ; Artificial Intelligence ; Bayesian analysis ; Canonical forms ; Computational Intelligence ; Control ; Cost analysis ; Engineering ; Graphs ; Libraries ; Machine learning ; Mathematical Logic and Foundations ; Mechatronics ; Methodologies and Application ; Networks ; Probability ; Robotics ; Structural analysis ; Variables</subject><ispartof>Soft computing (Berlin, Germany), 2021-05, Vol.25 (10), p.7029-7040</ispartof><rights>The Author(s) 2021</rights><rights>The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c363t-a9c6c46b2e59bbff8140745f17912e886e6fd10b5f63ab9dc2ef9a90b69f9f4e3</citedby><cites>FETCH-LOGICAL-c363t-a9c6c46b2e59bbff8140745f17912e886e6fd10b5f63ab9dc2ef9a90b69f9f4e3</cites><orcidid>0000-0001-9757-1712</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Gennaro, Giovanni Di</creatorcontrib><creatorcontrib>Buonanno, Amedeo</creatorcontrib><creatorcontrib>Palmieri, Francesco A. N.</creatorcontrib><title>Optimized realization of Bayesian networks in reduced normal form using latent variable model</title><title>Soft computing (Berlin, Germany)</title><addtitle>Soft Comput</addtitle><description>Bayesian networks in their Factor Graph Reduced Normal Form are a powerful paradigm for implementing inference graphs. Unfortunately, the computational and memory costs of these networks may be considerable even for relatively small networks, and this is one of the main reasons why these structures have often been underused in practice. In this work, through a detailed algorithmic and structural analysis, various solutions for cost reduction are proposed. Moreover, an online version of the classic batch learning algorithm is also analysed, showing very similar results in an unsupervised context but with much better performance; which may be essential if multi-level structures are to be built. The solutions proposed, together with the possible online learning algorithm, are included in a C++ library that is quite efficient, especially if compared to the direct use of the well-known sum-product and Maximum Likelihood algorithms. The results obtained are discussed with particular reference to a Latent Variable Model structure.</description><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Bayesian analysis</subject><subject>Canonical forms</subject><subject>Computational Intelligence</subject><subject>Control</subject><subject>Cost analysis</subject><subject>Engineering</subject><subject>Graphs</subject><subject>Libraries</subject><subject>Machine learning</subject><subject>Mathematical Logic and Foundations</subject><subject>Mechatronics</subject><subject>Methodologies and Application</subject><subject>Networks</subject><subject>Probability</subject><subject>Robotics</subject><subject>Structural analysis</subject><subject>Variables</subject><issn>1432-7643</issn><issn>1433-7479</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp9kM1KAzEYRYMoWKsv4CrgOpq_SZqlFv-g0I0uJWRmkpI6TWoyo7RPb-wI7lzdb3Hu_eAAcEnwNcFY3mSMK4wRpgThSnCK2BGYEM4Yklyq48NNkRScnYKznNe4kLJiE_C23PZ-4_e2hcmazu9N72OA0cE7s7PZmwCD7b9ies_Qh8K0Q1PYENPGdNCVgEP2YQU709vQw0-TvKk7Czextd05OHGmy_biN6fg9eH-Zf6EFsvH5_ntAjVMsB4Z1YiGi5raStW1czPCseSVI1IRamczYYVrCa4rJ5ipVdtQ65RRuBbKKcctm4KrcXeb4sdgc6_XcUihvNRU_awQSUSh6Eg1KeacrNPb5Dcm7TTB-kejHjXqIkcfNGpWSmws5QKHlU1_0_-0vgEI53bK</recordid><startdate>20210501</startdate><enddate>20210501</enddate><creator>Gennaro, Giovanni Di</creator><creator>Buonanno, Amedeo</creator><creator>Palmieri, Francesco A. N.</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><orcidid>https://orcid.org/0000-0001-9757-1712</orcidid></search><sort><creationdate>20210501</creationdate><title>Optimized realization of Bayesian networks in reduced normal form using latent variable model</title><author>Gennaro, Giovanni Di ; Buonanno, Amedeo ; Palmieri, Francesco A. N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c363t-a9c6c46b2e59bbff8140745f17912e886e6fd10b5f63ab9dc2ef9a90b69f9f4e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Bayesian analysis</topic><topic>Canonical forms</topic><topic>Computational Intelligence</topic><topic>Control</topic><topic>Cost analysis</topic><topic>Engineering</topic><topic>Graphs</topic><topic>Libraries</topic><topic>Machine learning</topic><topic>Mathematical Logic and Foundations</topic><topic>Mechatronics</topic><topic>Methodologies and Application</topic><topic>Networks</topic><topic>Probability</topic><topic>Robotics</topic><topic>Structural analysis</topic><topic>Variables</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gennaro, Giovanni Di</creatorcontrib><creatorcontrib>Buonanno, Amedeo</creatorcontrib><creatorcontrib>Palmieri, Francesco A. N.</creatorcontrib><collection>Springer_OA刊</collection><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><jtitle>Soft computing (Berlin, Germany)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gennaro, Giovanni Di</au><au>Buonanno, Amedeo</au><au>Palmieri, Francesco A. N.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimized realization of Bayesian networks in reduced normal form using latent variable model</atitle><jtitle>Soft computing (Berlin, Germany)</jtitle><stitle>Soft Comput</stitle><date>2021-05-01</date><risdate>2021</risdate><volume>25</volume><issue>10</issue><spage>7029</spage><epage>7040</epage><pages>7029-7040</pages><issn>1432-7643</issn><eissn>1433-7479</eissn><abstract>Bayesian networks in their Factor Graph Reduced Normal Form are a powerful paradigm for implementing inference graphs. Unfortunately, the computational and memory costs of these networks may be considerable even for relatively small networks, and this is one of the main reasons why these structures have often been underused in practice. In this work, through a detailed algorithmic and structural analysis, various solutions for cost reduction are proposed. Moreover, an online version of the classic batch learning algorithm is also analysed, showing very similar results in an unsupervised context but with much better performance; which may be essential if multi-level structures are to be built. The solutions proposed, together with the possible online learning algorithm, are included in a C++ library that is quite efficient, especially if compared to the direct use of the well-known sum-product and Maximum Likelihood algorithms. The results obtained are discussed with particular reference to a Latent Variable Model structure.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s00500-021-05642-3</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0001-9757-1712</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1432-7643
ispartof Soft computing (Berlin, Germany), 2021-05, Vol.25 (10), p.7029-7040
issn 1432-7643
1433-7479
language eng
recordid cdi_proquest_journals_2917911716
source Springer Nature
subjects Algorithms
Artificial Intelligence
Bayesian analysis
Canonical forms
Computational Intelligence
Control
Cost analysis
Engineering
Graphs
Libraries
Machine learning
Mathematical Logic and Foundations
Mechatronics
Methodologies and Application
Networks
Probability
Robotics
Structural analysis
Variables
title Optimized realization of Bayesian networks in reduced normal form using latent variable model
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T05%3A31%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimized%20realization%20of%20Bayesian%20networks%20in%20reduced%20normal%20form%20using%20latent%20variable%20model&rft.jtitle=Soft%20computing%20(Berlin,%20Germany)&rft.au=Gennaro,%20Giovanni%20Di&rft.date=2021-05-01&rft.volume=25&rft.issue=10&rft.spage=7029&rft.epage=7040&rft.pages=7029-7040&rft.issn=1432-7643&rft.eissn=1433-7479&rft_id=info:doi/10.1007/s00500-021-05642-3&rft_dat=%3Cproquest_cross%3E2917911716%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c363t-a9c6c46b2e59bbff8140745f17912e886e6fd10b5f63ab9dc2ef9a90b69f9f4e3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2917911716&rft_id=info:pmid/&rfr_iscdi=true