A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs.
Taichi KajiAzuma OhuchiPublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- simulated annealing algorithm
- directed acyclic graph
- simulated annealing
- equivalence class
- conditional independence
- structural learning
- genetic algorithm
- search algorithm
- random variables
- causal models
- equivalence classes
- directed graph
- premature convergence
- mutation operator
- tabu search
- causal reasoning
- causal discovery
- structural equation models
- approximation algorithms
- neural network
- undirected graph
- markov chain
- objective function
- bayesian networks
- markov property