Parallel two-level simulated annealing
ICS '93 Proceedings of the 7th international conference on Supercomputing
Modelling gene functional linkages using yeast microarray data
International Journal of Bioinformatics Research and Applications
Linking Bayesian networks and PLS path modeling for causal analysis
Expert Systems with Applications: An International Journal
Data mining for exploring hidden patterns between KM and its performance
Knowledge-Based Systems
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
mDBN: motif based learning of gene regulatory networks using dynamic bayesian networks
Proceedings of the 15th annual conference on Genetic and evolutionary computation
An efficient node ordering method using the conditional frequency for the K2 algorithm
Pattern Recognition Letters
Hi-index | 0.00 |
Bayesian network is a common approach to study gene regulatory networks. Here, we explore the problem of inferring Bayesian structure from data that can be viewed as a search problem. The goal is to find a global optimized probability network model given the data. In this work, we propose a new search algorithm: Two-level Simulated Annealing (TLSA). TLSA performs simulated annealing in two levels with strengthened local optimizer, and is less likely to get tracked at local optimizer. To illustrate the value of TLSA in Bayesian structure learning, the algorithms is applied on simulated datasets generated using the Monte Carlo method. The experimental results are compared with other learning algorithm such as K2.