loading
Documents

Research.Publish.Connect.

Paper

Authors: Évariste Daller ; Sébastien Bougleux ; Benoit Gaüzère and Luc Brun

Affiliation: Normandie Univ, France

ISBN: 978-989-758-276-9

Keyword(s): Graph Edit Distance, Error-correcting Graph Matching, Quadratic Assignment Problem, Approximation.

Related Ontology Subjects/Areas/Topics: Graphical and Graph-Based Models ; Pattern Recognition ; Stochastic Methods ; Theory and Methods

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. 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. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 35.153.73.72

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Daller, É.; Bougleux, S.; Gaüzère, B. and Brun, L. (2018). Approximate Graph Edit Distance by Several Local Searches in Parallel.In Proceedings of the 7th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM, ISBN 978-989-758-276-9, pages 149-158. DOI: 10.5220/0006599901490158

@conference{icpram18,
author={Évariste 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={Proceedings of the 7th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},
year={2018},
pages={149-158},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006599901490158},
isbn={978-989-758-276-9},
}

TY - CONF

JO - Proceedings of the 7th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,
TI - Approximate Graph Edit Distance by Several Local Searches in Parallel
SN - 978-989-758-276-9
AU - Daller, É.
AU - Bougleux, S.
AU - Gaüzère, B.
AU - Brun, L.
PY - 2018
SP - 149
EP - 158
DO - 10.5220/0006599901490158

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.