@InProceedings{CI-daller2018,author = {Evariste Daller and SÃ©bastien Bougleux and Benoit GaÃ¼zÃ¨re and Luc Brun}, title = {Approximate Graph Edit Distance by Several Local Searches in Parallel}, booktitle = {7th Internation Conference on Pattern Recognition Applications and Methods}, year = 2018, editor = {Ana Fred}, month = "jan", theme="pattern,ged", url={HAL:= https://hal.archives-ouvertes.fr/hal-01664529v1}, abstract="Solving or approximating the linear sum assignment problem (LSAP) is an important step of several constructive and local search strategies developed to approximate the graph edit distance (GED) of two attributed graphs, or more generally the solution to quadratic assignment problems. Constructive strategies find a first estimation of the GED by solving an LSAP. This estimation is then refined by a local search strategy. While these search strategies depend strongly on the initial assignment, several solutions to the linear problem usually exist. They are not taken into account to get better estimations. All the estimations of the GED based on an LSAP select randomly one solution. This paper explores the insights provided by the use of several solutions to an LSAP, refined in parallel by a local search strategy based on the relaxation of the search space, and conditional gradient descent. Two other generators of initial assignments are also considered, approximate solutions to an LSAP and random assignments. Experimental evaluations on several datasets show that the proposed estimation is comparable to more global search strategies in a reduced computational time."}