Q Duong, MP Wellman, and S Singh
Third IEEE International Conference on Social Computing (SocialCom-11), Cambridge, MA, October 2011.
Modeling information diffusion in networks enables reasoning about the spread of ideas, news, opinion, and technology across a network of agents. Existing models generally assume a given network structure, in practice derived from observations of agent communication or other interactions. In many realistic settings, however, observing all connections is not feasible. We consider the problem of modeling information diffusion when the network is only partially observed, and investigate two approaches. The first learns graphical model potentials for a given network structure, compensating for missing edges through induced correlations among node states. The second attempts to learn the missing connections directly. Using data generated from a cascade model with different network structures, we empirically demonstrate that both methods improve over assuming the given network is fully observed, as well as a previously proposed structure-learning technique. We further find that potential learning outperforms structure learning when given sufficient data.
Previous version presented at the Fifth SNA-KDD Workshop on Social Network Mining and Analysis, August 2011.