Dual-View Desynchronization Hypergraph Learning for Dynamic Hyperedge Prediction

Hyperedges, as extensions of pairwise edges, can characterize higher-order relations among multiple individuals. Due to the necessity of hypergraph detection in practical systems, hyperedge prediction has become a frontier problem in complex networks. However, previous hyperedge prediction models encounter three challenges: (i) failing to predict dynamic and arbitrary-order hyperedges simultaneously, (ii) confusing higher-order and lower-order features together to propagate neighborhood information, and (iii) lacking the capability to learn physical evolution laws, which lead to poor performance of the models. To tackle these challenges, we propose D<inline-formula><tex-math notation="LaTeX">$^{3}$</tex-math></inline-formula>HP, a <u>D</u>ual-view <u>D</u>esynchronization hypergraph learning for arbitrary-order <u>D</u>ynamic <u>H</u>yperedge <u>P</u>rediction. Specifically, D<inline-formula><tex-math notation="LaTeX">$^{3}$</tex-math></inline-formula>HP extracts the dynamic higher-order and lower-order features of hyperedges separately through an elastic hypergraph neural network (EHGNN) and an alternate desynchronization graph convolutional network (ADGCN) at each time snapshot. EHGNN is designed to incrementally mine the implicit higher-order relations and propagate neighborhood information. Moreover, ADGCN aims to combine GCN with desynchronization learining to learn the physical evolution of lower-order relations and alleviate the over-smoothing problem. Further, we improve the prediction performance of the model by rationally fusing the features learned from the dual views. Extensive experiments on 8 dynamic higher-order networks demonstrate that D<inline-formula><tex-math notation="LaTeX">$^{3}$</tex-math></inline-formula>HP outperforms 14 state-of-the-art baselines.