In this paper we propose a novel method of sensor planning for a mobile robot localization problem. We represent causal relation between local sensing results, actions, and belief of the global localization using a Bayesian network. Initially, the structure of the Bayesian network is learned from the complete data of the environment using K2 algorithm combined with GA (genetic algorithm). In th...

In this paper we propose a novel method of sensor planning for a mobile robot localization problem. We represent the conditional dependence relation between local sensing results, actions, and belief of the global localization using a Bayesian network. Initially, the structure of the Bayesian network is learned from the complete data of the environment using the K2 algorithm combined with a gen...

There is a growing interest in the use of neural networks in civil engineering to model complicated nonlinearity problems. A recent enhancement to the conventional back-propagation neural network algorithm is the adoption of a Bayesian inference procedure that provides good generalization and a statistical approach to deal with data uncertainty. A review of the Bayesian approach for neural netw...

This paper describes a parallel version of the PC algorithm for learning the structure of a Bayesian network from data. The PC algorithm is a constraint-based algorithm consisting of five steps where the first step is to perform a set of (conditional) independence tests while the remaining four steps relate to identifying the structure of the Bayesian network using the results of the (condition...

In this paper, we focus on computing the prices of securities represented by logical formulas in combinatorial prediction markets when the price function is represented by a Bayesian network. This problem turns out to be a natural extension of the weighted model counting (WMC) problem [15], which we call generalized weighted model counting (GWMC) problem. In GWMC, we are given a logical formula...

In this paper we present a majority-based method to learn Bayesian network structure from databases distributed over a peer-to-peer network. The method consists of a majority learning algorithm and a majority consensus protocol. The majority learning algorithm discovers the local Bayesian network structure based on the local database and updates the structure once new edges are learnt from neig...

This paper considers a parallel algorithm for Bayesian network structure learning from large data sets. The parallel algorithm is a variant of the well known PC algorithm. The PC algorithm is a constraint-based algorithm consisting of five steps where the first step is to perform a set of (conditional) independence tests while the remaining four steps relate to identifying the structure of the ...

Genetic epidemiologists strive to determine the genetic profile of diseases. Epistasis is the interaction between two or more genes to affect phenotype. Due to the often non-linearity of the interaction, it is difficult to detect statistical patterns of epistasis. Combinatorial methods for detecting epistasis investigate a subset of combinations of genes without employing a search strategy. The...

In this paper we present a majority-based method to learn Bayesian network structure from databases distributed over a peer-to-peer network. The method consists of a majority learning algorithm and a majority consensus protocol. The majority learning algorithm discovers the local Bayesian network structure based on the local database and updates the structure once new edges are learnt from neig...

In this paper we propose a novel method of sensor planning for a mobile robot localization problem. We represent causal relation between local sensing results, actions, and belief of the global localization using a Bayesian network. Initially, the structure of the Bayesian network is learned from the complete data of the environment using K2 algorithm combined with GA (genetic algorithm). In th...