bibtype J - Journal Article
ARLID 0393223
utime 20240103202644.9
mtime 20130625235959.9
title (primary) (eng) On polyhedral approximations of polytopes for learning Bayesian networks
specification
page_count 33 s.
media_type P
serial
ARLID cav_un_epca*0393222
ISSN 1309-3452
title Journal of Algebraic Statistics
volume_id 4
volume 1 (2013)
page_num 59-92
keyword Bayesian network structure
keyword integer programming
keyword standard imset
keyword characteristic imset
keyword LP relaxation
author (primary)
ARLID cav_un_auth*0101202
name1 Studený
name2 Milan
full_dept (cz) Matematická teorie rozhodování
full_dept (eng) Department of Decision Making Theory
department (cz) MTR
department (eng) MTR
institution UTIA-B
full_dept Department of Decision Making Theory
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0291945
name1 Haws
name2 D.C.
country US
source
url http://library.utia.cas.cz/separaty/2013/MTR/studeny-on polyhedral approximations of polytopes for learning bayesian networks.pdf
cas_special
project
project_id GA201/08/0539
agency GA ČR
ARLID cav_un_auth*0239648
abstract (eng) We review three vector encodings of BN structures. The first one has been used by Jaakkola et al. (2010) and also by Cussens (2011), the other two use special integral vectors formerly introduced, called imsets (Studený, 2005). The topic is the comparison of outer polyhedral approximations of the corresponding polytopes. We show how to transform the inequalities suggested by Jaakkola et al. into the framework of imsets. As a consequence of our results, we confirm a conjecture from (Studený, Vomlel 2011) that the implicit polyhedral approximation of the standard imset polytope considered there is an LP relaxation of that polytope.
reportyear 2014
RIV BA
num_of_auth 2
inst_support RVO:67985556
permalink http://hdl.handle.net/11104/0221988
arlyear 2013
mrcbU63 cav_un_epca*0393222 Journal of Algebraic Statistics 1309-3452 Roč. 4 č. 1 2013 59 92