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 bipartite Bayesian networks under monotonicity restrictions

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F20%3A00519831" target="_blank" >RIV/67985556:_____/20:00519831 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.tandfonline.com/doi/full/10.1080/03081079.2019.1692004" target="_blank" >https://www.tandfonline.com/doi/full/10.1080/03081079.2019.1692004</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1080/03081079.2019.1692004" target="_blank" >10.1080/03081079.2019.1692004</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Learning bipartite Bayesian networks under monotonicity restrictions

  • Original language description

    Learning parameters of a probabilistic model is a necessary step in machine learning tasks. We present a method to improve learning from small datasets by using monotonicity conditions. Monotonicity simplifies the learning and it is often required by users. We present an algorithm for Bayesian Networks parameter learning. The algorithm and monotonicity conditions are described, and it is shown that with the monotonicity conditions we can better fit underlying data. Our algorithm is tested on artificial and empiric datasets. We use different methods satisfying monotonicity conditions: the proposed gradient descent, isotonic regression EM, and non-linear optimization. We also provide results of unrestricted EM and gradient descent methods. Learned models are compared with respect to their ability to fit data in terms of log-likelihood and their fit of parameters of the generating model. Our proposed method outperforms other methods for small sets, and provides better or comparable results for larger sets.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science 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

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2020

  • 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 General Systems

  • ISSN

    0308-1079

  • e-ISSN

  • Volume of the periodical

    49

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    24

  • Pages from-to

    88-111

  • UT code for WoS article

    000497538000001

  • EID of the result in the Scopus database

    2-s2.0-85075330445