<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0543464</ARLID> <utime>20240103225940.8</utime><mtime>20210625235959.9</mtime>   <WOS>000665682400001</WOS> <SCOPUS>85117794760</SCOPUS>  <DOI>10.1007/s13042-021-01359-9</DOI>           <title language="eng" primary="1">Fusion of Probabilistic Unreliable Indirect Information into Estimation Serving to Decision Making</title>  <specification> <page_count>19 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0461048</ARLID><ISSN>1868-8071</ISSN><title>International Journal of Machine Learning and Cybernetics</title><part_num/><part_title/><volume_id>12</volume_id><volume>12 (2021)</volume><page_num>3367-3378</page_num><publisher><place/><name>Springer</name><year/></publisher></serial>    <keyword>distributed data fusion</keyword>   <keyword>information fusion</keyword>   <keyword>Bayesian paradigm</keyword>   <keyword>decision making</keyword>   <keyword>parameter estimation</keyword>   <keyword>multi-agent</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>50</share> <garant>A</garant> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0333671</ARLID> <name1>Hůla</name1> <name2>František</name2> <institution>UTIA-B</institution> <full_dept language="cz">Adaptivní systémy</full_dept> <full_dept>Department of Adaptive Systems</full_dept> <department language="cz">AS</department> <department>AS</department> <country>CZ</country>  <share>50</share> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2021/AS/karny-0543464.pdf</url> </source> <source> <url>https://link.springer.com/article/10.1007/s13042-021-01359-9</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">Bayesian decision making (DM) quantifies information by the probability density (pd) of treated variables. Gradual accumulation of information during acting increases the DM quality reachable by an agent exploiting it. The inspected accumulation way uses a parametric model forecasting observable DM outcomes and updates the posterior pd of its unknown parameter.  In the thought multi-agent case, a neighbouring agent, moreover, provides a privately-designed pd forecasting the same observation. This pd may notably enrich  the information of the focal agent. Bayes' rule is a unique deductive tool for a lossless compression of the information brought by the observations. It does not suit to processing of the forecasting pd. The paper extends solutions of this case. It: a) refines the Bayes'-rule-like use of the neighbour's forecasting pd. b) deductively complements former solutions so that the learnable neighbour's reliability can be taken into account. c) specialises the result to the exponential family, which shows the high potential of this information processing. d) cares about exploiting population statistics.</abstract>     <result_subspec>WOS</result_subspec> <RIV>IN</RIV> <FORD0>10000</FORD0> <FORD1>10200</FORD1> <FORD2>10201</FORD2>    <reportyear>2022</reportyear>      <num_of_auth>2</num_of_auth>  <unknown tag="mrcbC52"> 4 A sml 4as 20231122145809.0 </unknown> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0320767</permalink>   <confidential>S</confidential>  <contract> <name>Licence to Publish</name> <date>20210528</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">3.764</unknown> <unknown tag="mrcbT16-g">0.637</unknown> <unknown tag="mrcbT16-h">2.7</unknown> <unknown tag="mrcbT16-i">0.0051</unknown> <unknown tag="mrcbT16-j">0.597</unknown> <unknown tag="mrcbT16-k">4115</unknown> <unknown tag="mrcbT16-q">73</unknown> <unknown tag="mrcbT16-s">1.003</unknown> <unknown tag="mrcbT16-y">46.47</unknown> <unknown tag="mrcbT16-x">4.59</unknown> <unknown tag="mrcbT16-3">2590</unknown> <unknown tag="mrcbT16-4">Q2</unknown> <unknown tag="mrcbT16-5">3.862</unknown> <unknown tag="mrcbT16-6">234</unknown> <unknown tag="mrcbT16-7">Q2</unknown> <unknown tag="mrcbT16-C">61</unknown> <unknown tag="mrcbT16-D">Q3</unknown> <unknown tag="mrcbT16-E">Q2</unknown> <unknown tag="mrcbT16-M">0.85</unknown> <unknown tag="mrcbT16-N">Q2</unknown> <unknown tag="mrcbT16-P">61.034</unknown> <arlyear>2021</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: karny-0543464-PublicationAgreement.pdf </unknown>    <unknown tag="mrcbU14"> 85117794760 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000665682400001 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0461048 International Journal of Machine Learning and Cybernetics 1868-8071 1868-808X Roč. 12 č. 12 2021 3367 3378 Springer </unknown> </cas_special> </bibitem>