| bibtype |
C -
Conference Paper (international conference)
|
| ARLID |
0462009 |
| utime |
20240103212527.0 |
| mtime |
20160829235959.9 |
| SCOPUS |
85021109619 |
| DOI |
10.1016/j.ijar.2017.06.001 |
| title
(primary) (eng) |
The chordal graph polytope for learning decomposable models |
| specification |
| page_count |
12 s. |
| media_type |
E |
|
| serial |
| ARLID |
cav_un_epca*0462433 |
| ISSN |
Proceedings of the Eighth International Conference on Probabilistic Graphical Models |
| title
|
Proceedings of the Eighth International Conference on Probabilistic Graphical Models |
| page_num |
499-510 |
| publisher |
| place |
Brookline |
| name |
Microtome Publishing |
| year |
2016 |
|
| editor |
|
| editor |
|
| editor |
| name1 |
Polpo de Campos |
| name2 |
C. |
|
|
| keyword |
learning decomposable models |
| keyword |
integer linear programming |
| keyword |
characteristic imset |
| keyword |
chordal graph polytope |
| keyword |
clutter inequalities |
| keyword |
separation problem |
| author
(primary) |
| ARLID |
cav_un_auth*0101202 |
| full_dept (cz) |
Matematická teorie rozhodování |
| full_dept (eng) |
Department of Decision Making Theory |
| department (cz) |
MTR |
| department (eng) |
MTR |
| full_dept |
Department of Decision Making Theory |
| name1 |
Studený |
| name2 |
Milan |
| institution |
UTIA-B |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| author
|
| ARLID |
cav_un_auth*0332730 |
| name1 |
Cussens |
| name2 |
J. |
| country |
GB |
|
| source |
|
| cas_special |
| project |
| ARLID |
cav_un_auth*0332303 |
| project_id |
GA16-12010S |
| agency |
GA ČR |
| country |
CZ |
|
| abstract
(eng) |
This theoretical paper is inspired by an integer linear programming (ILP) approach to learning the structure of decomposable models. We intend to represent decomposable models by special zero-one vectors, named characteristic imsets. Our approach leads to the study of a special polytope, defined as the convex hull of all characteristic imsets for chordal graphs, named the chordal graph polytope. We introduce a class of clutter inequalities and show that all of them are valid for (the vectors in) the polytope. In fact, these inequalities are even facet-defining for the polytope and we dare to conjecture that they lead to a complete polyhedral description of the polytope. Finally, we propose an LP method to solve the separation problem with these inequalities for use in a cutting plane approach. |
| action |
| ARLID |
cav_un_auth*0332731 |
| name |
the Eighth International Conference on Probabilistic Graphical Models |
| dates |
06.09.2016-09.09.2016 |
| place |
Lugano |
| country |
CH |
|
| RIV |
BA |
| reportyear |
2017 |
| num_of_auth |
2 |
| presentation_type |
PR |
| inst_support |
RVO:67985556 |
| permalink |
http://hdl.handle.net/11104/0261903 |
| confidential |
S |
| arlyear |
2016 |
| mrcbU14 |
85021109619 SCOPUS |
| mrcbU63 |
cav_un_epca*0462433 Proceedings of the Eighth International Conference on Probabilistic Graphical Models Microtome Publishing 2016 Brookline 499 510 JMLR: Workshop and Conference Proceedings vol. 52 1938-7228 |
| mrcbU67 |
340 Antonucci A. |
| mrcbU67 |
340 Corani G. |
| mrcbU67 |
340 Polpo de Campos C. |
|