Efficient Learning of Bayesian Networks with Bounded Tree-width

Learning Bayesian networks with bounded tree-width has attracted much attention recently, because low tree-width allows exact inference to be performed efficiently. Some existing methods \cite{korhonen2exact, nie2014advances} tackle the problem by using $k$-trees to learn the optimal Bayesian network with tree-width up to $k$. Finding the best $k$-tree, however, is computationally intractable. In this paper, we propose a sampling method to efficiently find representative $k$-trees by introducing an informative score function to characterize the quality of a $k$-tree. To further improve the quality of the $k$-trees, we propose a probabilistic hill climbing approach that locally refines the sampled $k$-trees. The proposed algorithm can efficiently learn a quality Bayesian network with tree-width at most $k$. Experimental results demonstrate that our approach is more computationally efficient than the exact methods with comparable accuracy, and outperforms most existing approximate methods.

Bayesian Dependence Tests for Continuous, Binary and Mixed Continuous-Binary Variables

Tests for dependence of continuous, discrete and mixed continuous-discrete variables are ubiquitous in science. The goal of this paper is to derive Bayesian alternatives to frequentist null hypothesis significance tests for dependence. In particular, we will present three Bayesian tests for dependence of binary, continuous and mixed variables. These tests are nonparametric and based on the Dirichlet Process, which allows us to use the same prior model for all of them. Therefore, the tests are “consistent” among each other, in the sense that the probabilities that variables are dependent computed with these tests are commensurable across the different types of variables being tested. By means of simulations with artificial data, we show the effectiveness of the new tests.

Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables

We present a method for learning treewidth-bounded Bayesian networks from data sets containing thousands of variables. Bounding the treewidth of a Bayesian network greatly reduces the complexity of inferences. Yet, being a global property of the graph, it considerably increases the difficulty of the learning process. Our novel algorithm accomplishes this task, scaling both to large domains and to large treewidths. Our novel approach consistently outperforms the state of the art on experiments with up to thousands of variables.

Monitoring and model updating of an FRP pedestrian truss bridge

This paper presents the results of a real bridge field experiment, carried out on a fiber reinforced polymer (FRP) pedestrian truss bridge of which nodes are reinforced with stainless steel plates. The aim of this paper is to identify the dynamic parameters of this bridge by using both conventional techniques and a model updating algorithm. In the field experiment, the bridge was instrumented with accelerometers at a number of locations on the bridge deck, recording both vertical and transverse vibrations. It was excited via jump tests at particular locations along its span and the resulting acceleration signals are used to identify dynamic parameters, such as the bridge mode shape, natural frequency and damping constant. Pedestrianinduced vibrations are also measured and utilized to identify dynamic parameters of the bridge. For a complete analysis of the bridge, a numerical model of the FRP bridge is created whose properties are calibrated utilizing a model updating algorithm. Comparable frequencies and mode shapes to those from the experiment were obtained by the FE models considering the reinforcement by increasing elastic modulus at every node of the bridge by stainless steel plate. Moreover, considering boundary conditions at both ends as fixed in the model resulted in modal properties comparable/similar to those from the experiment. This study also demonstrated that the effect of reinforcement and boundary conditions must be properly considered in an FE model to analyze real behavior of the FRP bridge.

Proposing the deep dynamic Bayesian network as a future computer based medical system

The development of new learning models has been of great importance throughout recent years, with a focus on creating advances in the area of deep learning. Deep learning was first noted in 2006, and has since become a major area of research in a number of disciplines. This paper will delve into the area of deep learning to present its current limitations and provide a new idea for a fully integrated deep and dynamic probabilistic system. The new model will be applicable to a vast number of areas initially focusing on applications into medical image analysis with an overall goal of utilising this approach for prediction purposes in computer based medical systems.