Inexact graph matching by means of estimation of distribution algorithms

Pattern Recognition

Volumn 35, Issue 12, 2002, Pages 2867-2880

  Bengoetxea, Endika ^a   Larraaga, Pedro ^a   Bloch, Isabelle ^b   Perchant, Aymeric ^b   Boeres, Claudia ^c  

^a UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

^b TELECOM PARISTECH   (France)

^c FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Bayesian networks; Estimation of distribution algorithms; Evolutionary computing; Genetic algorithms; Hybrid soft computing; Inexact graph matching; Probabilistic reasoning

Indexed keywords

ESTIMATION; GENETIC ALGORITHMS; IMAGE ANALYSIS; OPTIMIZATION; PROBABILISTIC LOGICS;

INEXACT GRAPH MATCHING;

PATTERN RECOGNITION;

ALGORITHM; SOFTWARE;

EID: 0036887533     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(01)00232-1     Document Type: Article

References (53)

1. Inexact graph matching using genetic search
2. Matching structural shape descriptions using genetic algorithms
3. A graduated assignment algorithm for graph matching
4. Structural matching by discrete relaxation
5. Graph matching with a dual-step EM algorithm
6. Symbolic graph matching with the EM algorithm
7. Estimation of distribution algorithms: A new evolutionary computation approach for graph matching problems
8. Solving graph matching with EDAs using a permutation-based representation
9. Inexact graph matching using learning and simulation of Bayesian networks, An empirical comparison between different approaches with synthetic data
10. A new definition for fuzzy attributed graph homomorphism with application to structural shape recognition in brain imaging
11. Graph fuzzy homomorphism interpreted as fuzzy association graphs
12. Model-based scene recognition using graph fuzzy homomorphism solved by genetic algorithm
13. Optimization of control parameters for genetic algorithms
14. Combinatorial optimization by learning and simulation of Bayesian networks
15. Estimation of distribution algorithms
16. From recombination of genes to the estimation of distributions i. Binary parameters
17. Influence diagrams
18. Bayesian networks
19. Conditional independence in statistical theory
20. Simulated crossover in genetic algorithms
21. The compact genetic algorithm
22. The equation for response to selection and its use for prediction
23. MIMIC: Finding optima by estimating probability densities
24. The bivariate marginal distribution algorithm
25. Schemata, distributions and graphical models in evolutionary optimization
26. Global optimization with Bayesian networks
27. BOA: The Bayesian optimization algorithm
28. FDA - A scalable evolutionary algorithm for the optimization of additively decomposed functions
29. New look at the statistical model identification
30. Estimating the dimension of a model
31. A Bayesian method for the induction of probabilistic networks from data
32. Analysis of the behaviour of genetic algorithms when searching Bayesian networks from data
33. Searching for the best ordering in the structure learning of Bayesian networks
34. Structure learning of Bayesian networks by genetic algorithms. A performance analysis of control parameters
35. Theory refinement in Bayesian networks
36. Learning Bayesian networks: Search methods and experimental results
37. Propagating uncertainty in Bayesian networks by probabilistic logic sampling
38. Dealing with constraints with estimation of distribution algorithms: The univariate case
39. GENITOR: A different genetic algorithm
40. Decomposing Bayesian networks: Triangulation of the moral graph with genetic algorithms
41. Parallel estimation of distribution algorithms
42. A parallel algorithm for building possibilistic causal networks
43. Parallel learning of belief networks in large and difficult domains