A Comprehensive Algorithm for Evaluating Node Influences in Social Networks Based on Preference Analysis and Random Walk

In the era of big data, social network has become an important reflection of human communications and interactions on the Internet. Identifying the influential spreaders in networks plays a crucial role in various areas, such as disease outbreak, virus propagation, and public opinion controlling. Based on the three basic centrality measures, a comprehensive algorithm named PARW-Rank for evaluating node influences has been proposed by applying preference relation analysis and random walk technique. For each basic measure, the preference relation between every node pair in a network is analyzed to construct the partial preference graph (PPG). Then, the comprehensive preference graph (CPG) is generated by combining the preference relations with respect to three basic measures. Finally, the ranking of nodes is determined by conducting random walk on the CPG. Furthermore, five public social networks are used for comparative analysis. The experimental results show that our PARW-Rank algorithm can achieve the higher precision and better stability than the existing methods with a single centrality measure.

[1]  Qiang Yang,et al.  EigenRank: a ranking-oriented approach to collaborative filtering , 2008, SIGIR '08.

[2]  Andrea Landherr,et al.  A Critical Review of Centrality Measures in Social Networks , 2010, Bus. Inf. Syst. Eng..

[3]  Herbert W. Hethcote,et al.  The Mathematics of Infectious Diseases , 2000, SIAM Rev..

[4]  Yong Deng,et al.  Identifying influential nodes in complex networks based on AHP , 2017 .

[5]  H. Kong.  TENCENT ANNOUNCES 2021 THIRD QUARTER RESULTS , 2008 .

[6]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[7]  Alireza Aliahmadi,et al.  Introducing a procedure for developing a novel centrality measure (Sociability Centrality) for social networks using TOPSIS method and genetic algorithm , 2016, Comput. Hum. Behav..

[8]  Dianhui Chu,et al.  Positive influence maximization in signed social networks based on simulated annealing , 2017, Neurocomputing.

[9]  Alireza Abdollahpouri,et al.  BridgeRank: A novel fast centrality measure based on local structure of the network , 2017 .

[10]  Zhilin Luo,et al.  A PageRank-Based Heuristic Algorithm for Influence Maximization in the Social Network , 2012 .

[11]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[12]  Liu Zun,et al.  Key nodes in complex networks identified by multi-attribute decision-making method , 2013 .

[13]  Alireza Aliahmadi,et al.  Optimizing the choice of influential nodes for diffusion on a social network , 2016, Int. J. Commun. Syst..

[14]  Wenxu Wang,et al.  Enhanced synchronizability by structural perturbations. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Xiaoge Zhang,et al.  A Bio-Inspired Methodology of Identifying Influential Nodes in Complex Networks , 2013, PloS one.

[16]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[17]  Xin Li,et al.  CoFIM: A community-based framework for influence maximization on large-scale networks , 2017, Knowl. Based Syst..

[18]  Kaiqi Zhang,et al.  Maximizing influence in a social network: Improved results using a genetic algorithm , 2017 .

[19]  Keyhan Khamforoosh,et al.  Influence maximization in social networks based on TOPSIS , 2018, Expert Syst. Appl..

[20]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[21]  Xiao-Long Ren,et al.  Review of ranking nodes in complex networks , 2014 .

[22]  S. Mahadevan,et al.  A new method of identifying influential nodes in complex networks based on TOPSIS , 2014 .

[23]  Sarit Kraus,et al.  Diffusion centrality: A paradigm to maximize spread in social networks , 2016, Artif. Intell..

[24]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[25]  Johan Kwisthout,et al.  Community-based influence maximization in social networks under a competitive linear threshold model , 2017, Knowl. Based Syst..

[26]  Cunlai Pu,et al.  Tunable path centrality: Quantifying the importance of paths in networks , 2014 .

[27]  Duanbing Chen,et al.  Identifying Influential Spreaders by Weighted LeaderRank , 2013, ArXiv.

[28]  Adilson E Motter,et al.  Cascade-based attacks on complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Liu Zhigang,et al.  Identifying node importance based on information entropy in complex networks , 2013 .

[30]  Katarzyna Musial,et al.  Analysis and Applications of Complex Social Networks , 2017, Complex..

[31]  Hassan Haghighi,et al.  INCIM: A community-based algorithm for influence maximization problem under the linear threshold model , 2016, Inf. Process. Manag..

[32]  Maoguo Gong,et al.  Influence maximization in social networks based on discrete particle swarm optimization , 2016, Inf. Sci..

[33]  Ming Tang,et al.  Identifying effective multiple spreaders by coloring complex networks , 2014, ArXiv.

[34]  Kan Li,et al.  Social Influence Analysis: Models, Methods, and Evaluation , 2018 .

[35]  Alireza Aliahmadi,et al.  A novel game theoretic approach for modeling competitive information diffusion in social networks with heterogeneous nodes , 2017 .

[36]  B. Annappa,et al.  Influence maximization in large social networks: Heuristics, models and parameters , 2018, Future Gener. Comput. Syst..

[37]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[38]  Lifeng Sun,et al.  Mining diversity on social media networks , 2010, Multimedia Tools and Applications.

[39]  P. Kaye.  Infectious diseases of humans: Dynamics and control , 1993 .

[40]  Sang-Wook Kim,et al.  Efficient and effective influence maximization in social networks: A hybrid-approach , 2018, Inf. Sci..

[41]  Weijia Jia,et al.  Influence analysis in social networks: A survey , 2018, J. Netw. Comput. Appl..

[42]  Alireza Aliahmadi,et al.  Identifying Key Nodes in Social Networks Using Multi-Criteria Decision-Making Tools , 2015 .

[43]  S. Chitrakala,et al.  A survey on influence spreader identification in online social network , 2016, 2016 International Conference on Information Communication and Embedded Systems (ICICES).

[44]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[45]  Leandros Tassiulas,et al.  Detecting Influential Spreaders in Complex, Dynamic Networks , 2013, Computer.

[46]  Freimut Bodendorf,et al.  Detecting opinion leaders and trends in online social networks , 2009, CIKM-SWSM.

[47]  Yi-Cheng Zhang,et al.  Leaders in Social Networks, the Delicious Case , 2011, PloS one.

[48]  R. Suganya,et al.  Data Mining Concepts and Techniques , 2010 .

[49]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[50]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[51]  Francky Trichet,et al.  Static, Dynamic and Semantic Dimensions: Towards a Multidisciplinary Approach of Social Networks Analysis , 2010, KSEM.

[52]  Sanggil Kang,et al.  Social Network Community Detection Using Agglomerative Spectral Clustering , 2017, Complex..

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

[54]  S. Mahadevan,et al.  Identifying influential nodes in weighted networks based on evidence theory , 2013 .

[55]  L. Allen.  Some discrete-time SI, SIR, and SIS epidemic models. , 1994, Mathematical biosciences.

[56]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[57]  Chao Liu,et al.  Online Social Network Emergency Public Event Information Propagation and Nonlinear Mathematical Modeling , 2017, Complex..

[58]  Mehrdad Agha Mohammad Ali Kermani,et al.  A hybrid algorithm based on community detection and multi attribute decision making for influence maximization , 2018, Comput. Ind. Eng..