Learning diffusion probability based on node attributes in social networks

  • Authors:
  • Kazumi Saito;Kouzou Ohara;Yuki Yamagishi;Masahiro Kimura;Hiroshi Motoda

  • Affiliations:
  • School of Administration and Informatics, University of Shizuoka, Shizuoka, Japan;Department of Integrated Information Technology, Aoyama Gakuin University, Kanagawa, Japan;School of Administration and Informatics, University of Shizuoka, Shizuoka, Japan;Department of Electronics and Informatics, Ryukoku University, Otsu, Japan;Institute of Scientific and Industrial Research, Osaka University, Ibaraki, Osaka, Japan

  • Venue:
  • ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Information diffusion over a social network is analyzed by modeling the successive interactions of neighboring nodes as probabilistic processes of state changes. We address the problem of estimating parameters (diffusion probability and time-delay parameter) of the probabilistic model as a function of the node attributes from the observed diffusion data by formulating it as the maximum likelihood problem. We show that the parameters are obtained by an iterative updating algorithm which is efficient and is guaranteed to converge. We tested the performance of the learning algorithm on three real world networks assuming the attribute dependency, and confirmed that the dependency can be correctly learned. We further show that the influence degree of each node based on the link-dependent diffusion probabilities is substantially different from that obtained assuming a uniform diffusion probability which is approximated by the average of the true link-dependent diffusion probabilities.