Hello everyone! Now, I’m started to study GNN’s and DGL.
I’m developing a recommender system with link prediction in a bipartite graph.
I’ve learned and replicated this tutorial: KDD20-Hands-on-Tutorial/3_link_predict.ipynb at master · dglai/KDD20-Hands-on-Tutorial · GitHub
But, in this section, I had some doubts:
The author created the train and test labels with:
- “0”, for positive edges
- “1”, for negative edges.
Wouldn’t It be the inverse? Must positive edges be labeled with “1” for indicate that edge exists?
In the “Blitz Introduction to DGL” (Link Prediction using Graph Neural Networks — DGL 0.9.0 documentation), I think that the author did the inverse (1 for positives, and 0 for negatives):
I wanna understand what way is correct, please.
Another thing that I have doubt, is because the Blitz tutorial have some differents ways to implement the model.
For example: To compute the score of each edge, by dot product, Blitz tutorial creates the DotPredictor class, and in the KDD20-Hands-on-Tutorial, the author only mutiplies the vectors pair.
I think that the “Blitz Tutorial” is more recommended, because It’s more recent (KDD20 was presented in 2020 year). I’m correct?