Efficient Detection of Hot Span in Information Diffusion from Observation

We addressed the problem of detecting the change in behavior of information diffusion from a small amount of observation data, where the behavior changes were assumed to be effectively reflected in changes in the diffusion parameter value. The problem is to detect where in time and how long this change persisted and how big this change is. We solved this problem by searching the change pattern that maximizes the likelihood of generating the observed diffusion sequences. The naive learning algorithm has to iteratively update the patten boundaries, each requiring optimization of diffusion parameters by the EM algorithm, and is very inefficient. We devised a very efficient search algorithm using the derivative of likelihood which avoids parameter value optimization during the search. The results tested using three real world network structures confirmed that the algorithm can efficiently identify the correct change pattern. We further compared our algorithm with the naive method that finds the best combination of change boundaries by an exhaustive search through a set of randomly selected boundary candidates, and showed that the proposed algorithm far outperforms the native method both in terms of accuracy and computation time.

[1]  P. Bonacich Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[2]  Masahiro Kimura,et al.  Selecting Information Diffusion Models over Social Networks for Behavioral Analysis , 2010, ECML/PKDD.

[3]  Jacob Goldenberg,et al.  Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .

[4]  Jon M. Kleinberg,et al.  Bursty and Hierarchical Structure in Streams , 2002, Data Mining and Knowledge Discovery.

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

[6]  D. Watts,et al.  Influentials, Networks, and Public Opinion Formation , 2007 .

[7]  Masahiro Kimura,et al.  Learning to Predict Opinion Share in Social Networks , 2010, AAAI.

[8]  Duncan J Watts,et al.  A simple model of global cascades on random networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Masahiro Kimura,et al.  Learning Continuous-Time Information Diffusion Model for Social Behavioral Data Analysis , 2009, ACML.

[10]  K. Meier,et al.  Influence , 2012 .

[11]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[12]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[13]  Tom A. B. Snijders,et al.  Social Network Analysis , 2011, International Encyclopedia of Statistical Science.

[14]  Stephanie Forrest,et al.  Email networks and the spread of computer viruses. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  KleinbergJon Bursty and Hierarchical Structure in Streams , 2003 .

[16]  James Allan,et al.  Automatic generation of overview timelines , 2000, SIGIR '00.

[17]  Pedro M. Domingos Mining Social Networks for Viral Marketing , 2022 .

[18]  Masahiro Kimura,et al.  Blocking links to minimize contamination spread in a social network , 2009, TKDD.

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

[20]  Masahiro Kimura,et al.  Extracting influential nodes on a social network for information diffusion , 2009, Data Mining and Knowledge Discovery.