An algorithm directly finding the K most probable configurations in Bayesian networks.
B. SeroussiJean-Louis GolmardPublished in: Int. J. Approx. Reason. (1994)
Keyphrases
- dynamic programming
- np hard
- detection algorithm
- bayesian networks
- optimization algorithm
- learning algorithm
- k means
- experimental evaluation
- improved algorithm
- convergence rate
- times faster
- high accuracy
- cost function
- significant improvement
- simulated annealing
- linear programming
- particle swarm optimization
- computationally efficient
- clustering method
- path planning
- probability distribution
- preprocessing
- computational complexity
- objective function
- similarity measure
- recognition algorithm
- genetic algorithm