0382596 20240103201431.420121107235959.9 000311461700004 84869095652 10.1016/j.ijar.2012.04.001 14 s. cav_un_epca*02567740888-613X539 (2012)1336-1349Elsevier learning Bayesian network structure essential graph standard imset characteristic imset LP relaxation of a polytope cav_un_auth*0285215 Hemmecke R. DE cav_un_auth*0285216 Lindner S. DE cav_un_auth*0101202 Studený Milan Matematická teorie rozhodování Department of Decision Making Theory MTR MTR UTIA-B Department of Decision Making Theory Ústav teorie informace a automatizace AV ČR, v. v. i. http://library.utia.cas.cz/separaty/2012/MTR/studeny-0382596.pdf 1M0572 GA MŠk CZ cav_un_auth*0001814 GA201/08/0539 GA ČR cav_un_auth*0239648 In this paper we introduce a new unique vector representative, called the characteristic imset, obtained from the standard imset by an affine transformation. Characteristic imsets are (shown to be) zero-one vectors and have many elegant properties, suitable for intended application of linear/integer programming methods to learning BN structure. They are much closer to the graphical description; we describe a simple transition between the characteristic imset and the essential graph, known as a traditional unique graphical representative of the BN structure. In the end, we relate our proposal to other recent approaches which apply linear programming methods in probabilistic reasoning. 2013 BA 3 4 A 4a 20231122135256.4 RVO:67985556 http://hdl.handle.net/11104/0212775 COMPUTERSCIENCEARTIFICIALINTELLIGENCE 2.165 0.447 5.5 0.00618 0.745 1920 85 1.494 Q1 65.146 70.000 Q2 Q1 2012 Soubory v repozitáři: studeny-0382596.pdf 84869095652 SCOPUS 000311461700004 WOS cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 53 č. 9 2012 1336 1349 Elsevier