Efficient Spread of Influence in Online Social Networks

Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 32)


Influence maximization in Online Social Networks (OSNs) is the task of finding a small subset of nodes, often called as seed nodes that could maximize the spread of influence in the network. With the success of OSNs such as Twitter, Facebook, Flickr and Flixster, the phenomenon of influence exerted by such online social network users on several other online users, and how it eventually propagates in the network, has recently caught the attention of computer researchers to be mainly applied in the marketing field. However, the enormous amount of nodes or users available in OSNs poses a great challenge for researchers to study such networks for influence maximization. In this paper, we study efficient influence maximization by comparing the general Greedy algorithm with two other centrality algorithms often used for this purpose.


Online social networks Influence maximization Greedy algorithm High-degree heuristic algorithm Eigenvector centrality algorithm 


  1. 1.
    Nandi, G., Das, A.: A survey on using data mining techniques for online social network analysis. Int. J. Comput. Sci. Issues 10(6), 162–167 (2013)Google Scholar
  2. 2.
    Nandi, G., Das, A.: Online social network mining: current trends and research issues. Int. J. Res. Eng. Technol. 03(4), 346–350 (2014)Google Scholar
  3. 3.
    Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57–66 (2001)Google Scholar
  4. 4.
    Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’03), pp. 137–146 (2003)Google Scholar
  5. 5.
    Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Briesen, J., Glance, N.S.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 420–429 (2007)Google Scholar
  6. 6.
    Chen, W., et al.: Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the 2010 IEEE International Conference on Data mining (ICDM), pp. 88–97 (2010)Google Scholar
  7. 7.
    Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data mining (KDD), pp. 1029–1038 (2010)Google Scholar
  8. 8.
    Goyal, F.B., Lakshmanan, L.V.S.: A data-based approach to social influence maximization. Proc. VLDB Endowment 5(1), 73–84 (2011)CrossRefGoogle Scholar
  9. 9.
    Liu, L., Tang, J., Han, J., Jiang M., Yang, S.: Mining topic-level influence in heterogeneous networks. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management (CIKM), pp. 199–208 (2010)Google Scholar
  10. 10.
    Barbieri, N., Bonchi, F., Manco, G.: Topic-aware social influence propagation models. In: Proceedings of the 2012 IEEE 12th International Conference on Data Mining (ICDM), pp. 81–90 (2012)Google Scholar
  11. 11.
    Nieminen, J.: On the centrality in a graph. Scand. J. Psychol. 15, 332–336 (1974)CrossRefGoogle Scholar
  12. 12.
    Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: The Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199–208 (2009) Google Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.Assam Don Bosco UniversityGuwahatiIndia
  2. 2.St. Anthony’s CollegeShillongIndia

Personalised recommendations