n-metrics for multiple graph alignment

07/09/2018
by   Sam Safavi, et al.
0

The work of Ioannidis et al. 2018 introduces a family of distances between two graphs that provides tractable graph alignment strategies. Importantly, the alignment scores produced by this family satisfy the properties of metrics, which is very useful in several learning tasks. In this paper, we generalize this work to compare n graphs by introducing a family of distances, which is an n-metric, i.e., an extension of a metric to n elements that includes a generalization of the triangle inequality. Our new family of distances, includes the ones in the work of Ioannidis et al. 2018 as a special case, and can produce tractable alignments between multiple graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2018

How should we (correctly) compare multiple graphs?

Graphs are used in almost every scientific discipline to express relatio...
research
01/12/2018

A Family of Tractable Graph Distances

Important data mining problems such as nearest-neighbor search and clust...
research
07/19/2018

Generalized Metric Repair on Graphs

Many modern data analysis algorithms either assume that or are considera...
research
02/14/2020

An Inductive Bias for Distances: Neural Nets that Respect the Triangle Inequality

Distances are pervasive in machine learning. They serve as similarity me...
research
06/02/2016

Sequential Principal Curves Analysis

This work includes all the technical details of the Sequential Principal...
research
01/29/2020

AMR Similarity Metrics from Principles

Different metrics have been proposed to compare Abstract Meaning Represe...
research
12/27/2022

The most general manner to injectively align true and predicted segments

Kirilov et al (2019) develop a metric, called Panoptic Quality (PQ), to ...

Please sign up or login with your details

Forgot password? Click here to reset