Minimal join graph set synthesis possession cliques algorithm

The effective minimal join graph set synthesis algorithm (of self-managing cliques) from a given maximal knowledge pattern set is known, but it can be improved by engaging the developed theory of algebraic Bayesian network global structure. The goal of the work is to improve the known minimal join graph set algorithm by perfecting designing possessions (connection components of strong narrowings) – the key objects for the set synthesis: to design themnot with the straight search but with the corresponding cliques children’s intersections analysis. A newalgorithmimplementing suggested improvements is designed.