On polyhedral approximations of polytopes for learning Bayesian networks

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F13%3A00393223" target="_blank" >RIV/67985556:_____/13:00393223 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

On polyhedral approximations of polytopes for learning Bayesian networks

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F08%2F0539" target="_blank" >GA201/08/0539: Conditional independence structures: graphical and algebraic approaches</a><br>

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2013

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Journal of Algebraic Statistics

ISSN

1309-3452

e-ISSN

—

Volume of the periodical

4

Issue of the periodical within the volume

1

Country of publishing house

US - UNITED STATES

Number of pages

33

Pages from-to

59-92

UT code for WoS article

—

EID of the result in the Scopus database

—