Cycles in Bayesian Networks

Authors

  • Natalya Litvinenko Institute of Information and Computational Technologies CS MES RK, Almaty
  • Orken Mamyrbayev Institute of Information and Computational Technologies CS MES RK, Almaty and Al-Farabi Kazakh National University, Almaty, Kazakhstan
  • Waldemar Wójcik Lublin University of Technology
  • Dusmat Zhamangarin Kazakh University Ways of Communications

Abstract

The article is devoted to some critical problems of using Bayesian networks for solving practical problems, in which graph models contain directed cycles. The strict requirement of the acyclicity of the directed graph representing the Bayesian network does not allow to efficiently solve most of the problems that contain directed cycles. The modern theory of Bayesian networks prohibits the use of directed cycles. The requirement of acyclicity of the graph can significantly simplify the general theory of Bayesian networks, significantly simplify the development of algorithms and their implementation in program code for calculations in Bayesian networks.

Downloads

Published

2024-04-19

Issue

Section

Applied Informatics