TY - GEN
T1 - Genius
T2 - 2024 SIAM International Conference on Data Mining, SDM 2024
AU - Hu, Chuxuan
AU - Zhou, Qinghai
AU - Tong, Hanghang
N1 - Publisher Copyright:
Copyright © 2024 by SIAM.
PY - 2024
Y1 - 2024
N2 - The state of the art for subteam replacement, based on random walk graph kernels, encounter the following limitations: (1) ineffective in capturing fine-grained node feature correlations, (2) inefficient without proper pruning mechanisms, and (3) limited applicability to single-member or equal-sized subteam replacements. In this paper, we address these limitations by proposing Genius, a clustering-based graph neural network (GNN) framework that (1) captures team social network knowledge for subteam replacement by deploying team-level attention GNNs (TAGs) and self-supervised positive team contrasting training scheme, (2) generates unsupervised team social network member clusters to prune candidates for fast computation, and (3) incorporates a subteam recommender that selects new subteams of flexible sizes. We demonstrate the efficacy of the proposed method in terms of (1) effectiveness: being able to select better subteam members that significantly increase the similarity between the new and original teams, and (2) efficiency: achieving more than 600× speed-up in average running time.
AB - The state of the art for subteam replacement, based on random walk graph kernels, encounter the following limitations: (1) ineffective in capturing fine-grained node feature correlations, (2) inefficient without proper pruning mechanisms, and (3) limited applicability to single-member or equal-sized subteam replacements. In this paper, we address these limitations by proposing Genius, a clustering-based graph neural network (GNN) framework that (1) captures team social network knowledge for subteam replacement by deploying team-level attention GNNs (TAGs) and self-supervised positive team contrasting training scheme, (2) generates unsupervised team social network member clusters to prune candidates for fast computation, and (3) incorporates a subteam recommender that selects new subteams of flexible sizes. We demonstrate the efficacy of the proposed method in terms of (1) effectiveness: being able to select better subteam members that significantly increase the similarity between the new and original teams, and (2) efficiency: achieving more than 600× speed-up in average running time.
KW - Graph Neural Networks
KW - Social Network Analysis
KW - Subteam Replacement
UR - http://www.scopus.com/inward/record.url?scp=85193504068&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85193504068&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85193504068
T3 - Proceedings of the 2024 SIAM International Conference on Data Mining, SDM 2024
SP - 10
EP - 18
BT - Proceedings of the 2024 SIAM International Conference on Data Mining, SDM 2024
A2 - Shekhar, Shashi
A2 - Papalexakis, Vagelis
A2 - Gao, Jing
A2 - Jiang, Zhe
A2 - Riondato, Matteo
PB - Society for Industrial and Applied Mathematics Publications
Y2 - 18 April 2024 through 20 April 2024
ER -