Displaying similar documents to “Uniqueness of the level two Bayesian network representing a probability distribution.”

Node assignment problem in Bayesian networks

Joanna Polanska, Damian Borys, Andrzej Polanski (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper deals with the problem of searching for the best assignments of random variables to nodes in a Bayesian network (BN) with a given topology. Likelihood functions for the studied BNs are formulated, methods for their maximization are described and, finally, the results of a study concerning the reliability of revealing BNs' roles are reported. The results of BN node assignments can be applied to problems of the analysis of gene expression profiles.

Learning Bayesian networks by Ant Colony Optimisation: searching in two different spaces.

Luis M. de Campos, José A. Gámez, José M. Puerta (2002)

Mathware and Soft Computing

Similarity:

The most common way of automatically learning Bayesian networks from data is the combination of a scoring metric, the evaluation of the fitness of any given candidate network to the data base, and a search procedure to explore the search space. Usually, the search is carried out by greedy hill-climbing algorithms, although other techniques such as genetic algorithms, have also been used. A recent metaheuristic, Ant Colony Optimisation (ACO), has been successfully applied...

Neural networks using Bayesian training

Gabriela Andrejková, Miroslav Levický (2003)

Kybernetika

Similarity:

Bayesian probability theory provides a framework for data modeling. In this framework it is possible to find models that are well-matched to the data, and to use these models to make nearly optimal predictions. In connection to neural networks and especially to neural network learning, the theory is interpreted as an inference of the most probable parameters for the model and the given training data. This article describes an application of Neural Networks using the Bayesian training...

Evolutionary computation based on Bayesian classifiers

Teresa Miquélez, Endika Bengoetxea, Pedro Larrañaga (2004)

International Journal of Applied Mathematics and Computer Science

Similarity:

Evolutionary computation is a discipline that has been emerging for at least 40 or 50 years. All methods within this discipline are characterized by maintaining a set of possible solutions (individuals) to make them successively evolve to fitter solutions generation after generation. Examples of evolutionary computation paradigms are the broadly known Genetic Algorithms (GAs) and Estimation of Distribution Algorithms (EDAs). This paper contributes to the further development of this discipline...

Building adaptive tests using Bayesian networks

Jiří Vomlel (2004)

Kybernetika

Similarity:

We propose a framework for building decision strategies using Bayesian network models and discuss its application to adaptive testing. Dynamic programming and A O ☆ algorithm are used to find optimal adaptive tests. The proposed A O ☆ algorithm is based on a new admissible heuristic function.

Evolutionary learning of rich neural networks in the Bayesian model selection framework

Matteo Matteucci, Dario Spadoni (2004)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper we focus on the problem of using a genetic algorithm for model selection within a Bayesian framework. We propose to reduce the model selection problem to a search problem solved using evolutionary computation to explore a posterior distribution over the model space. As a case study, we introduce ELeaRNT (Evolutionary Learning of Rich Neural Network Topologies), a genetic algorithm which evolves a particular class of models, namely, Rich Neural Networks (RNN), in order to...

Knowledge revision in Markov networks.

Jörg Gebhardt, Christian Borgelt, Rudolf Kruse, Heinz Detmer (2004)

Mathware and Soft Computing

Similarity:

A lot of research in graphical models has been devoted to developing correct and efficient evidence propagation methods, like join tree propagation or bucket elimination. With these methods it is possible to condition the represented probability distribution on given evidence, a reasoning process that is sometimes also called focusing. In practice, however, there is the additional need to revise the represented probability distribution in order to reflect some knowledge changes by satisfying...