<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0358907</ARLID> <utime>20240103195114.1</utime><mtime>20110510235959.9</mtime>   <WOS>000290426100006</WOS>  <DOI>10.1016/j.ijar.2010.09.004</DOI>           <title language="eng" primary="1">On open questions in the geometric approach to structural learning Bayesian nets</title>  <specification> <page_count>14 s.</page_count> </specification>   <serial><ARLID>cav_un_epca*0256774</ARLID><ISSN>0888-613X</ISSN><title>International Journal of Approximate Reasoning</title><part_num/><part_title/><volume_id>52</volume_id><volume>5 (2011)</volume><page_num>627-640</page_num><publisher><place/><name>Elsevier</name><year/></publisher></serial>    <keyword>structural learning Bayesian nets</keyword>   <keyword>standard imset</keyword>   <keyword>polytope</keyword>   <keyword>geometric neighborhood</keyword>   <keyword>differential imset</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101202</ARLID> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept language="eng">Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department language="eng">MTR</department> <full_dept>Department of Decision Making Theory</full_dept>  <name1>Studený</name1> <name2>Milan</name2> <institution>UTIA-B</institution> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0101228</ARLID> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept>Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department>MTR</department> <full_dept>Department of Decision Making Theory</full_dept>  <name1>Vomlel</name1> <name2>Jiří</name2> <institution>UTIA-B</institution> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2011/MTR/studeny-0358907.pdf</url> </source>        <cas_special> <project> <ARLID>cav_un_auth*0001814</ARLID> <project_id>1M0572</project_id> <agency>GA MŠk</agency> <country>CZ</country> </project> <project> <ARLID>cav_un_auth*0239648</ARLID> <project_id>GA201/08/0539</project_id> <agency>GA ČR</agency> </project> <project> <ARLID>cav_un_auth*0216518</ARLID> <project_id>2C06019</project_id> <agency>GA MŠk</agency> <country>CZ</country> </project> <project> <ARLID>cav_un_auth*0241637</ARLID> <project_id>GEICC/08/E010</project_id> <agency>GA ČR</agency> </project> <research> <research_id>CEZ:AV0Z10750506</research_id> </research>  <abstract language="eng" primary="1">The basic idea of an algebraic approach to learning a Bayesian network (BN) structure is to represent it by a certain uniquely determined vector, called the standard imset. In a recent paper, it was shown that the set of standard imsets is the set of vertices of a certain polytope  and natural geometric neighborhood for standard imsets, and, consequently,  for BN structures, was introduced.  The new geometric view led to a series of open mathematical questions.   In this paper, we try to answer some of them. First, we introduce a class of necessary linear constraints on standard imsets and formulate a conjecture that these constraints characterize the polytope. The conjecture has been confirmed in the case of (at most) 4 variables.   Second, we confirm a former hypothesis by Raymond Hemmecke that the only  lattice points within the polytope are standard imsets. Third, we give a partial analysis of the geometric  neighborhood in the case of 4 variables.</abstract>    <action target="WRD"> <ARLID>cav_un_auth*0271586</ARLID> <name>Workshop on Uncertainty Processing WUPES'09 /8./</name> <dates>19.09.2009-23.09.2009</dates> <place>Liblice</place> <country>CZ</country>  </action>  <RIV>BA</RIV>    <reportyear>2012</reportyear>      <permalink>http://hdl.handle.net/11104/0196817</permalink>          <unknown tag="mrcbT16-e">COMPUTERSCIENCEARTIFICIALINTELLIGENCE</unknown> <unknown tag="mrcbT16-f">2.155</unknown> <unknown tag="mrcbT16-g">0.293</unknown> <unknown tag="mrcbT16-h">4.7</unknown> <unknown tag="mrcbT16-i">0.00594</unknown> <unknown tag="mrcbT16-j">0.759</unknown> <unknown tag="mrcbT16-k">1638</unknown> <unknown tag="mrcbT16-l">92</unknown> <unknown tag="mrcbT16-s">1.703</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-B">70.492</unknown> <unknown tag="mrcbT16-C">76.126</unknown> <unknown tag="mrcbT16-D">Q2</unknown> <unknown tag="mrcbT16-E">Q1*</unknown> <arlyear>2011</arlyear>       <unknown tag="mrcbU34"> 000290426100006 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 52 č. 5 2011 627 640 Elsevier </unknown> </cas_special> </bibitem>