GCNT: Identify influential seed set effectively in social networks by integrating graph convolutional networks with graph transformers

被引:0
作者
Tang, Jianxin [1 ]
Qu, Jitao [1 ]
Song, Shihui [1 ]
Zhao, Zhili [2 ]
Du, Qian [1 ]
机构
[1] Lanzhou Univ Technol, Sch Comp & Commun Technol, Lanzhou 730050, Peoples R China
[2] Lanzhou Univ, Sch Informat Sci & Engn, Lanzhou 730000, Peoples R China
关键词
Social network analysis; Influence maximization; Graph transformers; Graph convolutional networks; INFLUENCE MAXIMIZATION; NODES;
D O I
10.1016/j.jksuci.2024.102183
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Exploring effective and efficient strategies for identifying influential nodes from social networks as seeds to promote the propagation of influence remains a crucial challenge in the field of influence maximization (IM), which has attracted significant research efforts. Deep learning-based approaches have been adopted as an alternative promising solution to the IM problem. However, a robust model that captures the associations between network information and node influence needs to be investigated, while concurrently considering the effects of the overlapped influence on training labels. To address these challenges, a GCNT model, which integrates Graph Convolutional Networks with Graph Transformers, is introduced in this paper to capture the intricate relationships among the topology of the network, node attributes, and node influence effectively. Furthermore, an innovative method called Greedy- LIE is proposed to generate labels to alleviate the issue of overlapped influence spread. Moreover, a Mask mechanism specially tailored for the IM problem is presented along with an input embedding balancing strategy. The effectiveness of the GCNT model is demonstrated through comprehensive experiments conducted on six real-world networks, and the model shows its competitive performance in terms of both influence maximization and computational efficiency over state-of-the-art methods.
引用
收藏
页数:26
相关论文
共 50 条
  • [41] Simplified multilayer graph convolutional networks with dropout
    Fei Yang
    Huyin Zhang
    Shiming Tao
    Applied Intelligence, 2022, 52 : 4776 - 4791
  • [42] Ontology Completion Using Graph Convolutional Networks
    Li, Na
    Bouraoui, Zied
    Schockaert, Steven
    SEMANTIC WEB - ISWC 2019, PT I, 2019, 11778 : 435 - 452
  • [43] Kernel-based Graph Convolutional Networks
    Sahbi, Hichem
    2020 25TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2021, : 4887 - 4894
  • [44] Graph convolutional networks in language and vision: A survey
    Ren, Haotian
    Lu, Wei
    Xiao, Yun
    Chang, Xiaojun
    Wang, Xuanhong
    Dong, Zhiqiang
    Fang, Dingyi
    KNOWLEDGE-BASED SYSTEMS, 2022, 251
  • [45] Polynomial-based graph convolutional neural networks for graph classification
    Pasa, Luca
    Navarin, Nicolo
    Sperduti, Alessandro
    MACHINE LEARNING, 2022, 111 (04) : 1205 - 1237
  • [46] Graph Convolutional Networks for Student Answers Assessment
    Khayi, Nisrine Ait
    Rus, Vasile
    TEXT, SPEECH, AND DIALOGUE (TSD 2020), 2020, 12284 : 532 - 540
  • [47] Neighborhood Graph Convolutional Networks for Recommender Systems
    Liu, Tingting
    Wei, Chenghao
    Song, Baoyan
    Sun, Ruonan
    Yang, Hongxin
    Wan, Ming
    Li, Dong
    Li, Xiaoguang
    ADVANCES IN NATURAL COMPUTATION, FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, ICNC-FSKD 2022, 2023, 153 : 274 - 284
  • [48] Simplifying Graph Convolutional Networks as Matrix Factorization
    Liu, Qiang
    Zhang, Haoli
    Liu, Zhaocheng
    WEB AND BIG DATA, APWEB-WAIM 2021, PT I, 2021, 12858 : 35 - 43
  • [49] Dynamic Graph Convolutional Networks for Entity Linking
    Wu, Junshuang
    Zhang, Richong
    Mao, Yongyi
    Guo, Hongyu
    Soflaei, Masoumeh
    Huai, Jinpeng
    WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020), 2020, : 1149 - 1159
  • [50] Transfer Entropy in Graph Convolutional Neural Networks
    Moldovan, Adrian
    Cataron, Angel
    Andonie, Azvan
    2024 28TH INTERNATIONAL CONFERENCE INFORMATION VISUALISATION, IV 2024, 2024, : 207 - 213