Learning Information Diffusion Model for Extracting Influential Nodes in a Social Network

We address the problem of ranking influential nodes in complex social networks by estimating diffusion probabilities from observed information diffusion data using the popular independent cascade (IC) model. For this purpose we formulate the likelihood for information diffusion data which is a set of time sequence data of active nodes and propose an iterative method to search for the probabilities that maximizes this likelihood. We apply this to two real world social networks in the simplest setting where the probability is uniform for all the links, and show that when there is a reasonable amount of information diffusion data, the accuracy of the probability is outstandingly good, and the proposed method can predict the high ranked influential nodes much more accurately than the well studied conventional four heuristic methods.

[1]  B Montgomery Pettitt,et al.  Coulomb blockage of hybridization in two-dimensional DNA arrays. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

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

[5]  Jure Leskovec,et al.  Patterns of Influence in a Recommendation Network , 2006, PAKDD.

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

[7]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[8]  Masahiro Kimura,et al.  Effective Visualization of Information Diffusion Process over Complex Networks , 2008, ECML/PKDD.

[9]  M. Newman,et al.  Why social networks are different from other types of networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Masahiro Kimura,et al.  Tractable Models for Information Diffusion in Social Networks , 2006, PKDD.

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

[12]  Lada A. Adamic,et al.  Tracking information epidemics in blogspace , 2005, The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05).

[13]  Jon M. Kleinberg,et al.  Group formation in large social networks: membership, growth, and evolution , 2006, KDD '06.

[14]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[15]  Michael I. Jordan,et al.  Link Analysis, Eigenvectors and Stability , 2001, IJCAI.

[16]  Masahiro Kimura,et al.  Extracting Influential Nodes for Information Diffusion on a Social Network , 2007, AAAI.

[17]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[18]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .