A Robust Method for Inferring Network Structures

Inferring the network structure from limited observable data is significant in molecular biology, communication and many other areas. It is challenging, primarily because the observable data are sparse, finite and noisy. The development of machine learning and network structure study provides a great chance to solve the problem. In this paper, we propose an iterative smoothing algorithm with structure sparsity (ISSS) method. The elastic penalty in the model is introduced for the sparse solution, identifying group features and avoiding over-fitting, and the total variation (TV) penalty in the model can effectively utilize the structure information to identify the neighborhood of the vertices. Due to the non-smoothness of the elastic and structural TV penalties, an efficient algorithm with the Nesterov’s smoothing optimization technique is proposed to solve the non-smooth problem. The experimental results on both synthetic and real-world networks show that the proposed model is robust against insufficient data and high noise. In addition, we investigate many factors that play important roles in identifying the performance of ISSS.

[1]  Gábor Csárdi,et al.  The igraph software package for complex network research , 2006 .

[2]  Philip S. Yu,et al.  Integrated Anchor and Social Link Predictions across Social Networks , 2015, IJCAI.

[3]  Yang Gao,et al.  Adequate is better: particle swarm optimization with limited-information , 2015, Appl. Math. Comput..

[4]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[5]  Marc Timme,et al.  Revealing network connectivity from response dynamics. , 2006, Physical review letters.

[6]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[7]  T. Sauer,et al.  Reconstructing the topology of sparsely connected dynamical networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Ying-Cheng Lai,et al.  Reconstructing direct and indirect interactions in networked public goods game , 2016, Scientific Reports.

[9]  E. Duchesnay,et al.  Supplement to " An Iterative Smoothing Algorithm for Regression with Structured Sparsity " , 2016 .

[10]  Danah Boyd,et al.  Social Network Sites: Definition, History, and Scholarship , 2007, J. Comput. Mediat. Commun..

[11]  Attila Szolnoki,et al.  Competition of tolerant strategies in the spatial public goods game , 2016, 1607.08600.

[12]  Edward R. Dougherty,et al.  Inference of Gene Regulatory Networks using S-System: A Unified Approach , 2007 .

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

[14]  W. DeKeseredy,et al.  Future directions , 2005, Psychiatric Quarterly.

[15]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[16]  J. Frédéric Bonnans,et al.  Numerical Optimization: Theoretical and Practical Aspects (Universitext) , 2006 .

[17]  Jean Charles Gilbert,et al.  Numerical Optimization: Theoretical and Practical Aspects , 2003 .

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

[19]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[20]  Yin Zhong,et al.  Extended s-wave pairing symmetry on the triangular lattice heavy fermion system , 2015 .

[21]  Byung-Seo Kim,et al.  Design of MAC Layer Resource Allocation Schemes for IEEE 802.11ax: Future Directions , 2018 .

[22]  R. Albert.  Network Inference, Analysis, and Modeling in Systems Biology , 2007, The Plant Cell Online.

[23]  Yurii Nesterov,et al.  Excessive Gap Technique in Nonsmooth Convex Minimization , 2005, SIAM J. Optim..

[24]  Muriel Médard,et al.  Network deconvolution as a general method to distinguish direct dependencies in networks , 2013, Nature Biotechnology.

[25]  J Kurths,et al.  Inner composition alignment for inferring directed networks from short time series. , 2011, Physical review letters.

[26]  Gergely Zahoránszky-Kőhalmi,et al.  Network inference driven drug discovery , 2016 .

[27]  Peng Gang Sun,et al.  Controllability and modularity of complex networks , 2015, Inf. Sci..

[28]  Hans J. Herrmann,et al.  Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.

[29]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[30]  Jorge Nocedal,et al.  On the limited memory BFGS method for large scale optimization , 1989, Math. Program..

[31]  Zhoujun Li,et al.  Improving the Robustness of Complex Networks with Preserving Community Structure , 2015, PloS one.

[32]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .

[33]  Philip S. Yu,et al.  Learning Entity Types from Query Logs via Graph-Based Modeling , 2015, CIKM.

[34]  Viv Bewick,et al.  Statistics review 13: Receiver operating characteristic curves , 2004, Critical care.

[35]  B. Bollobás.  The evolution of random graphs , 1984 .

[36]  I. Daubechies,et al.  An iterative thresholding algorithm for linear inverse problems with a sparsity constraint , 2003, math/0307152.

[37]  Yang Gao,et al.  Selectively-informed particle swarm optimization , 2015, Scientific Reports.

[38]  Ji-Zhong Shen,et al.  A Graph Route-Based Superframe Scheduling Scheme in WirelessHART Mesh Networks for High Robustness , 2013, Wirel. Pers. Commun..

[39]  Lin Wang,et al.  Evolutionary games on multilayer networks: a colloquium , 2015, The European Physical Journal B.

[40]  Antonin Chambolle,et al.  A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging , 2011, Journal of Mathematical Imaging and Vision.

[41]  Chen Zhao,et al.  Analysis of the Chinese Airline Network as multi-layer networks , 2016 .

[42]  McCarthyEd,et al.  A Unified Approach , 2005 .

[43]  J. Piatt,et al.  Receiver-operating characteristic curves. , 2001, Journal of neurosurgery.

[44]  Zhong-Ke Gao,et al.  Multi-frequency complex network from time series for uncovering oil-water flow structure , 2015, Scientific Reports.

[45]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

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

[47]  M. Fukushima,et al.  A modified BFGS method and its global convergence in nonconvex minimization , 2001 .

[48]  Attila Szolnoki,et al.  Different perceptions of social dilemmas: Evolutionary multigames in structured populations , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[49]  Diogo M. Camacho,et al.  Wisdom of crowds for robust gene network inference , 2012, Nature Methods.

[50]  Xiao Han,et al.  Robust Reconstruction of Complex Networks from Sparse Data , 2015, Physical review letters.

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

[52]  Jes'us G'omez-Gardenes,et al.  The Ultimatum Game in complex networks , 2008, 0807.0750.