A Preference Random Walk Algorithm for Link Prediction through Mutual Influence Nodes in Complex Networks

Predicting links in complex networks has been one of the essential topics within the realm of data mining and science discovery over the past few years. This problem remains an attempt to identify future, deleted, and redundant links using the existing links in a graph. Local random walk is considered to be one of the most well-known algorithms in the category of quasi-local methods. It traverses the network using the traditional random walk with a limited number of steps, randomly selecting one adjacent node in each step among the nodes which have equal importance. Then this method uses the transition probability between node pairs to calculate the similarity between them. However, in most datasets, this method is not able to perform accurately in scoring remarkably similar nodes. In the present article, an efficient method is proposed for improving local random walk by encouraging random walk to move, in every step, towards the node which has a stronger influence. Therefore, the next node is selected according to the influence of the source node. To do so, using mutual information, the concept of the asymmetric mutual influence of nodes is presented. A comparison between the proposed method and other similarity-based methods (local, quasi-local, and global) has been performed, and results have been reported for 11 real-world networks. It had a higher prediction accuracy compared with other link prediction approaches.

[1]  Asgarali Bouyer,et al.  LP-LPA: A link influence-based label propagation algorithm for discovering community structures in networks , 2017 .

[2]  T. Zhou,et al.  Effective and Efficient Similarity Index for Link Prediction of Complex Networks , 2009, 0905.3558.

[3]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[4]  Wiley Interscience.  Journal of the American Society for Information Science and Technology , 2013 .

[5]  Steven Skiena,et al.  DeepWalk: online learning of social representations , 2014, KDD.

[6]  Asgarali Bouyer,et al.  A node representation learning approach for link prediction in social networks using game theory and K-core decomposition , 2019, The European Physical Journal B.

[7]  Mahdi Vasighi,et al.  Community Detection in Complex Networks by Detecting and Expanding Core Nodes Through Extended Local Similarity of Nodes , 2018, IEEE Transactions on Computational Social Systems.

[8]  Lada A. Adamic,et al.  Friends and neighbors on the Web , 2003, Soc. Networks.

[9]  T. Sørensen,et al.  A method of establishing group of equal amplitude in plant sociobiology based on similarity of species content and its application to analyses of the vegetation on Danish commons , 1948 .

[10]  Fernando Berzal Galiano,et al.  A Survey of Link Prediction in Complex Networks , 2016, ACM Comput. Surv..

[11]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[13]  J. Coleman,et al.  The Diffusion of an Innovation Among Physicians , 1957 .

[14]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

[15]  Ryan A. Rossi,et al.  The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.

[16]  Bhaskar Biswas,et al.  Link prediction techniques, applications, and performance: A survey , 2020 .

[17]  Fan Yang,et al.  Link prediction in complex networks based on the interactions among paths , 2018, Physica A: Statistical Mechanics and its Applications.

[18]  D. Bu,et al.  Topological structure analysis of the protein-protein interaction network in budding yeast. , 2003, Nucleic acids research.

[19]  Christos Faloutsos,et al.  Fast Random Walk with Restart and Its Applications , 2006, Sixth International Conference on Data Mining (ICDM'06).

[20]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[21]  Jing Wang,et al.  Link prediction with node clustering coefficient , 2015, 1510.07819.

[22]  Peng Wang,et al.  Link prediction in social networks: the state-of-the-art , 2014, Science China Information Sciences.

[23]  M. Newman,et al.  Hierarchical structure and the prediction of missing links in networks , 2008, Nature.

[24]  Negin Samadi,et al.  Effect of rich-club on diffusion in complex networks , 2018 .

[25]  Linyuan Lu,et al.  Link Prediction in Complex Networks: A Survey , 2010, ArXiv.

[26]  Carlos Melián,et al.  FOOD WEB COHESION , 2004 .

[27]  Albert Y. Zomaya,et al.  A Survey of Mobile Device Virtualization , 2016, ACM Comput. Surv..

[28]  Gobinda G. Chowdhury,et al.  Introduction to Modern Information Retrieval , 1999 .

[29]  Jianhang Liu,et al.  Relative-path-based algorithm for link prediction on complex networks using a basic similarity factor. , 2020, Chaos.

[30]  Aram Galstyan,et al.  Statistical Tests for Contagion in Observational Social Network Studies , 2012, AISTATS.

[31]  Edoardo M. Airoldi,et al.  Mixed Membership Stochastic Blockmodels , 2007, NIPS.

[32]  Marco Gori,et al.  ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines , 2007, IJCAI.

[33]  Negin Samadi,et al.  A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks , 2018 .

[34]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[35]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[36]  Linyuan Lu,et al.  Link prediction based on local random walk , 2010, 1001.2467.

[37]  Manuel Curado,et al.  Return random walks for link prediction , 2020, Inf. Sci..

[38]  Linyuan Lü,et al.  Predicting missing links via local information , 2009, 0901.0553.

[39]  Feng Xia,et al.  Random Walks: A Review of Algorithms and Applications , 2020, IEEE Transactions on Emerging Topics in Computational Intelligence.

[40]  Timothy Ravasi,et al.  From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks , 2013, Scientific Reports.

[41]  Xingyi Zhang,et al.  A seed-expanding method based on random walks for community detection in networks with ambiguous community structures , 2017, Scientific Reports.

[42]  Hui Tian,et al.  Predicting missing links via effective paths , 2014 .

[43]  Filippo Menczer,et al.  Erratum: Competition among memes in a world with limited attention , 2013, Scientific Reports.

[44]  Bao-qun Yin,et al.  Power-law strength-degree correlation from resource-allocation dynamics on weighted networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[45]  Huaiyu Wan,et al.  Predicting top-L missing links with node and link clustering information in large-scale networks , 2016 .

[46]  Jure Leskovec,et al.  node2vec: Scalable Feature Learning for Networks , 2016, KDD.

[47]  Negin Samadi,et al.  A new local and multidimensional ranking measure to detect spreaders in social networks , 2018, Computing.

[48]  Hui Chen,et al.  A literature survey on smart cities , 2015, Science China Information Sciences.

[49]  Yuefeng Li,et al.  A new attributed graph clustering by using label propagation in complex networks , 2020, J. King Saud Univ. Comput. Inf. Sci..

[50]  M. Newman.  Clustering and preferential attachment in growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[51]  Hui Tian,et al.  Predicting missing links via significant paths , 2014, ArXiv.

[52]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[53]  Jing Shen,et al.  General link prediction with influential node identification , 2019, Physica A: Statistical Mechanics and its Applications.

[54]  Mason A. Porter,et al.  Random walks and diffusion on networks , 2016, ArXiv.

[55]  Li Ning,et al.  Optimizing the Constrained Estimate of Random Walks , 2018, IEEE Access.

[56]  Ye Yuan,et al.  Link prediction via linear optimization , 2018, Physica A: Statistical Mechanics and its Applications.

[57]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[58]  M. Newman,et al.  Vertex similarity in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[59]  Diana L. MacLean,et al.  All Friends are Not Equal : Using Weights in Social Graphs to Improve Search , 2010 .