Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Wang, Zhibina | Chen, Xiaolianga; b; * | Li, Xianyonga | Du, Yajuna | Lan, Xiangc
Affiliations: [a] School of Computer and Software Engineering, Xihua University, Chengdu, Sichuan, China | [b] Department of Computer Science and Operations Research, University of Montreal, Montreal, QC, Canada | [c] Institute of Statistical Science, SiChuan Provincial Bureau of Statistics, Chengdu, Sichuan, China
Correspondence: [*] Corresponding author: Xiaoliang Chen, School of Computer and Software Engineering, Xihua University, Chengdu, Sichuan 610039, China. E-mail: chenxl@mail.xhu.edu.cn.
Abstract: Influence Maximization (IM), an NP-hard central issue for social network research, aims to recognize the influential nodes in a network so that the message can spread faster and more effectively. A large number of existing studies mainly focus on the heuristic methods, which generally lead to sub-optimal solutions and suffer time-consuming and inapplicability for large-scale networks. Furthermore, the present community-aware random walk to analyze IM using network representation learning considers only the node’s influence or network community structures. No research has been found that surveyed both of them. Hence, the present study is designed to solve the IM problem by introducing a novel influence network embedding (NINE) approach and a novel influence maximization algorithm, namely NineIM, based on network representation learning. First, a mechanism that can capture the diffusion behavior proximity between network nodes is constructed. Second, we consider a more realistic social behavior assumption. The probability of information dissemination between network nodes (users) is different from other random walk based network representation learning. Third, the node influence is used to define the rules of random walk and then get the embedding representation of a social network. Experiments on four real-world networks indicate that our proposed NINE method outperforms four state-of-the-art network embedding baselines. Finally, the superiority of the proposed NineIM algorithm is reported by comparing four traditional IM algorithms. The code is available at https://github.com/baiyazi/NineIM.
Keywords: Influence Maximization, heuristic algorithms, social netwrok, network representation learning
DOI: 10.3233/IDA-216149
Journal: Intelligent Data Analysis, vol. 26, no. 5, pp. 1321-1340, 2022
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl