Fig. 14From: Node embeddings in dynamic graphsThe online link prediction problem. For each edge in the stream, first we query the model to predict the next interaction. Then we train the model on the observed edge. Whenever node u interacts with another node, the model may generate different, updated top-k predictionsBack to article page