<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0503809</ARLID> <utime>20241106135724.8</utime><mtime>20190408235959.9</mtime>   <SCOPUS>85064231311</SCOPUS> <WOS>000469010600001</WOS>  <DOI>10.14736/kyb-2019-1-0001</DOI>           <title language="eng" primary="1">Bayesian stopping rule in discrete parameter space with multiple local maxima</title>  <specification> <page_count>11 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0297163</ARLID><ISSN>0023-5954</ISSN><title>Kybernetika</title><part_num/><part_title/><volume_id>55</volume_id><volume>1 (2019)</volume><page_num>1-11</page_num><publisher><place/><name>Ústav teorie informace a automatizace AV ČR, v. v. i.</name><year/></publisher></serial>    <keyword>Bayesian estimation</keyword>   <keyword>global maximum</keyword>   <keyword>model structure</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101124</ARLID> <name1>Kárný</name1> <name2>Miroslav</name2> <institution>UTIA-B</institution> <full_dept language="cz">Adaptivní systémy</full_dept> <full_dept language="eng">Department of Adaptive Systems</full_dept> <department language="cz">AS</department> <department language="eng">AS</department> <full_dept>Department of Adaptive Systems</full_dept> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2019/AS/karny-0503809.pdf</url> </source> <source> <url>https://www.kybernetika.cz/content/2019/1/1</url>  </source>        <cas_special> <project> <ARLID>cav_un_auth*0331019</ARLID> <project_id>GA16-09848S</project_id> <agency>GA ČR</agency> </project>  <abstract language="eng" primary="1">The paper presents the stopping rule for random search for Bayesian model-structure estimation by maximising the likelihood function. The inspected maximisation uses random restarts to cope with local maxima in discrete space. The stopping rule, suitable for any maximisation of this type, exploits the probability of finding global maximum implied by the number of local maxima already found. It stops the search when this probability crosses a given threshold. The inspected case represents an important example of the search in a huge space of hypotheses so common in artificial intelligence, machine learning and computer science.</abstract>     <result_subspec>WOS</result_subspec> <RIV>BC</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10103</FORD2>    <reportyear>2020</reportyear>     <unknown tag="mrcbC52"> 4 A sml 4as 20241106135724.8 </unknown> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0295600</permalink>   <confidential>S</confidential>  <contract> <name>Licence Agreement</name> <date>20190227</date> </contract> <unknown tag="mrcbC86"> 2 Article Biochemistry Molecular Biology|Chemistry Multidisciplinary </unknown> <unknown tag="mrcbC91"> A </unknown>         <unknown tag="mrcbT16-e">COMPUTERSCIENCE.CYBERNETICS</unknown> <unknown tag="mrcbT16-f">0.608</unknown> <unknown tag="mrcbT16-g">0.12</unknown> <unknown tag="mrcbT16-h">12.3</unknown> <unknown tag="mrcbT16-i">0.00084</unknown> <unknown tag="mrcbT16-j">0.215</unknown> <unknown tag="mrcbT16-k">778</unknown> <unknown tag="mrcbT16-q">43</unknown> <unknown tag="mrcbT16-s">0.241</unknown> <unknown tag="mrcbT16-y">27.97</unknown> <unknown tag="mrcbT16-x">0.81</unknown> <unknown tag="mrcbT16-3">146</unknown> <unknown tag="mrcbT16-4">Q3</unknown> <unknown tag="mrcbT16-5">0.582</unknown> <unknown tag="mrcbT16-6">50</unknown> <unknown tag="mrcbT16-7">Q4</unknown> <unknown tag="mrcbT16-B">15.751</unknown> <unknown tag="mrcbT16-C">6.8</unknown> <unknown tag="mrcbT16-D">Q4</unknown> <unknown tag="mrcbT16-E">Q4</unknown> <unknown tag="mrcbT16-M">0.16</unknown> <unknown tag="mrcbT16-N">Q4</unknown> <unknown tag="mrcbT16-P">6.818</unknown> <arlyear>2019</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: karny - kybernetika 2019 vol. 55 n.1.pdf </unknown>    <unknown tag="mrcbU14"> 85064231311 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000469010600001 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0297163 Kybernetika 0023-5954 Roč. 55 č. 1 2019 1 11 Ústav teorie informace a automatizace AV ČR, v. v. i. </unknown> </cas_special> </bibitem>