Parallel Seed Selection for Influence Maximization Based on k-shell Decomposition

Influence maximization is the problem of selecting a set of seeds in a social network to maximize the influence under certain diffusion model. Prior solutions, the greedy and its improvements are time-consuming. In this paper, we propose candidate shells influence maximization (CSIM) algorithm under heat diffusion model to select seeds in parallel. We employ CSIM algorithm (a modified algorithm of greedy) to coarsely estimate the influence spread to avoid massive estimation of heat diffusion process, thus can effectively improve the speed of selecting seeds. Moreover, we can select seeds from candidate shells in parallel. Specifically, First, we employ the k-shell decomposition method to divide a social network and generate the candidate shells. Further, we use the heat diffusion model to model the influence spread. Finally, we select seeds of candidate shells in parallel by using the CSIM algorithm. Experimental results show the effectiveness and feasibility of the proposed algorithm.

[1]  Joseph M. Hellerstein,et al.  GraphLab: A New Framework For Parallel Machine Learning , 2010, UAI.

[2]  Suh-Yin Lee,et al.  CIM: Community-Based Influence Maximization in Social Networks , 2014, TIST.

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

[4]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, KDD 2012.

[5]  Yaron Singer,et al.  Scalable Methods for Adaptively Seeding a Social Network , 2015, WWW.

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

[7]  Xueqi Cheng,et al.  StaticGreedy: solving the scalability-accuracy dilemma in influence maximization , 2012, CIKM.

[8]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[9]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[10]  Wei Chen,et al.  Scalable influence maximization for prevalent viral marketing in large-scale social networks , 2010, KDD.

[11]  Yuval Shavitt,et al.  A model of Internet topology using k-shell decomposition , 2007, Proceedings of the National Academy of Sciences.

[12]  Yu Wang,et al.  Influence Maximization on Large-Scale Mobile Social Network: A Divide-and-Conquer Method , 2015, IEEE Transactions on Parallel and Distributed Systems.

[13]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[14]  Guo Qiang,et al.  Analysis of the spreading influence of the nodes with minimum K-shell value in complex networks , 2013 .

[15]  Robin Wilson,et al.  Graph theory and combinatorics , 1979 .

[16]  Jinha Kim,et al.  Scalable and parallelizable processing of influence maximization for large-scale social networks? , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[17]  Reynold Xin,et al.  GraphX: a resilient distributed graph system on Spark , 2013, GRADES.

[18]  Mark S. Granovetter.  Threshold Models of Collective Behavior , 1978, American Journal of Sociology.

[19]  Michael R. Lyu,et al.  Mining social networks using heat diffusion processes for marketing candidates selection , 2008, CIKM '08.

[20]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

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

[22]  Jason J. Jung,et al.  Social big data: Recent achievements and new challenges , 2015, Information Fusion.

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

[24]  Jin-Soo Kim,et al.  HAMA: An Efficient Matrix Computation with the MapReduce Framework , 2010, 2010 IEEE Second International Conference on Cloud Computing Technology and Science.

[25]  Wei Chen,et al.  Scalable influence maximization for independent cascade model in large-scale social networks , 2012, Data Mining and Knowledge Discovery.

[26]  Suh-Yin Lee,et al.  Efficient algorithms for influence maximization in social networks , 2012, Knowledge and Information Systems.