How can I get link prediction between nodes of two in-memory graph:
Given a graph database contains:
User, Restaurant and Menu nodes, with
FRIEND(User, User), ORDER(User, Menu), VISIT(User, Restaurant), RATE(User, Restaurant), HAS_MENU(Restaurant, Menu) relations.
I create two in-memory sub-graphs: 'g_A' and 'g_B'
First sub-graph g_A obtained by cypher query includes :
User - [FRIEND]->User, and
The Second sub-graph g_B obtained by cypher query includes :
Restaurant - [HAS_MENU]->MENU
Given those two sub-graphs, I want to generate embedding using GraphSAGE algorithm (because I also want to include node features to learn the latent features of a node) and based on the generated embeddings I want to get (top-N) prediction (Recommendation) from User -> Restaurant .
In simple words:
How likely a User will visit the restaurant that he has never visited before.