Abstract
Most of the recent online social media collects a huge volume of data not just about who is linked with whom (aka link data) but also, about who is interacting with whom (aka interaction data). The presence of both variety and volume in these datasets pose new challenges while conducting social network analysis. In particular, we present a general framework to deal with both variety and volume in the data for a key social network analysis task - Influence Maximization. The well known influence maximization problem [15] (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 [15], 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 [20,6]. Several efficient heuristics have been proposed in the literature [6] 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.
This is a preview of subscription content, log in via an institution to check access.
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
Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 306–311. Springer, Heidelberg (2007)
Borodin, A., Filmus, Y., Oren, J.: Threshold models for competitive influence in social networks. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 539–550. Springer, Heidelberg (2010)
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullender, G.: Learning to rank using gradient descent. In: Proceedings of the 22nd ICML, pp. 89–96 (2005)
Budak, C., Agrawal, D., Abbadi, A.E.: Limiting the spread of misinformation in social networks. In: Proceedings of WWW, pp. 665–674 (2011)
Carnes, T., Nagarajan, C., Wild, S., van Zuylen, A.: 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 (2007)
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of ACM SIGKDD, pp. 937–944 (2009)
Datta, S., Majumder, A., Shrivastava, N.: Viral marketing for multiple products. In: Proceedings of IEEE ICDM, pp. 118–127 (2010)
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 57–66 (2001)
Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of WWW, pp. 613–622 (2001)
Goyal, A., Bonchi, F.: Laks V. S. Lakshmanan. Learning influence probabilities in social networks. In: WSDM, pp. 241–250 (2010)
Goyal, A., Lu, W., Lakshmanan, L.V.S.: SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model. In: ICDM, pp. 211–220 (2011)
Goyal, A., Bonchi, F., Lakshmanan, L.V.S.: A Data-Based Approach to Social Influence Maximization. In: PVLDB, pp. 73–84 (2011)
Goldenberg, J., Libai, B., Muller, E.: Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters 12(3), 211–223 (2001)
He, X., Song, G., Chen, W., Jiang, Q.: Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 12th SIAM International Conference on Data Mining, SDM (2012)
Kempe, D., Kleinberg, J., Tardos, E.: 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 (2003)
Kunegis, J., Lommatzsch, A., Bauckhage, C.: The slashdot zoo: Mining a social network with negative edges. In: Proc. of 18th WWW, pp. 740–750 (2009)
Lerman, K., Ghosh, R.: 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 (2010)
Lermann, K., Intagorn, S., Kang, J.H., Ghosh, R.: Using Proximity to Predict Activity in Social Networks. In: Proceedings of the 21st International World Wide Web Conference (poster) (December 2012)
Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the 28th ACM SIGCHI Conference on Human Factors in Computing Systems (CHI), pp. 1361–1370 (2010)
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 420–429 (2007)
Mathioudakis, M., Bonchi, F., Castillo, C., Gionis, A., Ukkonen, A.: Sparsification of influence networks. In: Proceedings of the 17th SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD (2011)
Newman, M.E.J.: The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences (PNAS) 98, 404–409 (2001)
Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Physical Review E 74(3), 036104 (2006)
Ramasuri, N., Narahari, Y.: A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks. IEEE T. Automation Science and Engineering 8(1), 130–147 (2011)
Richardson, M., Agrawal, R., Domingos, P.: Trust management for the semantic web. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 351–368. Springer, Heidelberg (2003)
Richardson, M., Domingos, P.: 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 (2002)
Satuluri, S., Parthasarathy, V., Ruan, Y.: Local graph sparsification for scalable clustering. In: Proc. of SIGMOD, pp. 721–732 (2011)
Schelling, T.: Micromotives and Macrobehavior. W.W. Norton and Company (1978)
Yang, J., Leskovec: Defining and evaluating network communities based on ground-truth. In: Proceedings of ICDM (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lamba, H., Narayanam, R. (2013). A Novel and Model Independent Approach for Efficient Influence Maximization in Social Networks. In: Lin, X., Manolopoulos, Y., Srivastava, D., Huang, G. (eds) Web Information Systems Engineering – WISE 2013. WISE 2013. Lecture Notes in Computer Science, vol 8181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41154-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-41154-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41153-3
Online ISBN: 978-3-642-41154-0
eBook Packages: Computer ScienceComputer Science (R0)