Inductive inference is useful when a graph may gain nodes or when a learned model must work on another graph. Instead of learning an embedding tied to each training node, a graph neural network (GNN) learns a function that maps node features to embeddings. It can apply that function to unseen nodes, including nodes in a new graph, without retraining—provided their feature spaces are similar. section 2.2.2 section 2.1.4
The practical distinction is what carries over after training:
- A GNN uses node features and graph structure to produce embeddings. Message passing is its graph-learning mechanism. section 2.4 section 2.2.2
- Node2Vec (N2V) learns embeddings for a fixed graph through random walks. It does not easily handle unseen nodes or a new graph without being reapplied, although inductive extensions exist. section 2.2 section 2.5
Choose the approach for the data and task, not by assuming one always wins. Inductive GNN embeddings suit changing graphs and tasks where node features matter. Structure-only, random-walk methods can perform better when labels are scarce or noisy; embeddings from either approach can also serve as features in a conventional classifier. section 2.2 section 2.5


