DOI

This article describes an experiment demonstrating the running time of the algorithm for maintainance of external consistency in algebraic Bayesian networks. In the experiment, the stellate and chain structures of algebraic Bayesian networks are compared. The results of the experiment demonstrate the dependency of the algorithm complexity on the number of atoms in the network, as well as on the intersections and in the fragments of knowledge.

Original languageEnglish
Title of host publicationProceedings of the 3rd International Scientific Conference “Intelligent Information Technologies for Industry” (IITI’18) - Volume 2
EditorsValery Tarassov, Sergey Kovalev, Andrey Sukhanov, Ajith Abraham, Vaclav Snasel
PublisherSpringer Nature
Pages23-30
Number of pages8
ISBN (Print)9783030018207
DOIs
StatePublished - 1 Jan 2019
Event3rd International Scientific Conference on Intelligent Information Technologies for Industry, IITI 2018 - Sochi, Russian Federation
Duration: 17 Sep 2018 → 21 Sep 2018

Publication series

NameAdvances in Intelligent Systems and Computing
PublisherSPRINGER INTERNATIONAL PUBLISHING AG
Volume875
ISSN (Print)2194-5357

Conference

Conference3rd International Scientific Conference on Intelligent Information Technologies for Industry, IITI 2018
Country/TerritoryRussian Federation
CitySochi
Period17/09/18 → 21/09/18

    Research areas

  • Algebraic bayesian networks, Global probabilistic-logic inference, Knowledge patterns, Maintenance of external consistency, Probabilistic graphical models, Statistical experiments

    Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)

ID: 36791554