DeepAI AI Chat
Log In Sign Up

Generalized Median Graph via Iterative Alternate Minimizations

by   Nicolas Boria, et al.

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.


page 1

page 2

page 3

page 4


p-median location interdiction on trees

In p-median location interdiction the aim is to find a subset of edges i...

Flexible graph matching and graph edit distance using answer set programming

The graph isomorphism, subgraph isomorphism, and graph edit distance pro...

Kernel-Based Generalized Median Computation for Consensus Learning

Computing a consensus object from a set of given objects is a core probl...

Orthogonal Edge Routing for the EditLens

The EditLens is an interactive lens technique that supports the editing ...

On the Relation Between the Common Labelling and the Median Graph

In structural pattern recognition, given a set of graphs, the computatio...

A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals

In this paper, an iterative algorithm is designed to compute the sparse ...

Origraph: Interactive Network Wrangling

Data wrangling is widely acknowledged to be a critical part of the data ...