Inexact graph matching by means of estimation of distribution algorithms

@article{Bengoetxea2002InexactGM,
  title={Inexact graph matching by means of estimation of distribution algorithms},
  author={Endika Bengoetxea and Pedro Larra{\~n}aga and Isabelle Bloch and Aymeric Perchant and Claudia Boeres},
  journal={Pattern Recognition},
  year={2002},
  volume={35},
  pages={2867-2880}
}
Estimation of distribution algorithms (EDAs) are a quite recent topic in optimization techniques. They combine two technical disciplines of soft computing methodologies: probabilistic reasoning and evolutionary computing. Several algorithms and approaches have already been proposed by di8erent authors, but up to now there are very few papers showing their potential and comparing them to other evolutionary computational methods and algorithms such as genetic algorithms (GAs). This paper focuses… CONTINUE READING