Number of the records: 1
Gradient Descent Parameter Learning of Bayesian Networks under Monotonicity Restrictions
- 1.
SYSNO ASEP 0490309 Document Type C - Proceedings Paper (int. conf.) R&D Document Type Conference Paper Title Gradient Descent Parameter Learning of Bayesian Networks under Monotonicity Restrictions Author(s) Plajner, Martin (UTIA-B)
Vomlel, Jiří (UTIA-B) RID, ORCIDNumber of authors 2 Source Title Proceedings of the 11th Workshop on Uncertainty Processing (WUPES’18). - Praha : MatfyzPress, Publishing House of the Faculty of Mathematics and Physics Charles University, 2018 / Kratochvíl Václav ; Vejnarová Jiřina - ISBN 978-80-7378-361-7 Pages s. 153-164 Number of pages 12 s. Publication form Print - P Action Workshop on Uncertainty Processing (WUPES’18) Event date 06.06.2018 - 09.06.2018 VEvent location Třeboň Country CZ - Czech Republic Event type WRD Language eng - English Country CZ - Czech Republic Keywords Bayesian networks ; Learning model parameters ; monotonicity condition Subject RIV JD - Computer Applications, Robotics OECD category Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) R&D Projects GA16-12010S GA ČR - Czech Science Foundation (CSF) Institutional support UTIA-B - RVO:67985556 Annotation Learning parameters of a probabilistic model is a necessary step in most machine learning modeling tasks. When the model is complex and data volume is small the learning process may fail to provide good results. In this paper we present a method to improve learning results for small data sets by using additional information about the modelled system. This additional information is represented by monotonicity conditions which are restrictions on parameters of the model. Monotonicity simplifies the learning process and also these conditions are often required by the user of the system to hold.
In this paper we present a generalization of the previously used algorithm for parameter learning of Bayesian Networks under monotonicity conditions. This generalization allows both parents and children in the network to have multiple states. The algorithm is described in detail as well as monotonicity conditions are.
The presented algorithm is tested on two different data sets. Models are trained on differently sized data subsamples with the proposed method and the general EM algorithm. Learned models are then compared by their ability to fit data. We present empirical results showing the benefit of monotonicity conditions. The difference is especially significant when working with small data samples. The proposed method outperforms the EM algorithm for small sets and provides comparable results for larger sets.Workplace Institute of Information Theory and Automation Contact Markéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201. Year of Publishing 2019
Number of the records: 1