<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0544189</ARLID> <utime>20240103230042.0</utime><mtime>20210801235959.9</mtime>   <WOS>000694711500021</WOS> <SCOPUS>85111504429</SCOPUS>  <DOI>10.1016/j.patrec.2021.07.011</DOI>           <title language="eng" primary="1">On Assigning Probabilities to New Hypotheses</title>  <specification> <page_count>6 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0257389</ARLID><ISSN>0167-8655</ISSN><title>Pattern Recognition Letters</title><part_num/><part_title/><volume_id>150</volume_id><volume>1 (2021)</volume><page_num>170-175</page_num><publisher><place/><name>Elsevier</name><year/></publisher></serial>    <keyword>minimum relative-entropy principle</keyword>   <keyword>prior probability</keyword>   <keyword>hypothesis</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>  <share>100</share> <garant>A</garant> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2021/AS/karny-0544189.pdf</url> </source> <source> <url>https://www.sciencedirect.com/science/article/pii/S0167865521002567</url>  </source>        <cas_special> <project> <project_id>LTC18075</project_id> <agency>GA MŠk</agency> <country>CZ</country> <ARLID>cav_un_auth*0372050</ARLID> </project> <project> <project_id>CA16228</project_id> <agency>The European Cooperation in Science and Technology (COST)</agency> <country>XE</country> <ARLID>cav_un_auth*0372051</ARLID> </project>  <abstract language="eng" primary="1">The paper proposes the way how to assign a proper prior probability to a new, generally compound, hypothesis. To this purpose, it uses the minimum relative-entropy principle and a forecaster-based knowledge transfer. Methodologically, it opens a way towards enriching the standard Bayesian framework by the possibility to extend the set of models during learning without the need to restart. The presented use scenarios concern: (a) creating new hypotheses, (b) learning problems with an insuffcient amount of data, and (c) sequential Monte Carlo estimation. They indicate a strong application potential of the proposed technique. Related interesting open research problems are listed.</abstract>     <result_subspec>WOS</result_subspec> <RIV>IN</RIV> <FORD0>10000</FORD0> <FORD1>10200</FORD1> <FORD2>10201</FORD2>    <reportyear>2022</reportyear>      <num_of_auth>1</num_of_auth>  <unknown tag="mrcbC52"> 4 A sml 4as 20231122145841.9 </unknown> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0321363</permalink>   <confidential>S</confidential>  <contract> <name>ELSEVIER Publishing Agreement</name> <date>20210726</date> </contract> <unknown tag="mrcbC86"> 3+4 Article Computer Science Artificial Intelligence </unknown> <unknown tag="mrcbC91"> C </unknown>         <unknown tag="mrcbT16-e">COMPUTERSCIENCE.ARTIFICIALINTELLIGENCE</unknown> <unknown tag="mrcbT16-f">4.253</unknown> <unknown tag="mrcbT16-g">1.041</unknown> <unknown tag="mrcbT16-h">8.4</unknown> <unknown tag="mrcbT16-i">0.01281</unknown> <unknown tag="mrcbT16-j">0.804</unknown> <unknown tag="mrcbT16-k">18442</unknown> <unknown tag="mrcbT16-q">188</unknown> <unknown tag="mrcbT16-s">1.479</unknown> <unknown tag="mrcbT16-y">33.16</unknown> <unknown tag="mrcbT16-x">5.74</unknown> <unknown tag="mrcbT16-3">6461</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-5">4.502</unknown> <unknown tag="mrcbT16-6">364</unknown> <unknown tag="mrcbT16-7">Q2</unknown> <unknown tag="mrcbT16-C">63.8</unknown> <unknown tag="mrcbT16-D">Q3</unknown> <unknown tag="mrcbT16-E">Q2</unknown> <unknown tag="mrcbT16-M">0.91</unknown> <unknown tag="mrcbT16-N">Q2</unknown> <unknown tag="mrcbT16-P">63.793</unknown> <arlyear>2021</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: karny-0544189-PATREC8308.html </unknown>    <unknown tag="mrcbU14"> 85111504429 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000694711500021 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0257389 Pattern Recognition Letters 0167-8655 1872-7344 Roč. 150 č. 1 2021 170 175 Elsevier </unknown> </cas_special> </bibitem>