Influence maximization in social networks using role-based embedding

被引:1
作者
Gu, Xu [1 ]
Wang, Zhibin [1 ]
Chen, Xiaoliang [1 ,2 ]
Lu, Peng [2 ]
Du, Yajun [1 ]
Tang, Mingwei [1 ]
机构
[1] Xihua Univ, Sch Comp & Software Engn, Chengdu 610039, Peoples R China
[2] Univ Montreal, Dept Comp Sci & Operat Res, Montreal, PQ H3C 3J7, Canada
关键词
deep learning; social network; influence maximization; role embedding; node role division; DIFFUSION; COMMUNITY; SYSTEMS; USERS;
D O I
10.3934/nhm.2023068
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Influence maximization (IM), a central issue in optimizing information diffusion on social platforms, aims to spread posts or comments more widely, rapidly, and efficiently. Existing studies primarily focus on the positive effects of incorporating heuristic calculations in IM approaches. However, heuristic models fail to consider the potential enhancements that can be achieved through network representation learning techniques. Some recent work is keen to use representation learning to deal with IM issues. However, few in-depth studies have explored the existing challenges in IM representation learning, specifically regarding the role characteristics and role representations. This paper highlights the potential advantages of combining heuristic computing and role embedding to solve IM problems. First, the method introduces role granularity classification to effectively categorize users into three distinct roles: opinion leaders, structural holes and normal nodes. This classification enables a deeper understanding of the dynamics of users within the network. Second, a novel role-based network embedding (RbNE) algorithm is proposed. By leveraging the concept of node roles, RbNE captures the similarity between nodes, allowing for a more accurate representation of the network structure. Finally, a superior IM approach, named RbneIM, is recommended. RbneIM combines heuristic computing and role embedding to establish a fusion-enhanced IM solution, resulting in an improved influence analysis process. Exploratory outcomes on six social network datasets indicate that the proposed approach outperforms state-of-the-art seeding algorithms in terms of maximizing influence. This finding highlights the effectiveness and efficacy of the proposed method in achieving higher levels of influence within social networks. The code is available at https://github.com/baiyazi/IM2.
引用
收藏
页码:1539 / 1574
页数:36
相关论文
共 50 条
[41]   An Approach of Cost Optimized Influence Maximization in Social Networks [J].
Talukder, Ashis ;
Alam, Md. Golam Rabiul ;
Bairagi, Anupam Kumar ;
Abedin, Sarder Fakhrul ;
Abu Layek, Md ;
Nguyen, Hoang T. ;
Hong, Choong Seon .
2017 19TH ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS 2017): MANAGING A WORLD OF THINGS, 2017, :354-357
[42]   Topic-Constrained Influence Maximization in Social Networks [J].
Manaskasemsak, Bundit ;
Phuangpanya, Rattana ;
Rungsawang, Arnon .
PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON COMMUNICATION AND INFORMATION PROCESSING (ICCIP 2017), 2017, :405-410
[43]   Trust based latency aware influence maximization in social networks [J].
Mohamadi-Baghmolaei, Rezvan ;
Mozafari, Niloofar ;
Hamzeh, Ali .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2015, 41 :195-206
[44]   Maximum likelihood-based influence maximization in social networks [J].
Liu, Wei ;
Li, Yun ;
Chen, Xin ;
He, Jie .
APPLIED INTELLIGENCE, 2020, 50 (10) :3487-3502
[45]   CoIM: Community-Based Influence Maximization in Social Networks [J].
Singh, Shashank Sheshar ;
Singh, Kuldeep ;
Kumar, Ajay ;
Biswas, Bhaskar .
ADVANCED INFORMATICS FOR COMPUTING RESEARCH, PT II, 2019, 956 :440-453
[46]   Hurst exponent based approach for influence maximization in social networks [J].
Saxena, Bhawna ;
Saxena, Vikas .
JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2022, 34 (05) :2218-2230
[47]   A Core Theory based Algorithm for Influence Maximization in Social Networks [J].
Zhang, Kan ;
Zhang, Zichao ;
Wu, Yanlei ;
Xu, Jin ;
Niu, Yunyun .
2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (CIT), 2017, :31-36
[48]   An Efficient Influence Maximization Algorithm Based on Clique in Social Networks [J].
Li, Huan ;
Zhang, Ruisheng ;
Zhao, Zhili ;
Yuan, Yongna .
IEEE ACCESS, 2019, 7 :141083-141093
[49]   Influence Maximization Based on Network Motifs in Mobile Social Networks [J].
Zhang, Xinxin ;
Xu, Li ;
Xu, Zhenyu .
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2022, 9 (04) :2353-2363
[50]   Hypergraph-Based Influence Maximization in Online Social Networks [J].
Zhang, Chuangchuang ;
Cheng, Wenlin ;
Li, Fuliang ;
Wang, Xingwei .
MATHEMATICS, 2024, 12 (17)