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 (University of Bonn)
- 2. Marina Munkhoeva (Skolkovo Institute of Science and Technology)
- 3. Davide Mottin (Aarhus University)
- 4. Panagiotis Karras (Aarhus University)
- 5. Ivan Oseledets (Skolkovo Institute of Science and Technology)
- 6. Emmanuel Müller (Technical University of Dortmund)
BibTeX Citation
@article{tsitsulin_vldb21,
title = {{FREDE: Anytime Graph Embeddings}},
author = {Tsitsulin, Anton and Munkhoeva, Marina and Mottin, Davide and Karras, Panagiotis and Oseledets, Ivan and Müller, Emmanuel},
journal = {PVLDB},
series = {{VLDB} '21},
volume = {14},
number = {6},
pages = {1102--1110},
doi = {10.14778/3447689.3447713},
url = {https://doi.org/10.14778/3447689.3447713},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,596 | Efficient Tree-SVD for Subset Node Embedding over Large Dynamic Graphs | 2023 | SIGMOD | 6.1548101e-05 |
| 9,349 | Temporal SIR-GN: Efficient and Effective Structural Representation Learning for Temporal Graphs | 2023 | VLDB | 5.284204e-05 |
| 10,973 | Effective and Efficient Attributed Hypergraph Embedding on Nodes and Hyperedges | 2025 | VLDB | 5.093636e-05 |
| 11,574 | Succinct Graph Representations as Distance Oracles: An Experimental Evaluation | 2022 | VLDB | 5.093636e-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 |
|---|---|---|---|---|
| 451 | Mergeable Summaries | 2012 | PODS | 0.00018151445 |
| 556 | Fast Incremental and Personalized PageRank | 2011 | VLDB | 0.00016564032 |
| 1,968 | Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank | 2020 | VLDB | 9.3752727e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,432 | Scalable and Effective Bipartite Network Embedding | 2022 | SIGMOD |
| 2 | 1,411 | word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data | 2020 | PODS |
| 3 | 11,574 | Succinct Graph Representations as Distance Oracles: An Experimental Evaluation | 2022 | VLDB |
| 4 | 12,021 | NED: An Inter-Graph Node Metric Based On Edit Distance | 2017 | VLDB |
| 5 | 4,572 | On the Embeddability of Random Walk Distances | 2013 | VLDB |
| 6 | 10,973 | Effective and Efficient Attributed Hypergraph Embedding on Nodes and Hyperedges | 2025 | VLDB |
| 7 | 2,075 | FREDDY: Fast Word Embeddings in Database Systems | 2018 | SIGMOD |
| 8 | 11,108 | Efficient Graph Embedding Generation and Update for Large-Scale Temporal Graph | 2025 | VLDB |
| 9 | 1,968 | Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank | 2020 | VLDB |
| 10 | 5,596 | Efficient Tree-SVD for Subset Node Embedding over Large Dynamic Graphs | 2023 | SIGMOD |