> ML_ALGORITHM // DEEPWALK-SOCIAL-NETWORK-REPRESENTATION_v1.0
DeepWalk
Pioneering graph embedding algorithm that translates language modeling (Word2Vec) to networks by treating uniform random walk sequences as artificial sentences.
Graph Representation Learninggraph-relationalhigh-intrinsicsmall (<1k)
Back to All AlgorithmsComputational Complexity
Training Complexity:O(walks * length * |V| * log(|V|))
Inference Complexity:O(1) table lookup
Hardware Profile
CPU Friendly:Yes
Requires GPU:No
Memory Footprint:low
Interpretability & Data
Interpretability Tier:high-intrinsic
Training Data Needs:small (<1k)
Interpretability Assessment
Learns latent social representations by mapping graph topological proximity directly to word vector distance.
Suitable Tasks & Supported Modalities
Suitable Tasks:
node classificationlink prediction
Supported Modalities:
graph
Implementing Libraries
Foundational Literature
Common Pitfalls & Warnings
- Completely ignores rich node feature attributes, relying solely on topological graph connectivity