Abstract
The well-known influence maximization problem (Kempe et al., in proceedings of the 9th SIGKDD international conference on knowledge discovery and data mining (KDD), pp 137–146, 2003) (or viral marketing through social networks) deals with selecting a few influential initial seeds to maximize the awareness of product(s) over the social network. As it is computationally hard (Kempe et al., in proceedings of the 9th SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp 137–146, 2003), a greedy approximation algorithm is designed to address the influence maximization problem. However, the major drawback of this greedy algorithm is that it runs extremely slow even on network datasets consisting of a few thousand nodes and edges (Leskovec et al., in proceedings of the 13th SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp 420–429, 2007; Checn et al., in proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp 937–944, 2009). Several efficient heuristics have been proposed in the literature (Checn et al., in proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp 937–944, 2009) to alleviate this computational difficulty; however, these heuristics are designed for specific influence propagation models such as linear threshold model and independent cascade model. This motivates the strong need to design an approach that not only works with any influence propagation model, but also efficiently solves the influence maximization problem. In this paper, we precisely address this problem by proposing a new framework which fuses both link and interaction data to come up with a backbone for a given social network, which can further be used for efficient influence maximization. We then conduct thorough experimentation with several real-life social network datasets such as DBLP, Epinions, Digg, and Slashdot and show that the proposed approach is efficient as well as scalable.
Similar content being viewed by others
Notes
Some authors call link data as static data and interaction data as dynamic data or trace data.
References
Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: Proceedings of the 3rd workshop on internet and network economics (WINE), pp 306–311
Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive influence in social networks. In: Proceedings of the 6th workshop on internet and network economics (WINE), pp 539–550
Budak C, Agrawal D, Abbadi AE (2011) Limiting the spread of misinformation in social networks. In: Proceedings of the 20th international conference on world wide web (WWW), pp 665–674
Burges C, Shaked T, Renshaw E, Lazier A, Deeds M, Hamilton N, Hullender G (2005) Learning to rank using gradient descent. In: Proceedings of the 22nd ICML, pp 89–96
Carnes T, Nagarajan C, Wild S, van Zuylen A (2007) Maximizing in uence in a competitive social network: a follower’s perspective. In: Proceedings of the 9th international conference on electronic commerce (ICEC), pp 351–360
Cornuejols G, Fisher M, Nemhauser G (1977) Location of bank accounts to optimize oat: an analytic study of exact and approximate algorithms. Manag Sci 23:789–810
Chen W, Collins A, Cummings R, Ke T, Liu Z, Rincon D, Sun X, Wang Y, Wei W, Yuan Y (2011) Influence maximization in social networks when negative opinions may emerge and propagate. In: Proceedings of SIAM SDM
Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 937–944
Datta S, Majumder A, Shrivastava N (2010) Viral marketing for multiple products. In: Proceedings of IEEE ICDM, pp 118–127
Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the 7th SIGKDD international conference on knowledge discovery and data mining (KDD), pp 57–66
Dwork C, Kumar R, Naor M, Sivakumar D (2001) Rank aggregation methods for the web. In: Proceedings of WWW, pp 613–622
Even-Dar E, Shapira A (2007) A note on maximizing the spread of influence in social networks. In: Proceedings of the 3rd workshop on internet and network economics (WINE), pp 281–286
Gao C, Liu J, Zhong N (2011) Network immunization and virus propagation in email networks: experimental evaluation and analysis. Knowl Inf Syst 27(2):253–279
Goldenberg J, Libai B, Muller E (2001) Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark Lett 12(3):211–223
Goyal A, Bonchi F, Lakshmanan LVS (2010) Learning influence probabilities in social networks. In: WSDM, pp 241–250
Goyal A, Bonchi F, Lakshmanan LVS (2011) A data-based approach to social influence maximization. In: PVLDB, pp 73–84
Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83:1420–1443
He X, Song G, Chen W, Jiang Q (2012) Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 12th SIAM international conference on data mining (SDM)
Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the 9th SIGKDD international conference on knowledge discovery and data mining (KDD), pp 137–146
Kimura M, Saito K (2006) Tractable modles for information diffusion in social networks. In: Proceedings of 10th European conference on principles and practice of knowledge discovery in databases (PKDD), pp 259–271
Kunegis J, Lommatzsch A, Bauckhage C (2009) The slashdot zoo: Mining a social network with negative edges. In: Proceedings of 18th WWW, pp 740–750
Lerman K, Ghosh R (2010) Information contagion: an empirical study of spread of news on Digg and Twitter social networks. In: Proceedings of 4th international conference on weblogs and social media (ICWSM)
Lermann K, Intagorn S, Kang JH, Ghosh R (2012) Using proximity to predict activity in social networks. In: Proceedings of the 21st international world wide web conference (poster)
Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the 28th ACM SIGCHI conference on human factors in computing systems (CHI), pp 1361–1370
Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th SIGKDD international conference on knowledge discovery and data mining (KDD), pp 420–429
Mathioudakis M, Bonchi F, Castillo C, Gionis A, Ukkonen A (2011) Sparsification of influence networks. In: Proceedings of the 17th SIGKDD international conference on knowledge discovery and data mining (KDD)
Newman MEJ (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci 98:404–409
Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104
Newman MEJ (2009) The structure of scientific collaboration networks. Proc Natl Acad Sci 98:404–409
Ramasuri N, Narahari Y (2011) A shapley value based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng 8(1):130–147
Richardson M, Agrawal R, Domingos P (2003) Trust management for the semantic web. In: Proceedings of ISWC
Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the 8th SIGKDD international conference on knowledge discovery and data mining (KDD), pp 61–70
Satuluri S, Parthasarathy V, Ruan Y (2011) Local graph sparsification for scalable clustering. In: Proceedings of SIGMOD, pp 721–732
Schelling T (1978) Micromotives and macrobehavior. W.W Norton and Company, New York
Yang J, Leskovec J (2012) Defining and evaluating network communities based on ground-truth. In: Proceedings of ICDM
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lamba, H., Narayanam, R. A model-independent approach for efficient influence maximization in social networks. Soc. Netw. Anal. Min. 5, 14 (2015). https://doi.org/10.1007/s13278-015-0252-6
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13278-015-0252-6