–tags: Graph Embedding Techniques
HARP:
– Previous models risked getting stuck in local optima since their objective functions are non-convex. – Graph coarsening to make similar nodes into super nodes – After coarsening the graph, it then generates an embedding of the coarsest “supernode”, followed by an embedding of the entire graph (which itself is made of supernodes). – As a preprocessing step rather than a solution: can be used with other techniques.