Link Prediction Using Hebbian Graph Embeddings

by   Shalin Shah, et al.

Methods and systems for generating link predictions are provided. In one aspect, a method includes initializing a graph including a plurality of nodes representing selections of items in a training dataset to a multivariate normal distribution having a predetermined mean and a predetermined initial variance, the items in the training dataset comprising items in an item collection. The method includes, for each node in the graph, modeling embeddings for the node as embeddings of each neighboring node having a shared edge, with each being updated based at least in part on a transition probability and a variance. A predetermined number of iterations of updating are executed each iteration including an updated variance based on a learning rate. Based on receipt of an identification of an item from among the item collection, a plurality of predicted selections of items are identified using the embeddings for a node corresponding to the item.


page 1

page 2

page 3

page 4


Transition Information Enhanced Disentangled Graph Neural Networks for Session-based Recommendation

Session-based recommendation is a practical recommendation task that pre...

Meta-Prod2Vec - Product Embeddings Using Side-Information for Recommendation

We propose Meta-Prod2vec, a novel method to compute item similarities fo...

Transformation of Node to Knowledge Graph Embeddings for Faster Link Prediction in Social Networks

Recent advances in neural networks have solved common graph problems suc...

Compositional Network Embedding

Network embedding has proved extremely useful in a variety of network an...

SWAG: Item Recommendations using Convolutions on Weighted Graphs

Recent advancements in deep neural networks for graph-structured data ha...

A Pre-training Strategy for Recommendation

The side information of items has been shown to be effective in building...