Multi-Layer Graph Analysis for Dynamic Social Networks

Modern social networks frequently encompass multiple distinct types of connectivity information; for instance, explicitly acknowledged friend relationships might complement behavioral measures that link users according to their actions or interests. One way to represent these networks is as multi-layer graphs, where each layer contains a unique set of edges over the same underlying vertices (users). Edges in different layers typically have related but distinct semantics; depending on the application multiple layers might be used to reduce noise through averaging, to perform multifaceted analyses, or a combination of the two. However, it is not obvious how to extend standard graph analysis techniques to the multi-layer setting in a flexible way. In this paper we develop latent variable models and methods for mining multi-layer networks for connectivity patterns based on noisy data.

[1]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[2]  Alfred O. Hero,et al.  Multicriteria Gene Screening for Analysis of Differential Expression with DNA Microarrays , 2004, EURASIP J. Adv. Signal Process..

[3]  Marc Barthelemy,et al.  Growing multiplex networks , 2013, Physical review letters.

[4]  Yaochu Jin,et al.  Multi-Objective Machine Learning , 2006, Studies in Computational Intelligence.

[5]  M. Ehrgott.  Multiobjective Optimization , 2008, AI Mag..

[6]  A. Raftery.  Bayesian Model Selection in Social Research , 1995 .

[7]  Alfred O. Hero,et al.  Multi-objective Optimization for Multi-level Networks , 2014, SBP.

[8]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[10]  Alfred O. Hero,et al.  Dynamic Stochastic Blockmodels: Statistical Models for Time-Evolving Networks , 2013, SBP.

[11]  Le Song,et al.  Evolving Cluster Mixed-Membership Blockmodel for Time-Evolving Networks , 2011, AISTATS.

[12]  Alfred O. Hero,et al.  Adaptive evolutionary clustering , 2011, Data Mining and Knowledge Discovery.

[13]  Vito Latora,et al.  Metrics for the analysis of multiplex networks , 2013, ArXiv.

[14]  Rafael Morales Bueno,et al.  TF-SIDF: Term frequency, sketched inverse document frequency , 2011, 2011 11th International Conference on Intelligent Systems Design and Applications.

[15]  Yuchung J. Wang,et al.  Stochastic Blockmodels for Directed Graphs , 1987 .

[16]  Yihong Gong,et al.  Detecting communities and their evolutions in dynamic social networks—a Bayesian approach , 2011, Machine Learning.

[17]  G. Bianconi.  Statistical mechanics of multiplex networks: entropy and overlap. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Marián Boguñá,et al.  Epidemic spreading on interconnected networks , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  M.A. El-Sharkawi,et al.  Pareto Multi Objective Optimization , 2005, Proceedings of the 13th International Conference on, Intelligent Systems Application to Power Systems.

[20]  Cécile Favre,et al.  Information diffusion in online social networks: a survey , 2013, SGMD.

[21]  Alfred O. Hero,et al.  Pareto-Optimal Methods for Gene Ranking , 2004, J. VLSI Signal Process..

[22]  M. Cugmas,et al.  On comparing partitions , 2015 .

[23]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

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

[25]  Kim Fung Man,et al.  Multiobjective Optimization , 2011, IEEE Microwave Magazine.

[26]  Alfred O. Hero,et al.  Multi-criteria Anomaly Detection using Pareto Depth Analysis , 2011, NIPS.

[27]  A. M. Geoffrion.  Proper efficiency and the theory of vector maximization , 1968 .