Effective and Efficient Attributed Hypergraph Embedding on Nodes and Hyperedges
Summary: SAHE jointly embeds nodes and hyperedges in attributed hypergraphs by preserving multi-hop, globally informed HMS-N/E similarities. Unified approximations and matrix-free optimizations avoid dense materialization, delivering superior quality and orders-of-magnitude speedups. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yiran Li (Hong Kong Polytechnic University)
- 2. Gongyao Guo (Hong Kong Polytechnic University)
- 3. Chen Feng (Hong Kong Polytechnic University)
- 4. Jieming Shi (Hong Kong Polytechnic University)
BibTeX Citation
@article{li_vldb25,
title = {{Effective and Efficient Attributed Hypergraph Embedding on Nodes and Hyperedges}},
author = {Li, Yiran and Guo, Gongyao and Feng, Chen and Shi, Jieming},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {11},
pages = {4269--4281},
doi = {10.14778/3749646.3749692},
url = {https://doi.org/10.14778/3749646.3749692},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 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,968 | Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank | 2020 | VLDB | 9.3752727e-05 |
| 3,828 | FREDE: Anytime Graph Embeddings | 2021 | VLDB | 7.0903874e-05 |
| 3,896 | Scaling Attributed Network Embedding to Massive Graphs | 2021 | VLDB | 7.0406415e-05 |
| 4,600 | LightNE: A Lightweight Graph Processing System for Network Embedding | 2021 | SIGMOD | 6.6122574e-05 |
| 5,960 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD | 6.0274692e-05 |
| 7,908 | Billion-Scale Bipartite Graph Embedding: A Global-Local Induced Approach | 2024 | VLDB | 5.5181056e-05 |
| 8,188 | Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation | 2023 | SIGMOD | 5.4703528e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,596 | Efficient Tree-SVD for Subset Node Embedding over Large Dynamic Graphs | 2023 | SIGMOD |
| 2 | 9,301 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD |
| 3 | 364 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB |
| 4 | 6,149 | Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding | 2024 | VLDB |
| 5 | 1,968 | Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank | 2020 | VLDB |
| 6 | 5,432 | Scalable and Effective Bipartite Network Embedding | 2022 | SIGMOD |
| 7 | 11,094 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB |
| 8 | 3,896 | Scaling Attributed Network Embedding to Massive Graphs | 2021 | VLDB |
| 9 | 5,960 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD |
| 10 | 8,188 | Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation | 2023 | SIGMOD |