All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Learning the Structure of Bayesian Networks from Incomplete Data Using a Mixture Model

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F23%3A00572588" target="_blank" >RIV/67985556:_____/23:00572588 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21340/23:00366181

  • Result on the web

    <a href="https://www.informatica.si/index.php/informatica/article/view/4497" target="_blank" >https://www.informatica.si/index.php/informatica/article/view/4497</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.31449/inf.v47i1.4497" target="_blank" >10.31449/inf.v47i1.4497</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Learning the Structure of Bayesian Networks from Incomplete Data Using a Mixture Model

  • Original language description

    In this paper, we provide an approach to learning optimal Bayesian network (BN) structures from incomplete data based on the BIC score function using a mixture model to handle missing values. We have compared the proposed approach with other methods. Our experiments have been conducted on different models, some of them Belief Noisy-Or (BNO) ones. We have performed experiments using datasets with values missing completely at random having different missingness rates and data sizes. We have analyzed the significance of differences between the algorithm performance levels using the Wilcoxon test. The new approach typically learns additional edges in the case of Belief Noisy-or models. We have analyzed this issue using the Chi-square test of independence between the variables in the true models, this approach reveals that additional edges can be explained by strong dependence in generated data. An important property of our new method for learning BNs from incomplete data is that it can learn not only optimal general BNs but also specific Belief Noisy-Or models which is using in many applications such as medical application.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2023

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    International Journal of Computing and Informatics

  • ISSN

    0350-5596

  • e-ISSN

  • Volume of the periodical

    47

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    SI - SLOVENIA

  • Number of pages

    14

  • Pages from-to

    83-96

  • UT code for WoS article

  • EID of the result in the Scopus database

    2-s2.0-85158820349