Advertisement
Published in:
2006 | OriginalPaper | Chapter
Tractable Models for Information Diffusion in Social Networks
Authors : Masahiro Kimura, Kazumi Saito
Published in: Knowledge Discovery in Databases: PKDD 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
When we consider the problem of finding influential nodes for information diffusion in a large-scale social network based on the
Independent Cascade Model (ICM)
, we need to compute the expected number of nodes influenced by a given set of nodes. However, a good estimate of this quantity needs a large amount of computation in the ICM. In this paper, we propose two natural special cases of the ICM such that a good estimate of this quantity can be efficiently computed. Using real large-scale social networks, we experimentally demonstrate that for extracting influential nodes, the proposed models can provide novel ranking methods that are different from the ICM, typical methods of social network analysis, and “PageRank” method. Moreover, we experimentally demonstrate that when the propagation probabilities through links are small, they can give good approximations to the ICM for finding sets of influential nodes.