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 the accuracy of the probability is outstandingly good, and further show that the proposed method can predict the high ranked influential nodes much more accurately than the well studied conventional four heuristic methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adar E, Adamic L (2005) Tracking information epidemics in blogspace. In: WI'05 207–214
Albert R, Jeong H, Barabási A L (2000) Error and attack tolerance of complex networks. Nature 406:378–382.
Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. In: WWW'98 107–117
Domingos P, Richardson M (2001) Mining the network value of customers. In: KDD'01 57–66
Gruhl D, Guha R, Liben-Nowell D, Tomkins A (2004) Information diffusion through blogspace. In: WWW'04 107–117
Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: KDD'03 137–146
Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. In: PKDD'06 259–271
Kimura M, Saito K, Nakano R (2007) Extracting influential nodes for information diffusion on a social network. In: AAAI'07 1371–1376
Kimura M, Saito K, Motoda H (2008) Minimizing the spread of contamination by blocking links in a network. In: AAAI'08 1175–1180
Leskovec J, Adamic L, Huberman B A (2006) The dynamics of viral marketing. In: EC'06 228–237
Newman M E J, Forrest S, Balthrop J (2002) Email networks and the spread of computer viruses. Phys Rev E 66:035101
Ng A Y, Zheng A X, Jordan M I (2001) Link analysis, eigenvectors and stability. In: IJCAI'01 903–901
Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: KDD'02 61–70
Saito K, Nakano R, Kimura M (2008) Prediction of information diffusion probabilities for independent cascade model. In: KES'08 67–75
Wasserman S, Faust K (1994) Social network analysis. Cambridge University Press, Cambridge, UK
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
Copyright information
© 2009 Springer-Verlag US
About this paper
Cite this paper
Kimura, M., Saito, K., Nakano, R., Motoda, H. (2009). Finding Influential Nodes in a Social Network from Information Diffusion Data. In: Social Computing and Behavioral Modeling. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-0056-2_18
Download citation
DOI: https://doi.org/10.1007/978-1-4419-0056-2_18
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-0055-5
Online ISBN: 978-1-4419-0056-2
eBook Packages: Computer ScienceComputer Science (R0)