Geometry of Graph Edit Distance Spaces

05/29/2015
by   Brijnesh J. Jain, et al.
0

In this paper we study the geometry of graph spaces endowed with a special class of graph edit distances. The focus is on geometrical results useful for statistical pattern recognition. The main result is the Graph Representation Theorem. It states that a graph is a point in some geometrical space, called orbit space. Orbit spaces are well investigated and easier to explore than the original graph space. We derive a number of geometrical results from the orbit space representation, translate them to the graph space, and indicate their significance and usefulness in statistical pattern recognition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/28/2019

Measuring group-separability in geometrical space for evaluation of pattern recognition and embedding algorithms

Evaluating data separation in a geometrical space is fundamental for pat...
research
01/06/2018

Distance formulas capable of unifying Euclidian space and probability space

For pattern recognition like image recognition, it has become clear that...
research
06/04/2022

Symmetry as a Representation of Intuitive Geometry?

Recognition of geometrical patterns seems to be an important aspect of h...
research
06/15/2023

On the k-Hamming and k-Edit Distances

In this paper we consider the weighted k-Hamming and k-Edit distances, t...
research
10/17/2018

Offline Signature Verification by Combining Graph Edit Distance and Triplet Networks

Biometric authentication by means of handwritten signatures is a challen...
research
03/20/2023

On the Maximal Independent Sets of k-mers with the Edit Distance

In computational biology, k-mers and edit distance are fundamental conce...
research
03/22/2023

Projective positivity of the function systems

The present paper is devoted to the projective positivity in the categor...

Please sign up or login with your details

Forgot password? Click here to reset