Skip to content

DHMNN: A Hypergraph Motif-Based Framework for Directed Hyperlink Prediction.

Aug 2026 · IEEE Transactions on Neural Networks and Learning Systems · Vol PP · 0 citations
Medicine

TL;DR

A novel directed hypergraph motif-based neural network (DHMNN) for directed hyperlink prediction, which simultaneously captures higher order structural and connectivity information from the directed hypergraph topology and significantly outperforms state-of-the-art models.

Abstract

Directed hypergraphs have gained increasing attention for modeling group interactions while preserving directionality. However, link prediction in directed hypergraphs has rarely been studied despite its practical significance in complex systems analysis. Existing models perform poorly due to three major challenges in directed hypergraphs: 1) lacking effective feature initialization methods; 2) neglecting to detect higher order substructures; and 3) failing to capture long-range dependencies among vertices. To address these challenges, we propose a novel directed hypergraph motif-based neural network (DHMNN) for directed hyperlink prediction, which simultaneously captures higher order structural and connectivity information from the directed hypergraph topology. First, we introduce directed hypergraph motifs (DH-motifs) to explore higher order neighborhoods, analyzing vertex structural equivalence and generating structural features. Secondly, we utilize hypergraph incidence matrices to measure local connectivity, quantifying vertex co-occurrences and producing connectivity features. Then, we employ hypergraph attention to refine the vertex features at both global and local levels, further capturing long- and short-range dependencies. Finally, a new scoring layer is designed to assess the reliability of each link, considering its local properties, feature variance, and directionality. Extensive experiments on seven metabolic networks and three social networks demonstrate that DHMNN significantly and consistently outperforms state-of-the-art models, achieving a 3.40%-9.90% increase in accuracy. Our code is available at: https://github.com/XihangMeng/DHMNN.

View source

Similar papers

2025

HyperMixup: Hypergraph-Augmented with Higher-order Information Mixup

The proposed framework advances hypergraph representation learning by unifying data augmentation with higher-order topological constraints, offering both practical utility and theoretical insights for relational machine learning.

Kai-Xuan Yao, Zhuo Li, Jianqing Liang et al. · 0 citations
Open access Aug 2026

Beyond PageRank in GraphHD: Centrality Metrics and Efficient Hyperdimensional Encodings

Experiments show that replacing PageRank with alternative centralities yields similar F1-scores while offering notable runtime savings, and that GraphHD-Order remains competitive with the original GraphHD baseline while providing consistent speedups in encoding time.

Ignacio Sica, Gustavo Vazquez · 0 citations
Aug 2026

How Powerful are Hypergraph Neural Networks?

The Hypergraph Identity-Aware Subtree (IA Subtree) Kernel is introduced, which distinguishes uniform-regular hypergraphs by considering both neighborhood connectivity and connection density and develops two Hypergraph Neural Networks: Hypergraph Isomorphism Networks (HGIN) and Identity-Aware Hypergraph Isomorphism Netw...

Yi-Fan Feng, Rizhuo Huang, Yi-Fan Zhang et al. · 1 citation
Preprint Aug 2026

Preferential Attachment as a Simpliciality-Enforcing Mechanism in Hypergraphs

A generalized preferential attachment hypergraph model is introduced in which both hyperedge size and the number of new nodes per step are drawn from arbitrary distributions, and it is found that the simplicial fraction increases monotonically with the strength of preferential attachment up to the gelation transition a...

Jason LaRuez, Brendan Rooney · 0 citations
Book Open access Aug 2026

HyMAGE: Semantic-Aware Dynamic Hypergraph Generation

Understanding hypergraph evolution is essential for revealing high-order interaction patterns and generating credible synthetic data when real interaction records are scarce. Existing models suffer from two key limitations: (1) they rely on global topological heuristics that treat nodes as passive entities, yielding po...

B. Gu, Ji Zeng, Nuoran Zhou et al. · 0 citations
Open access Jul 2026

Topological measures in weighted hypergraphs

This work generalizes three distance-based topological measures, namely closeness centrality, betweenness centrality and node eccentricity, using this new hypergraph distance, and shows that hypergraphs can be divided into three distinct classes, corresponding to the possible dominance of specific orders of interaction...

E. Vasil'yeva, L. Tupikina, D. Musatov et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.