Sciweavers

686 search results - page 1 / 138
» Inexact pattern matching using genetic algorithm
Sort
View
GECCO
2005
Springer
169views Optimization» more  GECCO 2005»
13 years 11 months ago
Inexact pattern matching using genetic algorithm
A Genetic Algorithm for graphical pattern matching based on angle matching had been proposed. It has proven quite effective in matching simple patterns. However, the algorithm nee...
Surapong Auwatanamongkol
CEC
2007
IEEE
13 years 11 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
GBRPR
2009
Springer
13 years 12 months ago
Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
David Knossow, Avinash Sharma, Diana Mateus, Radu ...
EMMCVPR
2001
Springer
13 years 10 months ago
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
Endika Bengoetxea, Pedro Larrañaga, Isabell...
CIMCA
2005
IEEE
13 years 11 months ago
Potentials and Limits of Graph-Algorithms for Discovering Ontology Patterns
The aim of the research presented in this paper is to contribute to reduction of development time for ontologies by discovering reusable parts and patterns. The approach is to use...
Christer Thörn, Orjan Eriksson, Eva Blomqvist...