Papers › NodeSketch: Highly-Efficient Graph Embeddings via Recursive Sketching
NodeSketch: Highly-Efficient Graph Embeddings via Recursive Sketching
Dingqi Yang, Paolo Rosso, Bin Li, Philippe Cudre-Mauroux
Embeddings have become a key paradigm to learn graph represen-tations and facilitate downstream graph analysis tasks. Existinggraph embedding techniques either sample a large number of nodepairs from a graph to learn node embeddings via stochastic op-timization, or factorize a high-order proximity/adjacency matrixof the graph via expensive matrix factorization. However, thesetechniques usually require significant computational resources forthe learning process, which hinders their applications on large-scale graphs. Moreover, the cosine similarity preserved by thesetechniques shows suboptimal efficiency in downstream graph anal-ysis tasks, compared to Hamming similarity, for example. To ad-dress these issues, we propose NodeSketch, a highly-efficient graphembedding technique preserving high-order node proximity viarecursive sketching. Specifically, built on top of an efficient data-independent hashing/sketching technique, NodeSketch generatesnode embeddings in Hamming space. For an input graph, it starts bysketching the self-loop-augmented adjacency matrix of the graphto output low-order node embeddings, and then recursively gener-atesk-order node embeddings based on the self-loop-augmentedadjacency matrix and (k-1)-order node embeddings. Our extensiveevaluation compares NodeSketch against a sizable collection ofstate-of-the-art techniques using five real-world graphs on twograph analysis tasks. The results show that NodeSketch achievesstate-of-the-art performance compared to these techniques, whileshowing significant speedup of 9x-372x in the embedding learningprocess and 1.19x-1.68x speedup when performing downstreamgraph analysis tasks
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections