Parallelization of the PC Algorithm
نویسندگان
چکیده
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 (conditional) independence tests. In this paper, we describe a new approach to parallelization of the (conditional) independence testing as experiments illustrate that this is by far the most time consuming step. The proposed parallel PC algorithm is evaluated on data sets generated at random from five di↵erent realworld Bayesian networks. The results demonstrate that significant time performance improvements are possible using the proposed algorithm.
منابع مشابه
Efficient parallelization of the genetic algorithm solution of traveling salesman problem on multi-core and many-core systems
Efficient parallelization of genetic algorithms (GAs) on state-of-the-art multi-threading or many-threading platforms is a challenge due to the difficulty of schedulation of hardware resources regarding the concurrency of threads. In this paper, for resolving the problem, a novel method is proposed, which parallelizes the GA by designing three concurrent kernels, each of which running some depe...
متن کاملAn approach to Improve Particle Swarm Optimization Algorithm Using CUDA
The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...
متن کاملParallelization of Multiple Genome Alignment
In this work, we implement a genome alignment system which applies parallelization schemes to the ClustalW algorithm and the interface of database querying. Parallel construction of the distance matrices and parallelization of progressive alignment in the ClustalW algorithm are performed on PC-based Linux cluster with message-passing interface libraries. Achieved experiments show good speedup a...
متن کاملThe Method of the Chess Search Algorithms Parallelization Using Two-processor Distributed System
This paper is concerned with the realization of the parallel computer chess application. The asynchronous parallel search algorithm uses two processors connected via distributed local network. The original solution is implemented and tested in author’s chess application Axon. The standard approaches of parallelism use dual and quad server PC machine, which is expensive and rare compared with cl...
متن کاملA Stochastic algorithm to solve multiple dimensional Fredholm integral equations of the second kind
In the present work, a new stochastic algorithm is proposed to solve multiple dimensional Fredholm integral equations of the second kind. The solution of the integral equation is described by the Neumann series expansion. Each term of this expansion can be considered as an expectation which is approximated by a continuous Markov chain Monte Carlo method. An algorithm is proposed to sim...
متن کامل