Graph-based node finding in big complex contextual social graphs

Keshou Wu, Guanfeng Liu*, Junwen Lu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Graph pattern matching is to find the subgraphs matching the given pattern graphs. In complex contextual social networks, considering the constraints of social contexts like the social relationships, the social trust, and the social positions, users are interested in the top-K matches of a specific node (denoted as the designated node) based on a pattern graph, rather than the entire set of graph matching. This inspires the conText-Aware Graph pattern-based top-K designated node matching (TAG-K) problem, which is NP-complete. Targeting this challenging problem, we propose a recurrent neural network- (RNN-) based Monte Carlo Tree Search algorithm (RN-MCTS), which automatically balances exploring new possible matches and extending existing matches. The RNN encodes the subgraph and maps it to a policy which is used to guide the MCTS. The experimental results demonstrate that our proposed algorithm outperforms the state-of-the-art methods in terms of both efficiency and effectiveness.

Original languageEnglish
Article number7909826
Number of pages13
JournalComplexity
Volume2020
DOIs
Publication statusPublished - 1 Jun 2020

Fingerprint Dive into the research topics of 'Graph-based node finding in big complex contextual social graphs'. Together they form a unique fingerprint.

Cite this