<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0342804</ARLID> <utime>20240103193459.6</utime><mtime>20100513235959.9</mtime>   <WOS>000278692300009</WOS> <SCOPUS>77955230142</SCOPUS>  <DOI>10.1016/j.ijar.2010.01.014</DOI>           <title language="eng" primary="1">A geometric view on learning Bayesian network structures</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>51</volume_id><volume>5 (2010)</volume><page_num>578-586</page_num><publisher><place/><name>Elsevier</name><year/></publisher></serial>    <keyword>learning Bayesian networks</keyword>   <keyword>standard imset</keyword>   <keyword>inclusion neighborhood</keyword>   <keyword>geometric neighborhood</keyword>   <keyword>GES algorithm</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101202</ARLID> <name1>Studený</name1> <name2>Milan</name2> <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> <institution>UTIA-B</institution> <full_dept>Department of Decision Making Theory</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0101228</ARLID> <name1>Vomlel</name1> <name2>Jiří</name2> <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> <institution>UTIA-B</institution> <full_dept>Department of Decision Making Theory</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0261765</ARLID> <name1>Hemmecke</name1> <name2>R.</name2> <country>DE</country>  </author>   <source> <url>http://library.utia.cas.cz/separaty/2010/MTR/studeny-0342804.pdf</url> </source>        <cas_special> <project> <project_id>IAA100750603</project_id> <agency>GA AV ČR</agency> <country>CZ</country> <ARLID>cav_un_auth*0216427</ARLID> </project> <project> <project_id>1M0572</project_id> <agency>GA MŠk</agency> <country>CZ</country> <ARLID>cav_un_auth*0001814</ARLID> </project> <project> <project_id>2C06019</project_id> <agency>GA MŠk</agency> <country>CZ</country> <ARLID>cav_un_auth*0216518</ARLID> </project> <project> <project_id>GA201/08/0539</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0239648</ARLID> </project> <research> <research_id>CEZ:AV0Z10750506</research_id> </research>  <abstract language="eng" primary="1">Basic idea of an algebraic approach to learning Bayesian network (BN) structures is to represent every BN  structure by a certain (uniquely determined) vector, called a standard imset. The main result of the paper is that the set of standard imsets is the set of vertices of a certain polytope. Motivated by the geometric view, we introduce the concept of the geometric neighborhood for standard imsets,  and, consequently, for BN structures. Then we show that it always  includes the inclusion neighborhood}, which was introduced earlier in connection with the GES algorithm. The third result is that the global optimum of an affine function over the polytope coincides with the local optimum relative to the geometric neighborhood.  The geometric neighborhood in the case of three variables is described and shown to differ from the inclusion neighborhood. This leads to a simple   example of the failure of the GES algorithm if data are not ``generated"   from a perfectly Markovian distribution.</abstract>  <action target=""> <ARLID>cav_un_auth*0261766</ARLID> <name>PGM 2008</name> </action>    <reportyear>2011</reportyear>  <RIV>BA</RIV>     <unknown tag="mrcbC52"> 4 A 4a 20231122134022.4 </unknown>  <permalink>http://hdl.handle.net/11104/0185432</permalink>          <unknown tag="mrcbT16-e">COMPUTERSCIENCEARTIFICIALINTELLIGENCE</unknown> <unknown tag="mrcbT16-f">1.720</unknown> <unknown tag="mrcbT16-g">0.222</unknown> <unknown tag="mrcbT16-h">5.5</unknown> <unknown tag="mrcbT16-i">0.00415</unknown> <unknown tag="mrcbT16-j">0.521</unknown> <unknown tag="mrcbT16-k">1384</unknown> <unknown tag="mrcbT16-l">63</unknown> <unknown tag="mrcbT16-s">1.454</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-B">55.614</unknown> <unknown tag="mrcbT16-C">65.278</unknown> <unknown tag="mrcbT16-D">Q2</unknown> <unknown tag="mrcbT16-E">Q1</unknown> <arlyear>2010</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: studeny-0342804.pdf </unknown>    <unknown tag="mrcbU14"> 77955230142 SCOPUS </unknown> <unknown tag="mrcbU34"> 000278692300009 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 51 č. 5 2010 578 586 Elsevier </unknown> </cas_special> </bibitem>