|
MATHEMATICS
Algebraic bayesian networks: checking backbone connectivity.
A. G. Maksimova, A. L. Tulupyevba a St. Petersburg Federal Research Center of the Russian Academy of Sciences, 39, 14-ia liniia V.O., St. Petersburg, 199178, Russian Federation
b St. Petersburg State University, 7-9, Universitetskaya nab., St. Petersburg, 199034, Russian Federation
Abstract:
The paper investigates the construction of a joint graph as a global structure of network based on its primary structure, one of the problems arising in machine learning of bases of knowledge patterns with uncertainty, presented in the form of algebraic Bayesian networks. The aim of the research is to propose methods for solving the inverse problem. As the results, algorithms for checking a graph for belonging to a family of joint graphs and a family of minimal joint graphs are proposed, and estimates of their computational complexity are made. An improved version for the special case and an improvement for the general case on average are also proposed for the algorithm for checking membership in a family of joint graphs. The problem of recognition of joint graphs has not been previously researched; issue is being addressed for the first time as currently drafted. The theoretical significance lies in the possibilities for applying the results in further researches of graph-theoretic invariants in the global structures of algebraic Bayesian networks.
Keywords:
algebraic Bayesian networks, joint graph, minimal joint graph, algorithms, complexity of algorithms.
Received: 20.07.2020 Revised: 03.09.2020 Accepted: 17.12.2020
Citation:
A. G. Maksimov, A. L. Tulupyev, “Algebraic bayesian networks: checking backbone connectivity.”, Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy, 8:2 (2021), 305–316; Vestn. St. Petersbg. Univ., Math., 8:3 (2021), 187–195
Linking options:
https://www.mathnet.ru/eng/vspua117 https://www.mathnet.ru/eng/vspua/v8/i2/p305
|
Statistics & downloads: |
Abstract page: | 41 | Full-text PDF : | 6 |
|