Aug 2026· Knowledge and Information Systems· Vol 68· 0 citations· 30 references
TL;DR
NoAH is proposed, a stochastic hypergraph generative model for attributed hypergraphs that utilizes the core–fringe node hierarchy to model hyperedge formation as a series of node attachments and determines attachment probabilities based on node attributes.
Abstract
In many real-world scenarios, interactions happen in a group-wise manner with multiple entities, and therefore, hypergraphs are a suitable tool to accurately represent such interactions. Hyperedges in real-world hypergraphs are not composed of randomly selected nodes but are instead formed through structured processes. Consequently, various hypergraph generative models have been proposed to explore fundamental mechanisms underlying hyperedge formation. However, most existing hypergraph generative models do not account for node attributes, which can play a significant role in hyperedge formation. As a result, these models fail to reflect the interactions between structure and node attributes. To address the issue above, we propose NoAH, a stochastic hypergraph generative model for attributed hypergraphs. NoAH utilizes the core–fringe node hierarchy to model hyperedge formation as a series of node attachments and determines attachment probabilities based on node attributes. We further introduce NoAHFit, a parameter learning procedure that fits NoAH to a given real-world hypergraph so that generated hypergraphs reproduce structural and attribute-related patterns. Through experiments on nine datasets across four different domains, we show that NoAH with NoAHFit achieves the best overall average rank among the nine evaluated hypergraph generative models when evaluated across six structure–attribute interplay metrics. Moreover, we discuss variants of NoAH for different types of node attributes, including binary, categorical, and continuous attributes. For cases without pre-existing node attributes, we extend NoAH and NoAHFit to jointly learn latent node attributes together with the parameters of NoAH and use the learned attributes for generation.
CaN is proposed, a core-aware neural generation framework for attributed hypergraphs that integrates the hierarchical k-core structure as an explicit generative prior and uses deep neural encoders to model dependencies among multi-dimensional node attributes.
Xiangfei Fang, Ran Bao, Heng Zhang· Proceedings of the 32nd ACM...· 0 citations
HyMAGE models each node as an autonomous agent and leverages LLMs for local-level semantic selection, so that hyperedge formation and dissolution emerge from local semantic affinity and structural context in a self-organizing manner.
B. Gu, Ji Zeng, Nuoran Zhou et al.· Proceedings of the 32nd ACM...· 0 citations
TAHB (Text-Attributed Hypergraph Benchmark) is presented, the first public benchmark integrating hypergraph structures and raw textual attributes, and shows that LLM-enhanced textual semantics improve hypergraph learning performance, while structural and textual information jointly provide the best setting for LLM-base...
D. Y. Kang, Junghyun Kim, Ju-hyun Jeon et al.· 0 citations
This work presents an approach that uses semantically meaningful, bimodal random walks on real-world heterogeneous networks to extract correlations between nodes and bring together nodes with shared or similar attributes.
Ujjwal Sharma, Stevan Rudinac, Marcel Worring et al.· 0 citations
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...
This work proposes HyperLabel, an encoder-decoder framework that explicitly models label dependencies through hypergraph neural networks, and proposes a unified cross-modal learning approach where HGNN+ performs bidirectional message passing to integrate feature information with label structure, and a shared cross-atte...
Pei-Yu Zhang, Heng Ping, Nikos Kanakaris 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.