• Prathamesh Phuke ME Student Department of Computer Engineering Sinhgad Academy of Engineering, Pune, India.
  • Suresh Rathod Assistant Professor Department of Computer Engineeing Sinhgad Academy of Engineering Pune, India


Social network influence, adaptive seeding, influence maximization, social networks


The live of unfold of information is unrelentingly expanded in online social organizations, as an example, Facebook and Twitter. To utilize online social organizations as a promoting stage, there are many examinations on the simplest way to utilize the proliferation of impact for viral advertising. one amongst the exploration problems is influence maximization (IMAX), that plans to get k seed clients to amplify the unfold of impact among clients in social organizations. during this project our contribution is to indicate the ad of products in step with the age of user consequently. it's over up being a NP-hard issue by Kempe et al. Since they planned an avaricious calculation for the difficulty, various analysts have planned totally different heuristic routines.


LiorSeeman,Yaron Singer, “Adaptive seeding in social networks,” IEEE 54th Annual Symposium on Foundations of computer science, 2013.

Dung T. Nguyen, Soham Das, and My T. Thai,“Infulence maximization in multiple online social networks,”Symposium on selected areas in communications, Globecom 2013.

Guangmo, Weili Wu, Shaojie Tang, and Ding-Zhu Du, Member, IEEE, “Adaptive influence maximization in dynamic social networks,” IEEE/ACM transactions on Networking, 2016.

D. Kempe, J. Kleinberg, and E. Tardos, “Maximizing the spread of influence through a social network,” in Proc. 9th ACM SIGKDD Int. ConfKnowl. Discovery Data Mining, 2003, pp. 137-146.

Songsong Li, Yuqing Zhu, Deying Li, Donghyun Kim, Huan Ma, and Hejiao Huang, “Influence maximization in social networks using user attitude modification,” IEEE ICC 2014 - Selected Areas in Communications Symposium.

Manasvi Talluri, Harmeetkaur, Jing (Selena) He, “Influence maximization in social networks:considering both positive and negative relationships,” 978-1-4673-7648-8/15/$31.00 ©2015 IEEE.

Wei Chen, Yajun Wang, Siyu Yang, “Efficient influence maximization in social networks,” KDD’09, June 28–July 1, 2009, Paris, France. Copyright 2009 ACM 978-1-60558-495-9/09/06

P. Domingos and M. Richardson, “Mining the network value of customers,” Copyright 2001 ACM.

W. Chen, C. Wang, and Y. Wang, “Scalable influence maximization for prevalent viral marketing in large-scale social networks,” in Proc 16th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2010, pp. 1029–1038.

W. Chen, Y. Wang, and S. Yang, “Efficient influence maximization in social networks,” in Proc. 15th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2009, pp. 199–208.

N. Chen, “On the approximability of influence in social networks,” SIAM J. Discrete Math., vol. 23, no. 3, pp. 1400–1415, 2009.

Additional Files



How to Cite

Prathamesh Phuke, & Suresh Rathod. (2016). INFLUENCE MAXIMIZATION IN SOCIAL NETWORKS. International Education and Research Journal (IERJ), 2(12). Retrieved from