Solving the Graph Edit Distance Problem with Variable Partitioning Local Search

被引：0
作者：
Darwiche, Mostafa [1 ,2 ]
Conte, Donatello [1 ]
Raveaux, Romain [1 ]
T'kindt, Vincent [2 ]
机构：
[1] Univ Tours, EA 6300, Lab Informat Fondamentale & Appl Tours, Tours, France
[2] Univ Tours, EA 6300, Lab Informat Fondamentale & Appl Tours, ERL,CNRS 6305, Tours, France
来源：
GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION, GBRPR 2019 | 2019年 / 11510卷
关键词：
Graph Edit Distance; Graph Matching; Mixed Integer Linear Program; Variable Partitioning Local Search; Matheuristic; LINEAR-PROGRAMMING FORMULATION; ASSIGNMENT;
D O I：
10.1007/978-3-030-20081-7_7
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In the world of graph matching, the Graph Edit Distance (GED) problem is a well-known distance measure between graphs. It has been proven to be a NP- hard minimization problem. This paper presents an adapted version of Variable Partitioning Local Search (VPLS) matheuristic for solving the GED problem. The main idea in VPLS is to perform local searches in the solution space of a Mixed Integer Linear Program (MILP). A local search is done in a small neighborhood defined based on a set of special variables. Those special variables are selected based on a procedure that extracts useful characteristics from the instance at hand. This actually ensures that the neighborhood contains high quality solutions. Finally, the experimentation results have shown that VPLS has outperformed existing heuristics in terms of solution quality on CMU-HOUSE database.
引用
收藏
页码：67 / 77
页数：11
相关论文
共 20 条
[1]   Graph edit distance as a quadratic assignment problem [J].
Bougleux, Sebastien ;
Brun, Luc ;
Carletti, Vincenzo ;
Foggia, Pasquale ;
Gauzere, Benoit ;
Vento, Mario .
PATTERN RECOGNITION LETTERS, 2017, 87 :38-46
[2]   Inexact graph matching for structural pattern recognition [J].
Bunke, H. ;
Allermann, G. .
PATTERN RECOGNITION LETTERS, 1983, 1 (04) :245-253
[3]   On a relation between graph edit distance and maximum common subgraph [J].
Bunke, H .
PATTERN RECOGNITION LETTERS, 1997, 18 (08) :689-694
[4]   Error correcting graph matching: On the influence of the underlying cost function [J].
Bunke, H .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1999, 21 (09) :917-922
[5]  
Cormen T. H., 2009, Introduction to algorithms, VThird
[6]  
Croce F.D, 2013, OXFORD HDB INNOVATIO
[7]   Graph edit distance: Accuracy of local branching from an application point of view [J].
Darwiche, Mostafa ;
Conte, Donatello ;
Raveaux, Romain ;
T'Kindt, Vincent .
PATTERN RECOGNITION LETTERS, 2020, 134 :20-28
[8]   A local branching heuristic for solving a Graph Edit Distance Problem [J].
Darwiche, Mostafa ;
Conte, Donatello ;
Raveaux, Romain ;
T'Kindt, Vincent .
COMPUTERS & OPERATIONS RESEARCH, 2019, 106 :225-235
[9]   Graph Edit Distance in the Exact Context [J].
Darwiche, Mostafa ;
Raveaux, Romain ;
Conte, Donatello ;
T'Kindt, Vincent .
STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, S+SSPR 2018, 2018, 11004 :304-314
[10]   Improving bipartite graph matching by assessing the assignment confidence [J].
Ferrer, Miquel ;
Serratosa, Francesc ;
Riesen, Kaspar .
PATTERN RECOGNITION LETTERS, 2015, 65 :29-36
12