IM-ELPR: Influence maximization in social networks using label propagation based community structure

摘要

The popularity of social networks has grown manifolds in recent years because of various activities like fast propagation of ideas, publicity, and news. Influence maximization (IM) is one of the most highly studied problems in the field of social network analysis due to its business values. Influence maximization aims to identify influential nodes that can spread the information to the maximum number of nodes in the network through diffusion cascade. Traditional methods for IM include centrality based and greedy based measures. However, each method has some limitations. Recently, some methods of IM are introduced, which consider the presence of community structure in networks. Community structure has a significant impact on information diffusion, because of dense connections between the nodes in the community. In this paper, we propose a novel influence maximization algorithm using node seeding, label propagation, and community detection. We first use extended h-index centrality to detect the seed nodes and then use the label propagation technique to detect communities. Further, we merge smaller and related communities to a larger community with the help of a relationship matrix. Finally, top-k influential nodes from these communities are identified. These ideas lead to our proposed algorithm: Influence Maximization using Extended h-index, and Label Propagation with Relationship matrix (IM-ELPR). We adopt Independent Cascade (IC) information diffusion model to spread the information originating from chosen influential nodes. The proposed algorithm intends to identify influential nodes from different communities globally and does not depend on the specific community’s antecedent structural information. Experimental results performed on several real-life data sets reveal that the proposed algorithm performs better than many other existing popular algorithms.