Generalized Median Graph via Iterative Alternate Minimizations

06/26/2019
by   Nicolas Boria, et al.
0

Computing a graph prototype may constitute a core element for clustering or classification tasks. However, its computation is an NP-Hard problem, even for simple classes of graphs. In this paper, we propose an efficient approach based on block coordinate descent to compute a generalized median graph from a set of graphs. This approach relies on a clear definition of the optimization process and handles labeling on both edges and nodes. This iterative process optimizes the edit operations to perform on a graph alternatively on nodes and edges. Several experiments on different datasets show the efficiency of our approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2023

p-median location interdiction on trees

In p-median location interdiction the aim is to find a subset of edges i...
research
11/26/2019

Flexible graph matching and graph edit distance using answer set programming

The graph isomorphism, subgraph isomorphism, and graph edit distance pro...
research
09/21/2022

Kernel-Based Generalized Median Computation for Consensus Learning

Computing a consensus object from a set of given objects is a core probl...
research
12/15/2016

Orthogonal Edge Routing for the EditLens

The EditLens is an interactive lens technique that supports the editing ...
research
06/30/2020

Hierarchical Graph Matching Network for Graph Similarity Computation

Graph edit distance / similarity is widely used in many tasks, such as g...
research
10/31/2012

On the Relation Between the Common Labelling and the Median Graph

In structural pattern recognition, given a set of graphs, the computatio...
research
05/18/2017

Exemplar or Matching: Modeling DCJ Problems with Unequal Content Genome Data

The edit distance under the DCJ model can be computed in linear time for...

Please sign up or login with your details

Forgot password? Click here to reset