AI & MLRecommendedAIML-GRL-002
Node Embeddings
Learning vectors for nodes from random-walk co-occurrence, the graph analogue of word embeddings.
- Difficulty
- 3 / 5
- Importance
- 4 / 5
- Study time
- 1–2 h
- Kind of work
- Mixed
Why it matters
The learner can explain how random-walk length and bias shape which nodes end up close in embedding space.