0377918 20240103201011.320120828235959.9 Praha ÚTIA AVČR 2012 30 s. Research Report 2323 learning Bayesian network structure quality criterion integer linear programming 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-LP relaxations and pruning for characteristic imsets.pdf GA201/08/0539 GA ČR cav_un_auth*0239648 The geometric approach to learning BN structure is to represent it by a certain vector; a suitable such zero-one vector is the characteristic imset, which allows to reformulate the task of finding global maximum of a score over BN structures as an integer linear programming problem. The main contribution of this report is an LP relaxation of the corresponding polytope, that is, a polyhedral description of the domain of the respective integer linear programming problem. 2013 BA 1 4 O 4o 20231122135116.2 RVO:67985556 http://hdl.handle.net/11104/0209940 2012 Soubory v repozitáři: 0377918.pdf 2012 Praha ÚTIA AVČR