Betweenness Approximation for Edge Computing with Hypergraph Neural Network
Yaguang Guo, Wenxin Xie, Qingren Wang, Dengcheng Yan, Yiwen Zhang

TL;DR
This paper introduces HND, a hypergraph neural network-based method for approximating betweenness centrality to efficiently dismantle hypernetworks, addressing the limitations of existing approaches on simple networks.
Contribution
It proposes a novel betweenness approximation method using hypergraph neural networks specifically designed for hypernetworks, improving efficiency and effectiveness over traditional methods.
Findings
HND outperforms baseline methods in real hypernetwork dismantling tasks.
The model achieves high accuracy in betweenness approximation.
HND demonstrates significant efficiency gains in large-scale hypernetworks.
Abstract
Edge computing is highly demanded to achieve their full potentials Internet of Things (IoT), since various IoT systems have been generating big data facilitating modern latency-sensitive applications. As a basic problem, network dismantling tries to find an optimal set of nodes of which will maximize the connectivity degradation in a network. However, current approaches mainly focus on simple networks modeling only pairwise interactions between two nodes, while higher order groupwise interactions among arbitrary number of nodes are ubiquitous in real world which can be better modeled as hypernetwork. The structural difference between simple network and hypernetwork restricts the direct application of simple network dismantling methods to hypernetwork. Even though some hypernetwork centrality measures such as betweenness can be used for hypernetwork dismantling, they face the problem of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks
