Database Paper Browser

Back to papers

Efficient Tree-SVD for Subset Node Embedding over Large Dynamic Graphs

Summary: Tree-SVD fuses sparse randomized SVD with hierarchical SVD to efficiently update subset embeddings on large dynamic graphs. A lazy-update strategy updates only sub-matrices that change significantly (Frobenius norm), with theoretical guarantees and strong results on node classification and link prediction. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6599
Venue
SIGMOD
Year
2023
Pagerank
5.6643767e-05
Overall Rank
5,147 | 64.20%
DOI
10.1145/3588950

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers