Deep Neural Matching Models for Graph Retrieval

10/03/2021
by   Chitrank Gupta, et al.
0

Graph Retrieval has witnessed continued interest and progress in the past few years. In thisreport, we focus on neural network based approaches for Graph matching and retrieving similargraphs from a corpus of graphs. We explore methods which can soft predict the similaritybetween two graphs. Later, we gauge the power of a particular baseline (Shortest Path Kernel)and try to model it in our product graph random walks setting while making it more generalised.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/12/2023

Sublinear Time Shortest Path in Expander Graphs

Computing a shortest path between two nodes in an undirected unweighted ...
research
01/31/2018

A Continuous - Time Quantum Walk for Attributed Graphs Matching

Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till...
research
06/10/2019

A Dijkstra-Based Efficient Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs

The parity constrained shortest path problem is a well-known variant tha...
research
12/13/2021

Isometric Hamming embeddings of weighted graphs

A mapping α : V(G) → V(H) from the vertex set of one graph G to another ...
research
04/15/2022

A generative neural network model for random dot product graphs

We present GraphMoE, a novel neural network-based approach to learning g...
research
03/18/2019

Extrapolating paths with graph neural networks

We consider the problem of path inference: given a path prefix, i.e., a ...
research
09/04/2018

Image Reassembly Combining Deep Learning and Shortest Path Problem

This paper addresses the problem of reassembling images from disjointed ...

Please sign up or login with your details

Forgot password? Click here to reset