Join graph edges in context of algebraic Bayesian network minimal join graph cliques comparative analysis
Keywords:
algebraic Bayesian networks, secondary structure, machine learning, probabilistic graphical knowledge modelsAbstract
Algebraic Bayesian networks (ABN) are probabilistic-logic graphic models of knowledge systems with uncertainty and gives an advantage to deal with interval probability estimates. Secondary structure usually represented as an join graph is essential for ABN work. The article analyses edges of various minimal join graph cliques to specify different clique types. In particular, it is proven that vertex set of the class of cliques that are basic for minimal join graph set synthesis equals to set of end of specified edges, weight of those equals to the clique weight.References
Published
2010-09-01
How to Cite
Filchenkov, A., Tulupyev, A., & Sirotkin, V. (2010). Join graph edges in context of algebraic Bayesian network minimal join graph cliques comparative analysis. SPIIRAS Proceedings, 3(14), 132-149. https://doi.org/10.15622/sp.14.8
Section
Articles
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
