Research map / Graph learning / Graph algorithms and clustering
One-Hot Graph Encoder Embedding
Cencheng Shen, Qizhe Wang, Carey E. Priebe
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use GEE bootstrap instead of naive vertex-resampling bootstrap | graph bootstrap · Political Blogs | mean two-sample p-value: 0.25 -> 0.75 | Improved |
| use GEE bootstrap instead of naive bootstrap | graph bootstrap · Political Blogs | share of replicates with p<0.05: 26% -> 0.4% | Improved |
| use adjacency encoder embedding instead of ASE | vertex classification · Cora | classification error: 31.0% -> 16.3% | Improved |
| use adjacency encoder embedding instead of ASE | vertex classification · Gene | classification error: 27.2% -> 17.1% | Improved |
| use adjacency encoder embedding instead of LSE | vertex classification · Email | classification error: 39.5% -> 30.6% | Improved |
| use adjacency encoder embedding instead of LSE | vertex classification · PolBlog | classification error: 4.0% -> 4.9% | Hurt |
| use encoder embedding instead of node2vec | vertex classification · Email | classification error: 26.1% -> 30.6% | Hurt |
| use encoder embedding instead of node2vec | vertex classification · Gene | classification error: 21.9% -> 17.1% | Improved |
| use adjacency encoder embedding instead of ASE | embedding running time · LastFM | running time (s): 13.0 -> 0.02 | Improved |
| use unsupervised AEE instead of ASE for clustering | vertex clustering · Email | ARI: 0.11 -> 0.40 | Improved |
| use unsupervised AEE instead of ASE for clustering | vertex clustering · PolBlog | ARI: 0.07 -> 0.80 | Improved |
| use unsupervised AEE instead of node2vec | vertex clustering · Cora | ARI: 0.24 -> 0.12 | Hurt |
Closest papers by meaning
- GraphZoom: A Multi-level Spectral Approach for Accurate and Scalable Graph Embedding (ICLR 2020 · similarity 0.89)
- Detection of Model-Based Planted Pseudo-Cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embedding (TPAMI 2025 · similarity 0.87)
- Unsupervised Graph Embedding via Adaptive Graph Learning (TPAMI 2022 · similarity 0.87)
- Graph Neural Networks Powered by Encoder Embedding for Improved Node Learning (TPAMI 2026 · similarity 0.86)
- DUPLEX: Dual GAT for Complex Embedding of Directed Graphs (ICML 2024 · similarity 0.85)
- Weighted Embeddings for Low-Dimensional Graph Representation (AAAI 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
