<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0359399</ARLID> <utime>20240103195147.3</utime><mtime>20110510235959.9</mtime>   <WOS>000291137100001</WOS> <SCOPUS>79955569018</SCOPUS>  <DOI>10.1016/j.ijar.2011.01.002</DOI>           <title language="eng" primary="1">Combining Marginal Probability Distributions via Minimization of Weighted Sum of Kullback-Leibler Divergences</title>  <specification> <page_count>13 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>52</volume_id><volume>6 (2011)</volume><page_num>659-671</page_num><publisher><place/><name>Elsevier</name><year/></publisher></serial>    <keyword>combining probabilities</keyword>   <keyword>Kullback-Leibler divergence</keyword>   <keyword>maximum likelihood</keyword>   <keyword>expert opinions</keyword>   <keyword>linear opinion pool</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101138</ARLID> <name1>Kracík</name1> <name2>Jan</name2> <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> <institution>UTIA-B</institution>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2011/AS/kracik-0359399.pdf</url> </source>        <cas_special> <project> <project_id>GA102/08/0567</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0239566</ARLID> </project> <research> <research_id>CEZ:AV0Z10750506</research_id> </research>  <abstract language="eng" primary="1">The paper deals with the problem of combining marginal probability distributions as a means for aggregating pieces of expert information. The combined distribution is searched as a minimizer of a weighted sum of Kullback–Leibler divergences of the given marginal distributions and corresponding marginals of the searched one. Necessary and sufficient conditions for a distribution to be a minimizer are stated. For discrete random variables an iterative algorithm for approximate solution of the minimization problem is proposed and its convergence is proved.</abstract>     <reportyear>2012</reportyear>  <RIV>BB</RIV>     <unknown tag="mrcbC52"> 4 A 4a 20231122134537.2 </unknown>  <permalink>http://hdl.handle.net/11104/0197196</permalink>          <unknown tag="mrcbT16-e">COMPUTERSCIENCEARTIFICIALINTELLIGENCE</unknown> <unknown tag="mrcbT16-f">2.155</unknown> <unknown tag="mrcbT16-g">0.293</unknown> <unknown tag="mrcbT16-h">4.7</unknown> <unknown tag="mrcbT16-i">0.00594</unknown> <unknown tag="mrcbT16-j">0.759</unknown> <unknown tag="mrcbT16-k">1638</unknown> <unknown tag="mrcbT16-l">92</unknown> <unknown tag="mrcbT16-s">1.703</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-B">70.492</unknown> <unknown tag="mrcbT16-C">76.126</unknown> <unknown tag="mrcbT16-D">Q2</unknown> <unknown tag="mrcbT16-E">Q1*</unknown> <arlyear>2011</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: kracik-0359399.pdf </unknown>    <unknown tag="mrcbU14"> 79955569018 SCOPUS </unknown> <unknown tag="mrcbU34"> 000291137100001 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 52 č. 6 2011 659 671 Elsevier </unknown> </cas_special> </bibitem>