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)
Incoming Non-self Citations Over Time
Authors
- 1. Xinyu Du (Chinese University of Hong Kong)
- 2. Xingyi Zhang (Chinese University of Hong Kong)
- 3. Sibo Wang (Chinese University of Hong Kong)
- 4. Zengfeng Huang (Fudan University)
BibTeX Citation
@inproceedings{du_sigmod23,
title = {{Efficient Tree-SVD for Subset Node Embedding over Large Dynamic Graphs}},
author = {Du, Xinyu and Zhang, Xingyi and Wang, Sibo and Huang, Zengfeng},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3588950},
url = {https://dl.acm.org/doi/10.1145/3588950},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,264 | Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme | 2023 | SIGMOD | 6.6947069e-05 |
| 11,075 | Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation | 2026 | VLDB | 4.9769913e-05 |
| 11,339 | Lighter-X: An Efficient and Plug-and-play Strategy for Graph-based Recommendation through Decoupled Propagation | 2025 | VLDB | 4.9769913e-05 |
| 11,464 | Efficient Graph Embedding Generation and Update for Large-Scale Temporal Graph | 2025 | VLDB | 4.9769913e-05 |
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,836 | Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank | 2020 | VLDB | 9.53235e-05 |
| 2,259 | HubPPR: Effective Indexing for Approximate Personalized PageRank | 2017 | VLDB | 8.7344054e-05 |
| 3,896 | FREDE: Anytime Graph Embeddings | 2021 | VLDB | 6.9349294e-05 |
| 3,978 | Massively Parallel Algorithms for Personalized PageRank | 2021 | VLDB | 6.8818094e-05 |
| 4,103 | TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs | 2018 | SIGMOD | 6.8040813e-05 |
| 4,264 | Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme | 2023 | SIGMOD | 6.6947069e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,564 | Scalable and Effective Bipartite Network Embedding | 2022 | SIGMOD |
| 2 | 10,566 | Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings | 2026 | SIGMOD |
| 3 | 10,454 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 4 | 6,235 | Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding | 2024 | VLDB |
| 5 | 12,066 | Factorized Graph Representations for Semi-Supervised Learning from Sparse Data | 2020 | SIGMOD |
| 6 | 7,292 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB |
| 7 | 11,366 | Effective and Efficient Attributed Hypergraph Embedding on Nodes and Hyperedges | 2025 | VLDB |
| 8 | 812 | Dimensionality Reduction for Similarity Searching in Dynamic Databases | 1998 | SIGMOD |
| 9 | 10,816 | Efficient Hyper-truss Decomposition over Hypergraphs | 2026 | VLDB |
| 10 | 11,464 | Efficient Graph Embedding Generation and Update for Large-Scale Temporal Graph | 2025 | VLDB |