| bibtype |
J -
Journal Article
|
| ARLID |
0475614 |
| utime |
20240103214203.3 |
| mtime |
20170623235959.9 |
| SCOPUS |
85021109619 |
| WOS |
000407655600014 |
| DOI |
10.1016/j.ijar.2017.06.001 |
| title
(primary) (eng) |
Towards using the chordal graph polytope in learning decomposable models |
| specification |
| page_count |
23 s. |
| media_type |
P |
|
| serial |
| ARLID |
cav_un_epca*0256774 |
| ISSN |
0888-613X |
| title
|
International Journal of Approximate Reasoning |
| volume_id |
88 |
| volume |
1 (2017) |
| page_num |
259-281 |
| publisher |
|
|
| 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) |
The motivation for this paper is the integer linear programming (ILP) approach to learning the structure of a decomposable graphical model. We have chosen to represent decomposable models by means of 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. In this theoretical paper, we introduce a class of clutter inequalities (valid for the vectors in the polytope) and show that all of them are facet-defining for the polytope. We dare to conjecture that they lead to a complete polyhedral description of the polytope. Finally, we propose a linear programming method to solve the separation problem with these inequalities for the use in a cutting plane approach. |
| action |
| ARLID |
cav_un_auth*0347198 |
| name |
8th International Conference of Probabilistic Graphical Models |
| dates |
20160906 |
| mrcbC20-s |
20160909 |
| place |
Lugano |
| country |
CH |
|
| RIV |
BA |
| FORD0 |
10000 |
| FORD1 |
10100 |
| FORD2 |
10103 |
| reportyear |
2018 |
| num_of_auth |
2 |
| inst_support |
RVO:67985556 |
| permalink |
http://hdl.handle.net/11104/0272346 |
| confidential |
S |
| mrcbC86 |
3+4 Article Computer Science Artificial Intelligence |
| mrcbC86 |
3+4 Article Computer Science Artificial Intelligence |
| mrcbC86 |
3+4 Article Computer Science Artificial Intelligence |
| mrcbT16-e |
COMPUTERSCIENCEARTIFICIALINTELLIGENCE |
| mrcbT16-j |
0.658 |
| mrcbT16-s |
0.866 |
| mrcbT16-B |
44.33 |
| mrcbT16-D |
Q3 |
| mrcbT16-E |
Q2 |
| arlyear |
2017 |
| mrcbU14 |
85021109619 SCOPUS |
| mrcbU24 |
PUBMED |
| mrcbU34 |
000407655600014 WOS |
| mrcbU63 |
cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 88 č. 1 2017 259 281 Elsevier |
|