InfGCN: Identifying influential nodes in complex networks with graph convolutional networks

Abstract Identifying influential nodes in a complex network is very critical as complex networks are ubiquitous. Traditional methods, such as centrality based methods and machine learning based methods, only consider either network structures or node features to evaluate the significance of nodes. However, the influential importance of nodes should be determined by both network structures and node features. To solve this problem, this paper proposes a deep learning model, named InfGCN, to identify the most influential nodes in a complex network based on Graph Convolutional Networks. InfGCN takes neighbor graphs and four classic structural features as the input into a graph convolutional network for learning nodes’ representations, and then feeds the representations into the task-learning layers, comparing the ground truth derived from Susceptible Infected Recovered (SIR) simulation experiments with quantitative infection rate. Extensive experiments on five real-world networks of different types and sizes demonstrate that the proposed model significantly outperforms traditional methods, and can accurately identify influential nodes.

[1]  S. L. Wong,et al.  Towards a proteome-scale map of the human protein–protein interaction network , 2005, Nature.

[2]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[3]  Joan Bruna,et al.  Deep Convolutional Networks on Graph-Structured Data , 2015, ArXiv.

[4]  Xiang-Yang Li,et al.  Ranking of Closeness Centrality for Large-Scale Social Networks , 2008, FAW.

[5]  Phillip Bonacich,et al.  Some unique properties of eigenvector centrality , 2007, Soc. Networks.

[6]  Nitish Srivastava,et al.  Improving neural networks by preventing co-adaptation of feature detectors , 2012, ArXiv.

[7]  Shulin Wang,et al.  Feature selection in machine learning: A new perspective , 2018, Neurocomputing.

[8]  Jimmy Ba,et al.  Adam: A Method for Stochastic Optimization , 2014, ICLR.

[9]  Jian Sun,et al.  Deep Residual Learning for Image Recognition , 2015, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[10]  Thomas Lux,et al.  Worrying trends in econophysics , 2006 .

[11]  Yuxiao Dong,et al.  DeepInf: Social Influence Prediction with Deep Learning , 2018, KDD.

[12]  Ioannis Korkontzelos,et al.  Detection of spam-posting accounts on Twitter , 2018, Neurocomputing.

[13]  Martin G. Everett,et al.  Models of core/periphery structures , 2000, Soc. Networks.

[14]  Alessandro Flammini,et al.  Rich-club ordering in complex networks , 2007 .

[15]  Mei Xie,et al.  Identifying critical nodes in complex networks via graph convolutional networks , 2020, Knowl. Based Syst..

[16]  Xiaohui Zhao,et al.  Evaluating Influential Nodes in Social Networks by Local Centrality with a Coefficient , 2017, ISPRS Int. J. Geo Inf..

[17]  Ernesto Estrada Virtual identification of essential proteins within the protein interaction network of yeast , 2005, Proteomics.

[18]  Zheyi Chen,et al.  Detecting spammers on social networks , 2015, Neurocomputing.

[19]  Elsa-Sofia Morote,et al.  Predicting career advancement with structural equation modelling , 2012 .

[20]  Duanbing Chen,et al.  Influential Nodes Identification in Complex Networks via Information Entropy , 2020, Entropy.

[21]  Chih-Jen Lin,et al.  LIBLINEAR: A Library for Large Linear Classification , 2008, J. Mach. Learn. Res..

[22]  Mei Xie,et al.  Identifying influential spreaders in complex networks by propagation probability dynamics. , 2019, Chaos.

[23]  Song-Chun Zhu,et al.  Learning Human-Object Interactions by Graph Parsing Neural Networks , 2018, ECCV.

[24]  Z. Di,et al.  Clustering coefficient and community structure of bipartite networks , 2007, 0710.0117.

[25]  Jason R. C. Nurse,et al.  Identifying Key-Players in Online Activist Groups on the Facebook Social Network , 2015, 2015 IEEE International Conference on Data Mining Workshop (ICDMW).

[26]  Jure Leskovec,et al.  Representation Learning on Graphs: Methods and Applications , 2017, IEEE Data Eng. Bull..

[27]  Ellen M. Voorhees,et al.  Retrieval evaluation with incomplete information , 2004, SIGIR '04.

[28]  Liang Liu,et al.  Modeling and analyzing malware propagation in social networks with heterogeneous infection rates , 2018, Physica A: Statistical Mechanics and its Applications.

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

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

[31]  Qiang Yang,et al.  A Survey on Transfer Learning , 2010, IEEE Transactions on Knowledge and Data Engineering.

[32]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[33]  W. O. Kermack,et al.  A contribution to the mathematical theory of epidemics , 1927 .

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