FREDE: Anytime Graph Embeddings
Summary: FREDE applies Frequent Directions sketching to graph embeddings, achieving linear space with a nonlinear transform. It iteratively processes a nonlinear PPR similarity, delivering column-covariance guarantees near SVD and competitive quality with as little as 10% node similarities. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Anton Tsitsulin
- 2. Marina Munkhoeva
- 3. Davide Mottin
- 4. Panagiotis Karras
- 5. Ivan Oseledets
- 6. Emmanuel Müller
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,147 | Efficient Tree-SVD for Subset Node Embedding over Large Dynamic Graphs | 2023 | SIGMOD | 5.6643767e-05 |
| 9,272 | Temporal SIR-GN: Efficient and Effective Structural Representation Learning for Temporal Graphs | 2023 | VLDB | 4.3652496e-05 |
| 10,732 | Effective and Efficient Attributed Hypergraph Embedding on Nodes and Hyperedges | 2025 | VLDB | 4.1945683e-05 |
| 11,376 | Succinct Graph Representations as Distance Oracles: An Experimental Evaluation | 2022 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 402 | Mergeable Summaries | 2012 | PODS | 0.00024196343 |
| 486 | Fast Incremental and Personalized PageRank | 2011 | VLDB | 0.00022068545 |
| 1,474 | Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank | 2020 | VLDB | 0.00011825229 |
Previous
Page 1 / 1
Next