Identifying User Intent and Context in Graph Queries

01/19/2018
by   Jithin Vachery, et al.
0

Graph querying is the task of finding similar embeddings of a given query graph in a large target graph. Existing techniques employ the use of structural as well as node and edge label similarities to find matches of a query in the target graph. However, these techniques have ignored the presence of context (usually manifested in the form of node/edge label distributions) in the query. In this paper, we propose CGQ (Contextual Graph Querying), a context-aware subgraph matching technique for querying real-world graphs. We introduce a novel sub-graph searching paradigm, which involves learning the context prevalent in the query graph. Under the proposed paradigm, we formulate the most contextually-similar subgraph querying problem that, given a query graph and a target graph, aims to identify the (top-k) maximal common subgraph(s) between the query and the target graphs with the highest contextual similarity. The quality of a match is quantized using our proposed contextual similarity function. We prove that the problem is NP-hard and also hard to approximate. Therefore, to efficiently solve the problem, we propose a hierarchical index, CGQ-Tree, with its associated search algorithm. Our experiments show that the proposed CGQ index is effective, efficient and scalable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/19/2018

CGQ: Relationship-Aware Contextual Graph Querying in Large Networks

The phenomenal growth of graph data from a wide-variety of real-world ap...
research
07/21/2022

Subgraph Matching via Query-Conditioned Subgraph Matching Neural Networks and Bi-Level Tree Search

Recent advances have shown the success of using reinforcement learning a...
research
08/18/2021

VerSaChI: Finding Statistically Significant Subgraph Matches using Chebyshev's Inequality

Approximate subgraph matching, which is an important primitive for many ...
research
10/20/2022

Maximum Common Subgraph Guided Graph Retrieval: Late and Early Interaction Networks

The graph retrieval problem is to search in a large corpus of graphs for...
research
12/08/2020

Context-Aware Graph Convolution Network for Target Re-identification

Most existing re-identification methods focus on learning robust and dis...
research
02/01/2017

Product Graph-based Higher Order Contextual Similarities for Inexact Subgraph Matching

Many algorithms formulate graph matching as an optimization of an object...
research
10/19/2022

Towards Accurate Subgraph Similarity Computation via Neural Graph Pruning

Subgraph similarity search, one of the core problems in graph search, co...

Please sign up or login with your details

Forgot password? Click here to reset