A heterogeneous graph neural network learns node representations from graphs containing multiple node and relationship types. In a movie-recommendation graph, it exchanges information between user and movie nodes, refining embeddings from their interactions. section 12.2.4
A practical link-prediction pipeline typically proceeds as follows:
- Decode user–movie compatibility with a dot product, then interpret higher scores as more likely links. section 12.2.4
Movie recommendation
Users and movies form distinct node types, while ratings form user–movie edges. H-GraphConv, H-GAT, and H-SAGE encoders aggregate neighborhood features before scoring candidate interactions.
