Graph Neural Networks (GNNs) have excelled in predicting graph properties in various applications ranging from identifying trends in social networks to drug discovery and malware detection. With the abundance of new architectures and increased complexity, GNNs are becoming highly specialized when tested on a few well-known datasets. However, how the performance of GNNs depends on the topological and features properties of graphs is still an open question. In this work, we introduce a comprehensive benchmarking framework for graph machine learning, focusing on the performance of GNNs across varied network structures. Utilizing the geometric soft configuration model in hyperbolic space, we generate synthetic networks with realistic topological properties and node feature vectors. This approach enables us to assess the impact of network properties, such as topology-feature correlation, degree distributions, local density of triangles (or clustering), and homophily, on the effectiveness of different GNN architectures. Our results highlight the dependency of model performance on the interplay between network structure and node features, providing insights for model selection in various scenarios. This study contributes to the field by offering a versatile tool for evaluating GNNs, thereby assisting in developing and selecting suitable models based on specific data characteristics.
GNNX-BENCH: Unravelling the Utility of Perturbation-based GNN Explainers through In-depth Benchmarking
University of California Santa Barbara(加州大学圣巴巴拉分校);Indian Institute of Technology Delhi(印度理工学院德里分校);Rice University(莱斯大学);University of Illinois Chicago(芝加哥大学伊利诺伊分校)
Measuring What Matters: A Unified Evaluation Framework for GNN Explainability
Sapienza University of Rome(罗马萨皮恩扎大学);Intesa Sanpaolo AI Research(Intesa Sanpaolo人工智能研究);Anti Financial Crime Digital Hub(反金融犯罪数字中心);Intesa Sanpaolo Innovation Center(Intesa Sanpaolo创新中心)
Taxonomy of Benchmarks in Graph Representation Learning
Michigan State University(密歇根州立大学);Mila(米拉人工智能研究所);Université de Montréal(蒙特利尔大学);University of Utah(犹他大学);ETH Zürich(苏黎世联邦理工学院);University of California, Los Angeles(加州大学洛杉矶分校);Helmholtz Munich(亥姆霍兹慕尼黑中心);TU Munich(慕尼黑工业大学)
Benchmarking Graph Representations and Graph Neural Networks for Multivariate Time Series Classification
School of Computer Science & Software Engineering, Shenzhen University(深圳大学计算机与软件学院);Shenzhen Institute of Artificial Intelligence and Robotics for Society(深圳市人工智能与机器人研究院);Guangdong Provincial Key Laboratory of Intelligent Information Processing(广东省智能信息处理重点实验室);HBUG Lab, University of Exeter(埃克塞特大学HBUG实验室)
Nanyang Technological University(南洋理工大学);University of Cambridge(剑桥大学);Loyola Marymount University(洛约拉马利蒙特大学);Mila(米拉人工智能研究所);University of Montréal(蒙特利尔大学);National University of Singapore(新加坡国立大学)
Benchmarking Graph Neural Networks in Solving Hard Constraint Satisfaction Problems
Department of Computing Sciences, Bocconi University(博科尼大学计算机科学系);Bocconi Institute for Data Science and Analytics (BIDSA)(博科尼数据科学与分析研究所);Department of Physics and Astronomy and INFN, University of Florence(佛罗伦萨大学物理与天文学系及意大利国家核物理研究所);Dipartimento di Fisica, Sapienza Università di Roma(罗马萨皮恩扎大学物理系);CNR - Nanotec, unità di Roma, P.le Aldo Moro 5, 00185 Rome, Italy(意大利罗马国家科研委员会纳米技术单元,Aldo Moro大道5号,00185罗马,意大利);Department of Theoretical Physics, Physics Faculty, University of Havana(古巴哈瓦那大学理论物理系);INFN, sezione di Roma1, P.le Aldo Moro 5, 00185 Rome, Italy(意大利罗马1研究所,Aldo Moro大道5号,00185罗马,意大利)
Task-Agnostic Graph Neural Network Evaluation via Adversarial Collaboration
Imperial College London(帝国理工学院);Massachusetts Institute of Technology(麻省理工学院);Valence Discovery(Valence Discovery公司);Mila(米拉研究所);Université de Montréal(蒙特利尔大学);University of Cambridge(剑桥大学)
Unveiling Global Interactive Patterns across Graphs: Towards Interpretable Graph Neural Networks
School of Software Technology, Zhejiang University(浙江大学软件学院);Hangzhou High-Tech Zone (Binjiang) Institute of Blockchain and Data Security(杭州高新区(滨江)区块链与数据安全研究院);Big Graph Center, School of Computer and Computing Science, Hangzhou City University(杭州城市大学计算机与计算科学学院大图中心);College of Computer Science and Technology, Zhejiang University(浙江大学计算机科学与技术学院)
Sign is Not a Remedy: Multiset-to-Multiset Message Passing for Learning on Heterophilic Graphs
Harbin Institute of Technology(哈尔滨工业大学);Korea Advanced Institute of Science and Technology(韩国科学技术院);Pengcheng Laboratory(鹏城实验室);Fudan University(复旦大学);Shanghai Academy of Artificial Intelligence for Science(上海人工智能科学研究院);Griffith University(格里菲斯大学)
How Do Graph Signals Affect Recommendation: Unveiling the Mystery of Low and High-Frequency Graph Signals
School of Computer Science;Technology Soochow University Suzhou China;School of Electronic;Information Engineering Suzhou University of Science;Institute of Artificial Intelligence, Beihang University State Key Laboratory of Complex \& Critical Software Environment Beihang University Beijing China;School of Computing Macquarie University Sydney Australia;Soochow University;Suzhou University of Science;Beihang University;Macquarie University
A Flexible, Equivariant Framework for Subgraph GNNs via Graph Products and Graph Coarsening
Computer Science Technion - Israel Institute of Technology(技术学院-以色列理工学院计算机科学系);Electrical & Computer Engineering Technion - Israel Institute of Technology(技术学院-以色列理工学院电气与计算机工程系);NVIDIA Research(NVIDIA研究)
GRecX: An Efficient and Unified Benchmark for GNN-based Recommendation
Hefei University of Technology(合肥工业大学);Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所);University of Chinese Academy of Sciences(中国科学院大学)