graphlet icon indicating copy to clipboard operation
graphlet copied to clipboard

Implement efficient random motif searching via neural subgraph matching

Open rjurney opened this issue 3 years ago • 3 comments

Motif search for heterogeneous networks - especially temporal heterogeneous networks - has fundamental scalability challenges. Neural Subgraph Matching proposes a technique using graph representation learning and vector search called NeuroMatch. NeuroMatch is an efficient neural approach for subgraph matching.

The source code for NeuroMatch is at github.com/snap-stanford/neural-subgraph-learning-GNN.

image

FAISS and Distributed FAISS

If the code doesn't scale, is this something we could implement using FAISS and Distributed FAISS?

rjurney avatar Aug 01 '22 01:08 rjurney

@ThePigLA Some papers related to [Neural Subgraph Matching(https://arxiv.org/abs/2007.03092) are:

rjurney avatar Aug 01 '22 02:08 rjurney

@ThePigLA check it out - there is code!

https://github.com/snap-stanford/neural-subgraph-learning-GNN

rjurney avatar Aug 02 '22 00:08 rjurney

@ThePigLA I had the url for the code wrong. I edited it in place, but it is: https://github.com/snap-stanford/neural-subgraph-learning-GNN

rjurney avatar Aug 09 '22 09:08 rjurney