Learning Bayesian network structure: towards the essential graph by integer linear programming tools
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F14%3A00427002" target="_blank" >RIV/67985556:_____/14:00427002 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ijar.2013.09.016" target="_blank" >http://dx.doi.org/10.1016/j.ijar.2013.09.016</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ijar.2013.09.016" target="_blank" >10.1016/j.ijar.2013.09.016</a>
Alternative languages
Result language
angličtina
Original language name
Learning Bayesian network structure: towards the essential graph by integer linear programming tools
Original language description
The basic idea of the geometric approach to learning a Bayesian network (BN) structure is to represent every BN structure by a certain vector. If the vector representative is chosen properly, it allows one to re-formulate the task of finding the global maximum of a score over BN structures as an integer linear programming (ILP) problem. Such a suitable zero-one vector representative is the characteristic imset, introduced by Studený, Hemmecke and Lindner in 2010, in the proceedings of the 5th PGM workshop. In this paper, extensions of characteristic imsets are considered which additionally encode chain graphs without flags equivalent to acyclic directed graphs. The main contribution is a polyhedral description of the respective domain of the ILP problem, that is, by means of a set of linear inequalities.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA13-20012S" target="_blank" >GA13-20012S: Conditional independence structures: algebraic and geometric methods</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
International Journal of Approximate Reasoning
ISSN
0888-613X
e-ISSN
—
Volume of the periodical
55
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
29
Pages from-to
1043-1071
UT code for WoS article
000334087400009
EID of the result in the Scopus database
—