Motif-aware diffusion network inference

Characterizing and understanding information diffusion over social networks play an important role in various real-world applications. In many scenarios, however, only the states of nodes can be observed while the underlying diffusion networks are unknown. Many methods have therefore been proposed to infer the underlying networks based on node observations. To enhance the inference performance, structural priors of the networks, such as sparsity, scale-free, and community structures, are often incorporated into the learning procedure. As the building blocks of networks, network motifs occur frequently in many social networks, and play an essential role in describing the network structures and functionalities. However, to the best of our knowledge, no existing work exploits this kind of structural primitives in diffusion network inference. In order to address this unexplored yet important issue, in this paper, we propose a novel framework called Motif-Aware Diffusion Network Inference (MADNI), which aims to mine the motif profile from the node observations and infer the underlying network based on the mined motif profile. The mined motif profile and the inferred network are alternately refined until the learning procedure converges. Extensive experiments on both synthetic and real-world datasets validate the effectiveness of the proposed framework.

[1]  Hongyuan Zha,et al.  Back to the Past: Source Identification in Diffusion Networks from Partially Observed Cascades , 2015, AISTATS.

[2]  Stratis Ioannidis,et al.  Adding Structure: Social Network Inference with Graph Priors , 2016, KDD 2016.

[3]  Sach Mukherjee,et al.  Network inference using informative priors , 2008, Proceedings of the National Academy of Sciences.

[4]  S. Shen-Orr,et al.  Superfamilies of Evolved and Designed Networks , 2004, Science.

[5]  U. Alon Network motifs: theory and experimental approaches , 2007, Nature Reviews Genetics.

[6]  Philip S. Yu,et al.  Clustering Embedded Approaches for Efficient Information Network Inference , 2015, Data Science and Engineering.

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

[8]  Yan Liu,et al.  Not Enough Data?: Joint Inferring Multiple Diffusion Networks via Network Generation Priors , 2017, WSDM.

[9]  Hong Cheng,et al.  A Model-Free Approach to Infer the Diffusion Network from Event Cascade , 2016, CIKM.

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

[11]  Qiang Liu,et al.  Learning Scale Free Networks by Reweighted L1 regularization , 2011, AISTATS.

[12]  Jure Leskovec,et al.  Higher-order organization of complex networks , 2016, Science.

[13]  Su-In Lee,et al.  Learning Sparse Gaussian Graphical Models with Overlapping Blocks , 2016, NIPS.

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

[15]  Kai Liu,et al.  Detecting multiple stochastic network motifs in network data , 2012, Knowledge and Information Systems.

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

[17]  U. Alon,et al.  The incoherent feedforward loop can provide fold-change detection in gene regulation. , 2009, Molecular cell.

[18]  Bernhard Schölkopf,et al.  Structure and dynamics of information pathways in online media , 2012, WSDM.

[19]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[20]  Jinbo Xu,et al.  Learning Scale-Free Networks by Dynamic Node Specific Degree Prior , 2015, ICML.