2 research outputs found
ΠΠΎΠ΄Ρ ΠΎΠ΄Ρ ΠΊ ΡΡΡΡΠ°Π½Π΅Π½ΠΈΡ ΡΠΈΠΊΠ»ΠΈΡΠ½ΠΎΡΡΠΈ ΠΏΠ΅ΡΠ²ΠΈΡΠ½ΠΎΠΉ ΡΡΡΡΠΊΡΡΡΡ Π°Π»Π³Π΅Π±ΡΠ°ΠΈΡΠ΅ΡΠΊΠΎΠΉ Π±Π°ΠΉΠ΅ΡΠΎΠ²ΡΠΊΠΎΠΉ ΡΠ΅ΡΠΈ
One of the conditions for the effectiveness of the algorithms of logical and probabilistic inference in algebraic Bayesian network (ABN) is an acyclicity of its graphical representation. Introduction of hypergraphic representation of ABN structures allowed applying the methods of converting this graph to an acyclic form, basing on the methods of the theory of tree decomposition. The general scheme of the method of converting the network to acyclic one with the help of elimination sequences is considered. The main classes of heuristic elimination sequence search algorithms which are appropriate in the context of the transformation of the ABN, as well as evaluation of their complexity and quality of the results are presented.ΠΠ΄Π½ΠΈΠΌ ΠΈΠ· ΡΡΠ»ΠΎΠ²ΠΈΠΉ ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΠΈ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ² Π»ΠΎΠ³ΠΈΠΊΠΎ-Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΠ½ΠΎΠ³ΠΎ Π²ΡΠ²ΠΎΠ΄Π° Π² Π°Π»Π³Π΅Π±ΡΠ°ΠΈΡΠ΅ΡΠΊΠΎΠΉ Π±Π°ΠΉΠ΅ΡΠΎΠ²ΡΠΊΠΎΠΉ ΡΠ΅ΡΠΈ (ΠΠΠ‘) ΡΠ²Π»ΡΠ΅ΡΡΡ ΡΡΠ»ΠΎΠ²ΠΈΠ΅ Π°ΡΠΈΠΊΠ»ΠΈΡΠ½ΠΎΡΡΠΈ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»ΡΡΡΠ΅Π³ΠΎ Π΅Ρ Π³ΡΠ°ΡΠ°. ΠΠ²Π΅Π΄Π΅Π½ΠΈΠ΅ Π³ΠΈΠΏΠ΅ΡΠ³ΡΠ°ΡΠΎΠ²ΠΎΠ³ΠΎ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½ΠΈΡ ΡΡΡΡΠΊΡΡΡ ΠΠΠ‘ ΠΏΠΎΠ·Π²ΠΎΠ»ΠΈΠ»ΠΎ ΠΏΡΠΈΠΌΠ΅Π½ΡΡΡ ΠΌΠ΅ΡΠΎΠ΄Ρ ΠΏΡΠ΅ΠΎΠ±ΡΠ°Π·ΠΎΠ²Π°Π½ΠΈΡ Π΄Π°Π½Π½ΠΎΠ³ΠΎ Π³ΡΠ°ΡΠ° ΠΊ Π°ΡΠΈΠΊΠ»ΠΈΡΠ΅ΡΠΊΠΎΠΌΡ Π²ΠΈΠ΄Ρ, ΠΎΡΠ½ΠΎΠ²ΡΠ²Π°ΡΡΠΈΠ΅ΡΡ Π½Π° ΠΌΠ΅ΡΠΎΠ΄Π°Ρ
ΡΠ΅ΠΎΡΠΈΠΈ Π΄ΡΠ΅Π²ΠΎΠ²ΠΈΠ΄Π½ΠΎΠΉ Π΄Π΅ΠΊΠΎΠΌΠΏΠΎΠ·ΠΈΡΠΈΠΈ. Π Π°ΡΡΠΌΠΎΡΡΠ΅Π½Π° ΠΎΠ±ΡΠ°Ρ ΡΡ
Π΅ΠΌΠ° ΠΌΠ΅ΡΠΎΠ΄Π° ΠΏΡΠΈΠ²Π΅Π΄Π΅Π½ΠΈΡ ΡΠ΅ΡΠΈ ΠΊ Π°ΡΠΈΠΊΠ»ΠΈΡΠ΅ΡΠΊΠΎΠΌΡ Π²ΠΈΠ΄Ρ, ΠΈΡΠΏΠΎΠ»ΡΠ·ΡΡΡΠ΅Π³ΠΎ ΡΠ»ΠΈΠΌΠ΅Π½ΠΈΡΡΡΡΠΈΠ΅ ΠΏΠΎΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»ΡΠ½ΠΎΡΡΠΈ. ΠΡΠΈΠ²Π΅Π΄Π΅Π½Ρ ΠΎΡΠ½ΠΎΠ²Π½ΡΠ΅ ΠΊΠ»Π°ΡΡΡ ΡΠ²ΡΠΈΡΡΠΈΡΠ΅ΡΠΊΠΈΡ
Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ² ΠΏΠΎΠΈΡΠΊΠ° ΡΠ»ΠΈΠΌΠ΅Π½ΠΈΡΡΡΡΠΈΡ
ΠΏΠΎΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»ΡΠ½ΠΎΡΡΠ΅ΠΉ, ΠΏΡΠΈΠΌΠ΅Π½ΠΈΠΌΡΡ
Π² ΠΊΠΎΠ½ΡΠ΅ΠΊΡΡΠ΅ ΠΏΡΠ΅ΠΎΠ±ΡΠ°Π·ΠΎΠ²Π°Π½ΠΈΡ ΠΠΠ‘, Π° ΡΠ°ΠΊ ΠΆΠ΅ ΠΎΡΠ΅Π½ΠΊΠΈ ΠΈΡ
ΡΠ»ΠΎΠΆΠ½ΠΎΡΡΠΈ ΠΈ ΠΊΠ°ΡΠ΅ΡΡΠ²Π° ΠΏΠΎΠ»ΡΡΠ°Π΅ΠΌΡΡ
ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΠΎΠ²