Hypergraph Isomorphism Computation

by   Yifan Feng, et al.

The isomorphism problem is a fundamental problem in network analysis, which involves capturing both low-order and high-order structural information. In terms of extracting low-order structural information, graph isomorphism algorithms analyze the structural equivalence to reduce the solver space dimension, which demonstrates its power in many applications, such as protein design, chemical pathways, and community detection. For the more commonly occurring high-order relationships in real-life scenarios, the problem of hypergraph isomorphism, which effectively captures these high-order structural relationships, cannot be straightforwardly addressed using graph isomorphism methods. Besides, the existing hypergraph kernel methods may suffer from high memory consumption or inaccurate sub-structure identification, thus yielding sub-optimal performance. In this paper, to address the abovementioned problems, we first propose the hypergraph Weisfiler-Lehman test algorithm for the hypergraph isomorphism test problem by generalizing the Weisfiler-Lehman test algorithm from graphs to hypergraphs. Secondly, based on the presented algorithm, we propose a general hypergraph Weisfieler-Lehman kernel framework and implement two instances, which are Hypergraph Weisfeiler-Lehamn Subtree Kernel and Hypergraph Weisfeiler-Lehamn Hyperedge Kernel. In order to fulfill our research objectives, a comprehensive set of experiments was meticulously designed, including seven graph classification datasets and 12 hypergraph classification datasets. Results on hypergraph classification datasets show significant improvements compared to other typical kernel-based methods, which demonstrates the effectiveness of the proposed methods. In our evaluation, we found that our proposed methods outperform the second-best method in terms of runtime, running over 80 times faster when handling complex hypergraph structures.


page 1

page 2

page 3

page 4


HyperSF: Spectral Hypergraph Coarsening via Flow-based Local Clustering

Hypergraphs allow modeling problems with multi-way high-order relationsh...

Supervised Hypergraph Reconstruction

We study an issue commonly seen with graph data analysis: many real-worl...

Efficient Computation of High-Order Line Graphs of Hypergraphs

This paper considers structures of systems beyond dyadic (pairwise) inte...

Road Network Representation Learning: A Dual Graph based Approach

Road network is a critical infrastructure powering many applications inc...

Deep Hypergraph U-Net for Brain Graph Embedding and Classification

-Background. Network neuroscience examines the brain as a complex system...

Regularized Recovery by Multi-order Partial Hypergraph Total Variation

Capturing complex high-order interactions among data is an important tas...

Chemically inspired Erdős-Rényi oriented hypergraphs

High-order structures have been recognised as suitable models for system...

Please sign up or login with your details

Forgot password? Click here to reset