Maximizing the spread of influence ranking in social networks

Abstract Information flows in a network where individuals influence each other. In this paper, we study the influence maximization problem of finding a small subset of nodes in a social network that could maximize the spread of influence. We propose a novel information diffusion model CTMC - ICM , which introduces the theory of Continuous-Time Markov Chain (CTMC) into the Independent Cascade Model (ICM). Furthermore, we propose a new ranking metric named SpreadRank generalized by the new information propagation model CTMC-ICM. We experimentally demonstrate the new ranking method that can, in general, extract nontrivial nodes as an influential node set that maximizes the spread of information in a social network and is more efficient than a distance-based centrality.

[1]  Lei Xie,et al.  Minimizing the expected complete influence time of a social network , 2010, Inf. Sci..

[2]  Veselka Boeva,et al.  Multi-step ranking of alternatives in a multi-criteria and multi-expert decision making environment , 2006, Inf. Sci..

[3]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[4]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[5]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[6]  Aidong Zhang,et al.  Bridging centrality: graph mining from element level to group level , 2008, KDD.

[7]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[8]  Bin Wu,et al.  Social Influence and Role Analysis Based on Community Structure in Social Network , 2009, ADMA.

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

[10]  François Fouss,et al.  Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation , 2007, IEEE Transactions on Knowledge and Data Engineering.

[11]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[12]  R. Guimerà,et al.  Classes of complex networks defined by role-to-role connectivity profiles. , 2007, Nature physics.

[13]  Bin Wu,et al.  TeleComVis: Exploring Temporal Communities in Telecom Networks , 2009, ECML/PKDD.

[14]  Chu-Sing Yang,et al.  A time-efficient pattern reduction algorithm for k-means clustering , 2011, Inf. Sci..

[15]  Tim Oates,et al.  Modeling the Spread of Influence on the Blogosphere , 2006 .

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

[17]  Ravi Kumar,et al.  Influence and correlation in social networks , 2008, KDD.

[18]  Jimeng Sun,et al.  Social influence analysis in large-scale networks , 2009, KDD.

[19]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[20]  Yun Chi,et al.  Information flow modeling based on diffusion rate for prediction and ranking , 2007, WWW '07.

[21]  P. Tan,et al.  Node roles and community structure in networks , 2007, WebKDD/SNA-KDD '07.

[22]  Carl D. Meyer,et al.  Deeper Inside PageRank , 2004, Internet Math..

[23]  Bin Wu,et al.  Community Detection in Complex Networks , 2008, Journal of Computer Science and Technology.

[24]  Michael R. Lyu,et al.  DiffusionRank: a possible penicillin for web spamming , 2007, SIGIR.