SRFA-GRL: Predicting group influence in social networks with graph representation learning

被引:7
作者
Jia, Peng [1 ]
Kou, Jiangheng [1 ]
Liu, Jiayong [1 ]
Dai, Jinqiao [1 ]
Luo, Hairu [1 ]
机构
[1] Sichuan Univ, Sch Cyber Sci & Engn, Chengdu, Peoples R China
关键词
Group influence prediction; Social network analysis; Deep learning; Graph neural network; Identify influential nodes;
D O I
10.1016/j.ins.2023.118960
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Group influence evaluation is the fundamental research in social network analysis, whose main task is evaluating the influence of the group consisting of arbitrary nodes in the social network. Many methods have been proposed to measure group influence, such as centrality-based, Monte Carlo, and path-based methods. Graph Representation Learning (GRL) has profound success in social network node-level, edge-level, and graph-level tasks. GRL integrates nodes, edges, and other information in the network structure to calculate the nodes' embeddings jointly and provide embedding features with richer information than traditional methods. Group influence is related to many factors; existing methods only focus on a single aspect but ignore the various properties. This paper proposes a Subgraph Reconstruction Feature Aggregation Graph Representation Learning based (SRFA-GRL) framework to evaluate the group influence. In the SRFA-GRL framework, a subgraph reconstruction method is proposed to capture the node distribution of the group, and a vector similarity method is proposed to compute the relative distance between the maximal connected subgraph and group embeddings. Vast experiments are conducted on eight real social networks to analyze the effectiveness of the SRFA-GRL model, and the experimental results show that the SRFA-GRL framework outperforms baseline methods.
引用
收藏
页数:15
相关论文
共 38 条
[1]  
Batagelj V., 2003, An O (m) algorithm for cores decomposition of networks
[2]  
Borgs C, 2014, P 25 ANN ACM SIAM S, P946
[3]  
Cao Z, 2018, AAAI CONF ARTIF INTE, P2803
[4]   Thresholds for Epidemic Spreading in Networks [J].
Castellano, Claudio ;
Pastor-Satorras, Romualdo .
PHYSICAL REVIEW LETTERS, 2010, 105 (21)
[5]   A Comprehensive Survey of Scene Graphs: Generation and Application [J].
Chang, Xiaojun ;
Ren, Pengzhen ;
Xu, Pengfei ;
Li, Zhihui ;
Chen, Xiaojiang ;
Hauptmann, Alex .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2023, 45 (01) :1-26
[6]   StaticGreedy: Solving the Scalability-Accuracy Dilemma in Influence Maximization [J].
Cheng, Suqi ;
Shen, Huawei ;
Huang, Junming ;
Zhang, Guoqing ;
Cheng, Xueqi .
PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13), 2013, :509-518
[7]   Cross-Network Embedding for Multi-Network Alignment [J].
Chu, Xiaokai ;
Fan, Xinxin ;
Yao, Di ;
Zhu, Zhihua ;
Huang, Jianhui ;
Bi, Jingping .
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, :273-284
[8]   Subgraph centrality in complex networks -: art. no. 056103 [J].
Estrada, E ;
Rodríguez-Velázquez, JA .
PHYSICAL REVIEW E, 2005, 71 (05)
[9]   Virtual identification of essential proteins within the protein interaction network of yeast [J].
Estrada, E .
PROTEOMICS, 2006, 6 (01) :35-40
[10]  
Fout A, 2017, ADV NEUR IN, V30