<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0450559</ARLID> <utime>20240103211213.5</utime><mtime>20151201235959.9</mtime>         <title language="eng" primary="1">An empirical comparison of popular algorithms for learning gene networks</title>  <specification> <page_count>12 s.</page_count> <media_type>E</media_type> </specification>   <serial><ARLID>cav_un_epca*0447898</ARLID><ISBN>978-80-245-2102-2</ISBN><title>Proceedings of the 10th Workshop on Uncertainty Processing WUPES’15</title><part_num/><part_title/><page_num>61-72</page_num><publisher><place>Praha</place><name>Oeconomica</name><year>2015</year></publisher><editor><name1>Kratochvíl</name1><name2>V.</name2></editor></serial>    <keyword>Bayesian networks</keyword>   <keyword>Gene networks</keyword>   <keyword>Biological pathways</keyword>    <author primary="1"> <ARLID>cav_un_auth*0322154</ARLID> <name1>Djordjilović</name1> <name2>V.</name2> <country>IT</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0322155</ARLID> <name1>Chiogna</name1> <name2>M.</name2> <country>IT</country>  </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>   <source> <url>http://library.utia.cas.cz/separaty/2015/MTR/vomlel-0450559.pdf</url> </source>        <cas_special>  <abstract language="eng" primary="1">In this work, we study the  performance of different algorithms for learning gene networks from data. We consider representatives of different structure learning approaches, some of which perform unrestricted searches, such as the PC algorithm and the Gobnilp method and some of which introduce prior information on the structure, such as the K2 algorithm. Competing methods are evaluated both in terms of their predictive accuracy and their ability  to reconstruct the true underlying network. A real data application based on an experiment performed by the University of Padova is also considered. We also discuss merits and disadvantages of categorizing gene expression measurements.</abstract>  <action target="EUR"> <ARLID>cav_un_auth*0319735</ARLID> <name>WUPES 2015. Workshop on Uncertainty Processing /10./</name> <place>Monínec</place> <dates>16.09.2015-19.09.2015</dates>  <country>CZ</country> </action>    <reportyear>2016</reportyear>  <RIV>IN</RIV>      <num_of_auth>3</num_of_auth>  <presentation_type> PR </presentation_type> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0252671</permalink>   <confidential>S</confidential>        <arlyear>2015</arlyear>       <unknown tag="mrcbU63"> cav_un_epca*0447898 Proceedings of the 10th Workshop on Uncertainty Processing WUPES’15 978-80-245-2102-2 61 72 Praha Oeconomica 2015 </unknown> <unknown tag="mrcbU67"> Kratochvíl V. 340 </unknown> </cas_special> </bibitem>