Not Enough Data?: Joint Inferring Multiple Diffusion Networks via Network Generation Priors

Network Inference, i.e., discovering latent diffusion networks from observed cascades, has been studied extensively in recent years, leading to a series of excellent work. However, it has been observed that the accuracy of existing methods deteriorates significantly when the number of cascades are limited (compared with the large number of nodes), which is the norm in real world applications. Meanwhile, we are able to collect cascades on many different topics or over a long time period: the associated influence networks (either topic-specific or time-specific) are highly correlated while the number of cascade observations associated with each network is very limited. In this work, we propose a generative model, referred to as the MultiCascades model (MCM), to address the challenge of data scarcity by exploring the commonality between multiple related diffusion networks. MCM builds a hierarchical graphical model, where all the diffusion networks share the same network prior, e.g., the popular Stochastic Blockmodels or the latent space models. The parameters of the network priors can be effectively learned by gleaning evidence from a large number of inferred networks. In return, each individual network can be inferred more accurately thanks to the prior information. Furthermore, we develop efficient inference and learning algorithms so that MCM is scalable for practical applications. The results on both synthetic datasets and real-world datasets demonstrate that MCM infers both topic-specific and time-varying diffusion networks more accurately.

[1]  Le Song,et al.  Learning Networks of Heterogeneous Influence , 2012, NIPS.

[2]  Jure Leskovec,et al.  On the Convexity of Latent Social Network Inference , 2010, NIPS.

[3]  Sujay Sanghavi,et al.  Learning the graph of epidemic cascades , 2012, SIGMETRICS '12.

[4]  Peter D. Hoff,et al.  Latent Space Approaches to Social Network Analysis , 2002 .

[5]  James R. Foulds,et al.  HawkesTopic: A Joint Model for Network Inference and Topic Modeling from Text-Based Cascades , 2015, ICML.

[6]  Divesh Srivastava,et al.  Truth Discovery and Copying Detection in a Dynamic World , 2009, Proc. VLDB Endow..

[7]  Christos Faloutsos,et al.  Kronecker Graphs: An Approach to Modeling Networks , 2008, J. Mach. Learn. Res..

[8]  Eytan Adar,et al.  Implicit Structure and the Dynamics of Blogspace , 2004 .

[9]  Zhoujun Li,et al.  Diabetes-Associated Factors as Predictors of Nursing Home Admission and Costs in the Elderly Across Europe. , 2017, Journal of the American Medical Directors Association.

[10]  Ramanathan V. Guha,et al.  Information diffusion through blogspace , 2004, WWW '04.

[11]  Jure Leskovec,et al.  The dynamics of viral marketing , 2005, EC '06.

[12]  Jure Leskovec,et al.  Inferring networks of diffusion and influence , 2010, KDD.

[13]  Geoffrey E. Hinton,et al.  A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants , 1998, Learning in Graphical Models.

[14]  Le Song,et al.  Learning Social Infectivity in Sparse Low-rank Networks Using Multi-dimensional Hawkes Processes , 2013, AISTATS.

[15]  Jure Leskovec,et al.  Meme-tracking and the dynamics of the news cycle , 2009, KDD.

[16]  Shuang-Hong Yang,et al.  Mixture of Mutually Exciting Processes for Viral Diffusion , 2013, ICML.

[17]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[18]  Le Song,et al.  Uncover Topic-Sensitive Information Diffusion Networks , 2013, AISTATS.

[19]  Eric P. Xing,et al.  Fast structure learning in generalized stochastic processes with latent factors , 2013, KDD.

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

[21]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[22]  Bernhard Scholkopf,et al.  Submodular Inference of Diffusion Networks from Multiple Trees , 2012, ICML.

[23]  Bernhard Schölkopf,et al.  Uncovering the Temporal Dynamics of Diffusion Networks , 2011, ICML.

[24]  Tomoharu Iwata,et al.  Probabilistic latent network visualization: inferring and embedding diffusion networks , 2014, KDD.

[25]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[26]  Bernhard Schölkopf,et al.  Modeling Information Propagation with Survival Theory , 2013, ICML.

[27]  Le Song,et al.  Estimating Diffusion Network Structures: Recovery Conditions, Sample Complexity & Soft-thresholding Algorithm , 2014, ICML.

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

[29]  Joseph Naor,et al.  Submodular Maximization with Cardinality Constraints , 2014, SODA.