| Summary: | Influence Maximization (IM) is a critical problem in social network analysis and marketing. It involves identifying a subset of nodes in a social network whose activation or influence can lead to the maximal spread of information, ideas, or behaviors within the network. Although many approaches have been developed in the literature to deal with this problem, most of these approaches are ineffective in dealing with large-scale social networks due to free parameters and computational complexity. Embeddings are used to learn low-dimensional representations of nodes in a social network. These embeddings capture the structural and semantic information of nodes and their relationships within the network. By training deep learning models on graph-structured data, node embeddings can capture complex patterns and dependencies in social networks, enabling more effective downstream tasks such as IM. Accordingly, this paper proposes an efficient algorithm to address the IM problem in social networks using deep learning-based Node Embedding (IMNE), which includes shell decomposition, graph/node embedding, and search space reduction as well as the use of local structural features. Our approach combines the power of deep learning for representation learning with the rich structural information present in social networks to address the challenge of IM in complex and dynamic social networks. IMNE uses the Independent Cascade (IC) information diffusion model to determine the labels needed to train the model by calculating the influence of nodes. Experimental results on several real-world networks considering different performance metrics show that IMNE performs better compared to existing baseline and state-of-the-art methods. © 2024 Elsevier B.V.
|
|---|