Influence maximization in social networks using role-based embedding
-
Published:2023
Issue:4
Volume:18
Page:1539-1574
-
ISSN:1556-1801
-
Container-title:Networks and Heterogeneous Media
-
language:
-
Short-container-title:NHM
Author:
Gu Xu1, Wang Zhibin1, Chen Xiaoliang12, Lu Peng2, Du Yajun1, Tang Mingwei1
Affiliation:
1. School of Computer and Software Engineering, Xihua University, Chengdu, 610039, China 2. Department of Computer Science and Operations Research, University of Montreal, Montreal, QC H3C3J7, Canada
Abstract
<abstract><p>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 <ext-link ext-link-type="uri" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://github.com/baiyazi/IM2">https://github.com/baiyazi/IM2</ext-link>.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Computer Science Applications,General Engineering,Statistics and Probability
Reference54 articles.
1. J. Gu, G. Li, N. D. Vo, J. J. Jung, Contextual Word2Vec model for understanding chinese out of vocabularies on online social media, Int. J. Semant. Web. Inf. Syst., 18 (2022), 1–14. https://doi.org/10.4018/ijswis.309428 2. G. Manal, Social media data for the conservation of historic urban landscapes: Prospects and challenges, in Culture and Computing. Design Thinking and Cultural Computing (eds. M. Rauterberg), Springer, (2021), 209–223. https://doi.org/10.1007/978-3-030-77431-8_13 3. J. Zhao, L. Yang, X. Yang, Maximum profit of viral marketing: An optimal control approach, in Proceedings of the 2019 4th International Conference on Mathematics and Artificial Intelligence, Association for Computing Machinery, (2019), 209–214. https://doi.org/10.1145/3325730.3325767 4. D. Pedro, R. Matt, Mining the network value of customers, in Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, Association for Computing Machinery, (2001), 57–66. https://doi.org/10.1145/502512.502525 5. X. Song, B. L. Tseng, C. Lin, M. Sun, Personalized recommendation driven by information flow, in Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, Association for Computing Machinery, (2006), 509–516. https://doi.org/10.1145/1148170.1148258
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|