An Adaptive Sampling Algorithm for the Top- K Group Betweenness Centrality

Betweenness centrality is one of the key centrality measures in many applications including community detections in biological networks, vulnerability detections in communication networks, misinformation filtering in social networks, etc. The top- K group betweenness centrality problem is to find a...

Full description

Saved in:
Bibliographic Details
Published in:Data engineering pp. 170 - 182
Main Authors: Xu, Wenzheng, Mao, Honglin, Shao, Heng, Liang, Weifa, Peng, Jian, Huang, Wen, Xu, Zichuan, Zhou, Pan, Yu, Jeffrey Xu
Format: Conference Proceeding
Language:English
Published: IEEE 19.05.2025
Subjects:
Approximation algorithms
Biology
Communication networks
Data engineering
Fake news
Filtering
Group betweenness centrality
randomized algorithms
Social networking (online)
ISSN:2375-026X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Betweenness centrality is one of the key centrality measures in many applications including community detections in biological networks, vulnerability detections in communication networks, misinformation filtering in social networks, etc. The top- K group betweenness centrality problem is to find a group of K nodes from a network so that the total fraction of shortest paths that pass through the K nodes is maximized. Existing studies proposed randomized sampling algorithms for the problem. We notice that the existing studies ensured that, the maximum deviation of the estimated centrality of every group from its expectation is no greater than a small given threshold for all potential groups with no more than K nodes, thereby generating too many samples, as the number of such groups is prohibitively large. In contrast, in this paper we first devise a novel algorithm that enables to estimate the centrality of a tentative group adaptively, and the algorithm immediately stops once the centrality is large enough; otherwise, the algorithm uses more samples to find a better group. We then theoretically show that, even the algorithm uses much less samples, it still can find a performance-guaranteed group with a large success probability. Experimental results with real-world networks demonstrate that the number of samples used by the proposed algorithm is from 2 to 18 times smaller than the state-of-the-art, while the centrality of the group found by the algorithm is no more than 4% smaller than the latter.
ISSN:2375-026X
DOI:10.1109/ICDE65448.2025.00020