Social network node influence maximization method combined with degree discount and local node optimization

For the problem of maximizing the influence of nodes in traditional social networks, it is impossible to select nodes and spread the scope of large-scale diffusion simultaneously. Based on local node optimization and degree discount, a new node influence maximization algorithm is proposed (degree discount and local improvement method, DLIM). Firstly, the candidate seed set is optimized. The NAV (Node Approximate Influence Value) function is constructed to calculate the Influence Value of local Node. Determine nodes with similar influence value and select the source node; the similarity method is used to filter and delete nodes with similar influence value. Secondly, a node activation algorithm is proposed to filter candidate nodes with the idea of degree discount. DMAP (degree discount and maximum activation probability) is constructed. The function uses the filtered candidate nodes for global diffusion. Finally, the proposed DLIM algorithm is used to select the seed nodes to optimize the nodes, and the independent cascade propagation model is used to conduct comparative analysis experiments on four real data sets of Wiki-Vote, NetHEPT, NetPHY, and GrQc four real datasets, and with the Independent Cascade (IC). A comparative analysis experiment is carried out on the propagation model. The experimental results show that: the proposed DLIM algorithm improves the propagation range by 11.3% compared with the traditional degree discount algorithm. The time efficiency is four orders of magnitude faster than the traditional degree discount algorithm. The proposed DLIM algorithm is reasonable and effective. It can also be applied in network marketing, product recommendation, and other fields.

[1]  Sancheng Peng,et al.  Smartphone Malware and Its Propagation Modeling: A Survey , 2014, IEEE Communications Surveys & Tutorials.

[2]  Jeffrey Shaman,et al.  Collective influence maximization in threshold models of information cascading with first-order transitions , 2016, ArXiv.

[3]  Xingshe Zhou,et al.  Predicting the content dissemination trends by repost behavior modeling in mobile social networks , 2014, J. Netw. Comput. Appl..

[4]  Jiguo Yu,et al.  Interaction-aware influence maximization and iterated sandwich method , 2020, Theor. Comput. Sci..

[5]  Hongyan Li,et al.  Semantics-aware influence maximization in social networks , 2020, Inf. Sci..

[6]  Xuemin Lin,et al.  Bring Order into the Samples: A Novel Scalable Method for Influence Maximization (Extended Abstract) , 2017, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).

[7]  Qinghua Zheng,et al.  Analyzing and modeling dynamics of information diffusion in microblogging social network , 2017, J. Netw. Comput. Appl..

[8]  Francisco Aparecido Rodrigues,et al.  Influence maximization by rumor spreading on correlated networks through community identification , 2020, Commun. Nonlinear Sci. Numer. Simul..

[9]  Enrique Herrera-Viedma,et al.  An incremental method to detect communities in dynamic evolving social networks , 2019, Knowl. Based Syst..

[10]  Enhong Chen,et al.  Activity Maximization by Effective Information Diffusion in Social Networks , 2016, IEEE Transactions on Knowledge and Data Engineering.

[11]  Jacob Goldenberg,et al.  Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .

[12]  Yicheng Zhang,et al.  Identifying influential nodes in complex networks , 2012 .

[13]  Yuchen Li,et al.  Influence Maximization on Social Graphs: A Survey , 2018, IEEE Transactions on Knowledge and Data Engineering.

[14]  Laizhong Cui,et al.  DDSE: A novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks , 2018, J. Netw. Comput. Appl..

[15]  Ke Yang,et al.  Using hybrid normalization technique and state transition algorithm to VIKOR method for influence maximization problem , 2020, Neurocomputing.

[16]  Feng Xia,et al.  Community-diversified influence maximization in social networks , 2020, Inf. Syst..

[17]  Heba Kurdi,et al.  A Modified Degree Discount Heuristic for Influence Maximization in Social Networks , 2020, ANT/EDI40.

[18]  Kai Han,et al.  Efficient Algorithms for Adaptive Influence Maximization , 2018, Proc. VLDB Endow..

[19]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  William Nick Street,et al.  Modeling and maximizing influence diffusion in social networks for viral marketing , 2018, Applied Network Science.

[21]  Liqing Qiu,et al.  LGIM: A Global Selection Algorithm Based on Local Influence for Influence Maximization in Social Networks , 2020, IEEE Access.