Identifying Group Anchors in Real-World Group Interactions Under Label Scarcity
Not on the map. Why?
Abstract (arXiv)
Group interactions occur in various real-world contexts, e.g., co-authorship, email communication, and online Q&A. In each group, there is often a particularly significant member, around whom the group is formed. Examples include the first or last author of a paper, the sender of an email, and the questioner in a Q&A session. In this work, we discuss the existence of such individuals in real-world group interactions. We call such individuals group anchors and study the problem of identifying them. First, we introduce the concept of group anchors and the identification problem. Then, we discuss our observations on group anchors in real-world group interactions. Based on our observations, we develop AnchorRadar, a fast and effective method for group anchor identification under realistic settings with label scarcity, i.e., when only a few groups have known anchors. AnchorRadar is a semi-supervised method using information from groups both with and without known group anchors. Finally, through extensive experiments on thirteen real-world datasets, we demonstrate the empirical superiority of AnchorRadar over various baselines w.r.t. accuracy and efficiency. In most cases, AnchorRadar achieves higher accuracy in group anchor identification than all the baselines, while using 10.2× less training time than the fastest baseline and 43.6× fewer learnable parameters than the most lightweight baseline on average.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 28 of its 67 references that are in the map. First posted on arXiv 25 Sep 2025.
Builds on
28 of 67 references.
References · 28
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2018Hypergraph Neural Networkscited by 488
- 2019Hypergraph Convolution and Hypergraph Attentioncited by 228
- 2021UniGNN: a Unified Framework for Graph and Hypergraph Neural Networkscited by 130
- 2020HNHN: Hypergraph Networks with Hyperedge Neuronscited by 109
- 2016Motifs in Temporal Networkscited by 101
- 2018Simplicial Closure and higher-order link predictioncited by 93
- 2013Multilayer Networkscited by 87
- 2014The structure and dynamics of multilayer networkscited by 51
- 2021Analyzing Overfitting under Class Imbalance in Neural Networks for Image Segmentationcited by 34
- 2020How Much and When Do We Need Higher-order Information in Hypergraphs? A Case Study on Hyperedge Predictioncited by 31
16 more
- 2024A Survey on Hypergraph Neural Networks: An In-Depth and Step-By-Step Guidecited by 23
- 2020Semi-supervised Hypergraph Node Classification on Hypergraph Line Expansioncited by 22
- 2023Classification of Edge-dependent Labels of Nodes in Hypergraphscited by 14
- 2022AHP: Learning to Negative Sample for Hyperedge Predictioncited by 12
- 2018Three hypergraph eigenvector centralitiescited by 11
- 2022A Hypergraph Neural Network Framework for Learning Hyperedge-Dependent Node Embeddingscited by 9
- 2021Node and Edge Nonlinear Eigenvector Centrality for Hypergraphscited by 8
- 2022Core-periphery detection in hypergraphscited by 6
- 2023Encapsulation Structure and Dynamics in Hypergraphscited by 5
- 2019Planted Hitting Set Recovery in Hypergraphscited by 4
- 2019Annotated Hypergraphs: Models and Applicationscited by 4
- 2022Core-periphery Models for Hypergraphscited by 3
- 2020Hcore-Init: Neural Network Initialization based on Graph Degeneracycited by 2
- 2023Hypercore Decomposition for Non-Fragile Hyperedges: Concepts, Algorithms, Observations, and Applicationscited by 2
- 2023Neighborhood-based Hypergraph Core Decompositioncited by 1
- 2023Exploring Cohesive Subgraphs in Hypergraphs: The (k,g)-core Approachcited by 1
Built on by
Not cited yet.