mlsanityData to 14 Oct 2026

Hybrid Graph: A Unified Graph Representation with Datasets and Benchmarks for Complex Graphs

arXiv 2306.05108 ↗First posted 8 Jun 2023cs.LG cs.SIcited by 2

Not on the map. Why?

Abstract (arXiv)

Graphs are widely used to encapsulate a variety of data formats, but real-world networks often involve complex node relations beyond only being pairwise. While hypergraphs and hierarchical graphs have been developed and employed to account for the complex node relations, they cannot fully represent these complexities in practice. Additionally, though many Graph Neural Networks (GNNs) have been proposed for representation learning on higher-order graphs, they are usually only evaluated on simple graph datasets. Therefore, there is a need for a unified modelling of higher-order graphs, and a collection of comprehensive datasets with an accessible evaluation framework to fully understand the performance of these algorithms on complex graphs. In this paper, we introduce the concept of hybrid graphs, a unified definition for higher-order graphs, and present the Hybrid Graph Benchmark (HGB). HGB contains 23 real-world hybrid graph datasets across various domains such as biology, social media, and e-commerce. Furthermore, we provide an extensible evaluation framework and a supporting codebase to facilitate the training and evaluation of GNNs on HGB. Our empirical study of existing GNNs on HGB reveals various research opportunities and gaps, including (1) evaluating the actual performance improvement of hypergraph GNNs over simple graph GNNs; (2) comparing the impact of different sampling strategies on hybrid graph learning methods; and (3) exploring ways to integrate simple graph and hypergraph information. We make our source code and full datasets publicly available at https://zehui127.github.io/hybrid-graph-benchmark/.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 24 of its 37 references that are in the map. First posted on arXiv 8 Jun 2023.

Builds on

24 of 37 references.

References · 24

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  4. 2017Graph Attention Networkscited by 8,923
  5. 2017Inductive Representation Learning on Large Graphscited by 6,320
  6. 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
  7. 2021How Attentive are Graph Attention Networks?cited by 835
  8. 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 787
  9. 2015Image-based Recommendations on Styles and Substitutescited by 706
  10. 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
  11. 2019Multi-scale Attributed Node Embeddingcited by 548
  12. 2019DeepGCNs: Can GCNs Go as Deep as CNNs?cited by 527
12 more
  1. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 520
  2. 2019Graph U-Netscited by 492
  3. 2018Hypergraph Neural Networkscited by 488
  4. 2019Self-Attention Graph Poolingcited by 421
  5. 2019Hypergraph Convolution and Hypergraph Attentioncited by 228
  6. 2021You are AllSet: A Multiset Function Framework for Hypergraph Neural Networkscited by 127
  7. 2018A Closer Look at Deep Learning Heuristics: Learning rate restarts, Warmup and Distillationcited by 110
  8. 2020HNHN: Hypergraph Networks with Hyperedge Neuronscited by 109
  9. 2019Hierarchical Graph Network for Multi-hop Question Answeringcited by 83
  10. 2021Hierarchical Graph Representations in Digital Pathologycited by 59
  11. 2021Generative hypergraph clustering: from blockmodels to modularitycited by 49
  12. 2019Clustering in graphs and hypergraphs with categorical edge labelscited by 31

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.