|
|
Jak čelit nejistotě při rozhodování o odstranění fosforu ve vodohospodářství
Brabec, Jan ; Vojáček, Ondřej (advisor) ; Zajíček, Miroslav (referee)
Implementation of EU Water Framework Directive has led to an increased demand for cost-benefit analysis in water management. The directive introduces a good status, which is required on all water bodies by 2027. Excessive phosphorus inflows are one of the main reasons for not meeting the criteria in the Czech Republic. If achieving of the good status is not cost-proportionate, exemption can be applied. Many different methodologies were created across different states, including Czech official methodology by Slavíková et al. (2015). However, this methodology does not deal with uncertainty of measures effectiveness. This thesis describes how to implement the uncertainty into calculations using Bayesian networks. A case study of Stanovice water reservoir demonstrates the approach practically. Results of the Bayesian network show, that selected measures with available data eliminate desired amount of phosphorus in 70% of all cases. This reduction is most likely sufficient, because it holds for the upper estimate of required abatement (60 to 200 kg). Based on comparison of benefits and costs, it seems net benefits are generated by implementing suggested measures. Therefore, policy recommendation is to implement the selected measures.
|
|
|
Inference in Bayesian Networks
Šimeček, Josef ; Rozman, Jaroslav (referee) ; Zbořil, František (advisor)
This master's thesis deals with demonstration of various approaches to probabilistic inference in Bayesian networks. Basics of probability theory, introduction to Bayesian networks, methods for Bayesian inference and applications of Bayesian networks are described in theoretical part. Inference techniques are explained and complemented by their algorithm. Techniques are also illustrated on example. Practical part contains implementation description, experiments with demonstration applications and conclusion of the results.
|
|
|
An empirical comparison of popular algorithms for learning gene networks
Djordjilović, V. ; Chiogna, M. ; Vomlel, Jiří
In this work, we study the performance of different algorithms for learning gene networks from data. We consider representatives of different structure learning approaches, some of which perform unrestricted searches, such as the PC algorithm and the Gobnilp method and some of which introduce prior information on the structure, such as the K2 algorithm. Competing methods are evaluated both in terms of their predictive accuracy and their ability to reconstruct the true underlying network. A real data application based on an experiment performed by the University of Padova is also considered. We also discuss merits and disadvantages of categorizing gene expression measurements.
|
|
|
Proceedings of the 10th Workshop on Uncertainty Processing
Kratochvíl, Václav
WUPES 2015 is organized jointly by the Institute of Information Theory and Automation of the Czech Academy of Sciences and by the Faculty of Management, University of Economics, Prague. It is quite natural that such a meeting could not materialize if it were not for the hard work of many our colleagues and friends. This is why we want to express our gratitude to all the members of both the Programme and Organizing Committees. Last but not least, we also want to acknowledge the fact that this workshop is organized, due to the fact that the research of several members of the Organizing Committee is financially supported by grants GA CR no 15-00215S and 13-20012S.
|
|
|
A generalization of the noisy-or model to multivalued parent variables
Vomlel, Jiří
In this paper we propose a generalization of the noisy-or model to multivalued parent variables. Albeit the proposed generalization is more restrictive than previous proposals, it has several nice properties. In this paper we suggest a method for learning this model and report results of experiments on the Reuters text classification data.
|
|
|
Experimentální srovnání triangulačních heuristik na transformovaných sítích BN2O
Vomlel, Jiří ; Savický, Petr
In this paper we present results of experimental comparisons of several triangulation heuristics on bipartite graphs. Our motivation for testing heuristics on the family of bipartite graphs is the rank-one decomposition of BN2O networks. A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from the top level toward the bottom level and where all conditional probability tables are noisy-or gates. After applying the rank-one decomposition, which adds an extra level of auxiliary nodes in between the top and bottom levels, and after removing simplicial nodes of the bottom level we get so called BROD graph. This is an undirected bipartite graph. It is desirable for efficiency of the inference to find a triangulation of the BROD graph having the sum of table sizes for all cliques of the triangulated graph as small as possible. From this point of view, the minfill heuristics perform in average better than other tested heuristics (minwidth, h1, and mcs).
|
|
|
Využití imsetů při učení bayesovských sítí
Vomlel, Jiří ; Studený, Milan
This paper describes a modification of the greedy equivalence search (GES) algorithm. The presented modification is based on the algebraic approach to learning. The states of the search space are standard imsets. Each standard imset represents an equivalence class of Bayesian networks. For a given quality criterion the database is represented by the respective data imset. This allows a very simple update of a given quality criterion since the moves between states are represented by differential imsets. We exploit a direct characterization of lower and upper inclusion neighborhood, which allows an efficient search for the best structure in the inclusion neighborhood. The algorithm was implemented in R and is freely available.
|
|
|
Noisy-or classifier
Vomlel, Jiří
We discuss application of the noisy-or model to classification with large number of attributes. An example of such a task is categorization of text documents, where attributes are single words from the documents.
|
|
|
Two applications of Bayesian networks
Vomlel, Jiří
We present two recent applications of Bayesian networks: adaptive testing and troubleshooting man-made devices. We review briefly the underlying theory and provide a general framework for building strategies using Bayesian network models. We discuss applications of the framework to adaptive testing and troubleshooting. The paper is based on our experience with two projects.
|
|
|
Possibilistic Laws of Large Numbers
Kramosil, Ivan
We consider sequences of samples defined on spaces endowed by a possibilistic measure, looking for relatively small sets of such sequences which are important or interesting, in a sense, and which occur with possibility degree equal to one or tending to one with the length of the sample sequence increasing.
|
guest ::
