<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0561324</ARLID> <utime>20240111141109.3</utime><mtime>20220920235959.9</mtime>              <title language="eng" primary="1">Learning Noisy-Or Networks with an Application in Linguistics</title>  <specification> <page_count>12 s.</page_count> <media_type>E</media_type> </specification>   <serial><ARLID>cav_un_epca*0561323</ARLID><ISSN>Proceedings of Machine Learning Research, Volume 186 : Proceedings of The 11th International Conference on Probabilistic Graphical Models</ISSN><title>Proceedings of Machine Learning Research, Volume 186 : Proceedings of The 11th International Conference on Probabilistic Graphical Models</title><part_num/><part_title/><page_num>277-288</page_num><publisher><place>Almerı́a</place><name>PMLR</name><year>2022</year></publisher><editor><name1>Salmerón</name1><name2>Antonio</name2></editor><editor><name1>Rumí</name1><name2>Rafael</name2></editor></serial>    <keyword>Bayesian networks</keyword>   <keyword>Learning Bayesian networks</keyword>   <keyword>Noisy-or model</keyword>   <keyword>Applications of Bayesian networks</keyword>   <keyword>Linguistics</keyword>   <keyword>Loanwords</keyword>    <author primary="1"> <ARLID>cav_un_auth*0414315</ARLID> <name1>Kratochvíl</name1> <name2>F.</name2> <country>CZ</country> </author> <author primary="0"> <ARLID>cav_un_auth*0216188</ARLID> <name1>Kratochvíl</name1> <name2>Václav</name2> <institution>UTIA-B</institution> <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> <full_dept>Department of Decision Making Theory</full_dept> <country>CZ</country>  <share>33</share> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0101228</ARLID> <name1>Vomlel</name1> <name2>Jiří</name2> <institution>UTIA-B</institution> <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> <full_dept>Department of Decision Making Theory</full_dept>  <share>33</share> <garant>K</garant> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <source_type>online</source_type> <url>http://library.utia.cas.cz/separaty/2022/MTR/kratochvil-0561324.pdf</url> </source>        <cas_special> <project> <project_id>GA20-18407S</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0397557</ARLID> </project>  <abstract language="eng" primary="1">In this paper we discuss the issue of learning Bayesian networks whose conditional probability tables (CPTs) are either noisy-or models or general CPTs. We refer to these models as Mixed Noisy-Or Bayesian Networks. In order to learn the structure of such Bayesian networks we modify the Bayesian Information Criteria (BIC) used for general Bayesian networks so that it reflects the number of parameters of a noisy-or model. We prove the log-likelihood function of a noisy-or model has a unique maximum and adapt the EM-learning method for leaky noisy-or models. We evaluate the proposed approach on synthetic data where it performs substantially better than general BNs. We apply this approach also to a problem from the domain of linguistics. We use Mixed Noisy-Or Bayesian Networks to model spread of loanwords in the South-East Asia Archipelago. We perform numerical experiments in which we compare prediction ability of general Bayesian Networks with Mixed Noisy-Or Bayesian Networks.</abstract>    <action target="WRD"> <ARLID>cav_un_auth*0436551</ARLID> <name>International Conference on Probabilistic Graphical Models</name> <dates>20221005</dates> <unknown tag="mrcbC20-s">20221007</unknown> <place>Almería</place> <country>ES</country>  </action>  <RIV>JD</RIV> <FORD0>10000</FORD0> <FORD1>10200</FORD1> <FORD2>10201</FORD2>    <reportyear>2023</reportyear>      <num_of_auth>3</num_of_auth>  <presentation_type> PR </presentation_type> <inst_support> RVO:67985556 </inst_support>  <permalink>https://hdl.handle.net/11104/0334054</permalink>  <cooperation> <ARLID>cav_un_auth*0320502</ARLID> <name>Univerzita Paleckého v Olomouci, Filozofická fakulta</name> <institution>UPOL</institution> <country>CZ</country> </cooperation>  <confidential>S</confidential>        <arlyear>2022</arlyear>       <unknown tag="mrcbU14"> SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> WOS </unknown> <unknown tag="mrcbU56"> online </unknown> <unknown tag="mrcbU63"> cav_un_epca*0561323 Proceedings of Machine Learning Research, Volume 186 : Proceedings of The 11th International Conference on Probabilistic Graphical Models PMLR 2022 Almerı́a 277 288 2640-3498 </unknown> <unknown tag="mrcbU67"> Salmerón Antonio 340 </unknown> <unknown tag="mrcbU67"> Rumí Rafael 340 </unknown> </cas_special> </bibitem>