Advertisement

Journal of Computer Science and Technology

, Volume 33, Issue 2, pp 286–304 | Cite as

An Efficient Two-Phase Model for Computing Influential Nodes in Social Networks Using Social Actions

  • Mehdi Azaouzi
  • Lotfi Ben Romdhane
Regular Paper
  • 85 Downloads

Abstract

The measurement of influence in social networks has received a lot of attention in the data mining community. Influence maximization refers to the process of finding influential users who make the most of information or product adoption. In real settings, the influence of a user in a social network can be modeled by the set of actions (e.g., “like”, “share”, “retweet”, “comment”) performed by other users of the network on his/her publications. To the best of our knowledge, all proposed models in the literature treat these actions equally. However, it is obvious that a “like” of a publication means less influence than a “share” of the same publication. This suggests that each action has its own level of influence (or importance). In this paper, we propose a model (called Social Action-Based Influence Maximization Model, SAIM) for influence maximization in social networks. In SAIM, actions are not considered equally in measuring the “influence power” of an individual, and it is composed of two major steps. In the first step, we compute the influence power of each individual in the social network. This influence power is computed from user actions using PageRank. At the end of this step, we get a weighted social network in which each node is labeled by its influence power. In the second step of SAIM, we compute an optimal set of influential nodes using a new concept named “influence-BFS tree”. Experiments conducted on large-scale real-world and synthetic social networks reveal the good performance of our model SAIM in computing, in acceptable time scales, a minimal set of influential nodes allowing the maximum spreading of information.

Keywords

social network social influence social action personalized PageRank influence-BFS tree 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Supplementary material

11390_2018_1820_MOESM1_ESM.pdf (111 kb)
ESM 1 (PDF 110 kb)

References

  1. 1.
    Farhadi F, Sorkhi M, Hashemi S, Hamzeh A. An effective framework for fast expert mining in collaboration networks: A group-oriented and cost-based method. Journal of Computer Science and Technology, 2012, 27(3): 577-590.MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bouguessa M, Ben Romdhane L. Identifying authorities in online communities. ACM Trans. Intelligent Systems and Technology, 2015, 6(3): Article No. 30.Google Scholar
  3. 3.
    Lv L Y, Zhang Y C, Yeung C H, Zhou T. Leaders in social networks, the Delicious case. PLoS One, 2011, 6(6): Article No. e21202.Google Scholar
  4. 4.
    Zhang B L, Qian Z Z, Li W Z, Tang B, Lu S L, Fu X M. Budget allocation for maximizing viral advertising in social networks. Journal of Computer Science and Technology, 2016, 31(4): 759-775.MathSciNetCrossRefGoogle Scholar
  5. 5.
    Chen W, Li F, Lin T, Rubinstein A. Combining traditional marketing and viral marketing with amphibious influence maximization. In Proc. the 16th ACM Conf. Economics and Computation, June 2015, pp.779-796.Google Scholar
  6. 6.
    Sangachin M, Samadi M, Cavuoto L. Modeling the spread of an obesity intervention through a social network. Journal of Healthcare Engineering, 2014, 5(3): 293-312.CrossRefGoogle Scholar
  7. 7.
    Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N. Cost-effective outbreak detection in networks. In Proc. the 13th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, August 2007, pp.420-429.Google Scholar
  8. 8.
    Kempe D, Kleinberg J, Tardos E. Maximizing the spread of influence through a social network. In Proc. the 9th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, August 2003, pp.137-146.Google Scholar
  9. 9.
    Domingos P, Richardson M. Mining the network value of customers. In Proc. the 7th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, August 2001, pp.57-66.Google Scholar
  10. 10.
    Chen W, Yuan Y F, Zhang L. Scalable influence maximization in social networks under the linear threshold model. In Proc. the 10th IEEE Int. Conf. Data Mining, December 2010, pp.88-97.Google Scholar
  11. 11.
    Jung K, Heo W, Chen W. IRIE: Scalable and robust influence maximization in social networks. In Proc. the 12th Int. Conf. Data Mining, December 2012, pp.918-923.Google Scholar
  12. 12.
    Wang C, Chen W, Wang Y J. Scalable influence maximization for independent cascade model in large-scale social networks. Data Mining and Knowledge Discovery, 2012, 25(3): 545-576.MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Kim J, Kim S K, Yu H. Scalable and parallelizable processing of influence maximization for large-scale social networks? In Proc. the 29th Int. Conf. Data Engineering, April 2013, pp.266-277.Google Scholar
  14. 14.
    Wang Q Y, Jin Y H, Lin Z, Cheng S D, Yang T. Influence maximization in social networks under an independent cascade-based model. Physica A: Statistical Mechanics and its Applications, 2016, 444: 20-34.MathSciNetCrossRefGoogle Scholar
  15. 15.
    Bozorgi A, Haghighi H, Zahedi M S, Rezvani M. INCIM: A community-based algorithm for influence maximization problem under the linear threshold model. Information Processing & Management, 2016, 52(6): 1188-1199.CrossRefGoogle Scholar
  16. 16.
    Goyal A, Lu W, Lakshmanan L V S. SIMPATH: An efficient algorithm for influence maximization under the linear threshold model. In Proc. the 11th Int. Conf. Data Mining, December 2011, pp.211-220.Google Scholar
  17. 17.
    Rahimkhani K, Aleahmad A, Rahgozar M, Moeini A. A fast algorithm for finding most influential people based on the linear threshold model. Expert Systems with Applications, 2015, 42(3): 1353-1361.CrossRefGoogle Scholar
  18. 18.
    Wang Y, Cong G, Song G J, Xie K Q. Community-based greedy algorithm for mining top-K influential nodes in mobile social networks. In Proc. the 16th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, July 2010, pp.1039-1048.Google Scholar
  19. 19.
    Jiang Q Y, Song G J, Cong G, Wang Y, Si W J, Xie K Q. Simulated annealing based influence maximization in social networks. In Proc. the 25th AAAI Conf. Artificial Intelligence, August 2011, pp.127-132.Google Scholar
  20. 20.
    Tang Y Z, Shi Y C, Xiao X K. Influence maximization in near-linear time: A martingale approach. In Proc. ACM SIGMOD Int. Conf. Management of Data, May 31-June 4, 2015, pp.1539-1554.Google Scholar
  21. 21.
    Li H, Cui J T, Ma J F. Social influence study in online networks: A three-level review. Journal of Computer Science and Technology, 2015, 30(1): 184-199.MathSciNetCrossRefGoogle Scholar
  22. 22.
    Riquelme F, González-Cantergiani P. Measuring user influence on Twitter: A survey. Information Processing & Management, 2016, 52(5): 949-975.MathSciNetCrossRefGoogle Scholar
  23. 23.
    Tejaswi V, Bindu P V, Thilagam P S. Diffusion models and approaches for influence maximization in social networks. In Proc. Int. Conf. Advances in Computing Communications and Informatics, September 2016, pp.1345-1351.Google Scholar
  24. 24.
    Weng J S, Lim E P, Jiang J, He Q. TwitterRank: Finding topic-sensitive influential twitterers. In Proc. the 3rd ACM Int. Conf. Web Search and Data Mining, February 2010, pp.261-270.Google Scholar
  25. 25.
    Barbieri N, Bonchi F, Manco G. Topic-aware social influence propagation models. Knowledge and Information Systems, 2013, 37(3): 555-584.CrossRefGoogle Scholar
  26. 26.
    Xiang B, Liu Q, Chen E H, Xiong H, Zheng Y, Yang Y. PageRank with priors: An influence propagation perspective. In Proc. the 23rd Int. Joint Conf. Artificial Intelligence, August 2013, pp.2740-2746.Google Scholar
  27. 27.
    Wang Y F, Vasilakos A V, Jin Q, Ma J H. PPRank: Economically selecting initial users for influence maximization in social networks. IEEE Systems Journal, 2017, 11(4): 2279-2290.CrossRefGoogle Scholar
  28. 28.
    Wang G J, Jiang W J, Wu J, Xiong Z L. Fine-grained feature-based social influence evaluation in online social networks. IEEE Trans. Parallel and Distributed Systems, 2014, 25(9): 2286-2296.CrossRefGoogle Scholar
  29. 29.
    Chen Y C, Chang S H, Chou C L, Peng W C, Lee S Y. Exploring community structures for influence maximization in social networks. In Proc. the 6th SNA-KDD Workshop, August 2012.Google Scholar
  30. 30.
    Kandhway K, Kuri J. Using node centrality and optimal control to maximize information diffusion in social networks. IEEE Trans. Systems Man and Cybernetics: Systems, 2017, 47(7): 1099-1110.Google Scholar
  31. 31.
    Li H, Bhowmick S S, Sun A X, Cui J T. Conformityaware influence maximization in online social networks. The VLDB Journal, 2015, 24(1): 117-141.CrossRefGoogle Scholar
  32. 32.
    Li H, Bhowmick S S, Sun A X. CASINO: Towards conformity-aware social influence analysis in online social networks. In Proc. the 20th ACM Int. Conf. Information and Knowledge Management, October 2011, pp.1007-1012.Google Scholar
  33. 33.
    Li Y H, Chen W, Wang Y J, Zhang Z L. Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In Proc. the 6th ACM Int. Conf. Web Search and Data Mining, February 2013, pp.657-666.Google Scholar
  34. 34.
    He J, Kaur H, Talluri M. Positive opinion influential node set selection for social networks: Considering both positive and negative relationships. In Proc. Wireless Communications Networking and Applications, December 2014, pp.935-948.Google Scholar
  35. 35.
    Guler B, Varan B, Tutuncuoglu K, Nafea M, Zewail A A, Yener A, Octeau D. Using social sensors for influence propagation in networks with positive and negative relationships. IEEE Journal of Selected Topics in Signal Processing, 2015, 9(2): 360-373.CrossRefGoogle Scholar
  36. 36.
    Liu S Y, Wang S H, Zhu F D, Zhang J B, Krishnan R. HYDRA: Large-scale social identity linkage via heterogeneous behavior modeling. In Proc. ACM SIGMOD Int. Conf. Management of Data, June 2014, pp.51-62.Google Scholar
  37. 37.
    Liu S Y,Wang S H, Zhu F D. Structured learning from heterogeneous behavior for social identity linkage. IEEE Trans. Knowledge and Data Engineering, 2015, 27(7): 2005-2019.CrossRefGoogle Scholar
  38. 38.
    Subbian K, Sharma D, Wen Z, Srivastava J. Finding influencers in networks using social capital. In Proc. IEEE/ACM Int. Conf. Advances in Social Networks Analysis and Mining, August 2013, pp.592-599.Google Scholar
  39. 39.
    Franks H, Griffiths N, Anand S S. Learning influence in complex social networks. In Proc. Int. Conf. Autonomous Agents and Multi-agent Systems, May 2013, pp.447-454.Google Scholar
  40. 40.
    Deng X H, Pan Y, Wu Y, Gui J S. Credit distribution and influence maximization in online social networks using node features. In Proc. the 12th Int. Conf. Fuzzy Systems and Knowledge Discovery, August 2015, pp.2093-2100.Google Scholar
  41. 41.
    Liu G F, Zhu F, Zheng K, Liu A, Li Z X, Zhao L, Zhou X F. TOSI: A trust-oriented social influence evaluation method in contextual social networks. Neurocomputing, 2016, 210: 130-140.CrossRefGoogle Scholar
  42. 42.
    Zeng Y F, Chen X F, Cong G, Qin S C, Tang J, Xiang Y P. Maximizing influence under influence loss constraint in social networks. Expert Systems with Applications, 2016, 55: 255-267.CrossRefGoogle Scholar
  43. 43.
    Subbian K, Aggarwal C, Srivastava J. Mining influencers using information flows in social streams. ACM Trans. Knowledge Discovery from Data, 2016, 10(3): Article No. 26.Google Scholar
  44. 44.
    Liu S Y, Chen L, Ni L M, Fan J P. CIM: Categorical influence maximization. In Proc. the 5th Int. Conf. Ubiquitous Information Management and Communication, February 2011, Article No. 124.Google Scholar
  45. 45.
    Qu Q, Liu S Y, Jensen C S, Zhu F D, Faloutsos C. Interestingness-driven diffusion process summarization in dynamic networks. In Proc. European Conf. Machine Learning and Knowledge Discovery in Databases, September 2014, pp.597-613.Google Scholar
  46. 46.
    On B W, Lim E P, Jiang J, Teow L N. Engagingness and responsiveness behavior models on the Enron email network and its application to email reply order prediction. In The Influence of Technology on Social Network Analysis and Mining, Özyer T, Rokne J, Wagner G, Reuser A H P (eds.), Springer, 2013, pp.227-253.Google Scholar
  47. 47.
    Achananuparp P, Lim E P, Jiang J, Hoang T A. Who is retweeting the tweeters? Modeling, originating, and promoting behaviors in the Twitter network. ACM Trans. Management Information Systems, 2012, 3(3): Article No. 13.Google Scholar
  48. 48.
    Zhao K, Yen J, Greer G, Qiu B J, Mitra P, Portier K. Finding influential users of online health communities: A new metric based on sentiment influence. Journal of the American Medical Informatics Association, 2014, 21(e2): e212-e218.CrossRefGoogle Scholar
  49. 49.
    Yang C C, Tang X N. Estimating user influence in the Med-Help social network. IEEE Intelligent Systems, 2012, 27(5): 44-50.CrossRefGoogle Scholar
  50. 50.
    Nikolaev A, Gore S, Govindaraju V. Engagement capacity and engaging team formation for reach maximization of online social media platforms. In Proc. the 22nd ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, August 2016, pp.225-234.Google Scholar
  51. 51.
    Bonchi F, Castillo C, Gionis A, Jaimes A. Social network analysis and mining for business applications. ACM Trans. Intelligent Systems and Technology, 2011, 2(3): Article No. 22.Google Scholar
  52. 52.
    Fang Q, Sang J T, Xu C S, Rui Y. Topic-sensitive influencer mining in interest-based social media networks via hypergraph learning. IEEE Trans. Multimedia, 2014, 16(3): 796-812.CrossRefGoogle Scholar
  53. 53.
    Li J X, Liu C F, Yu J X, Chen Y, Sellis T, Culpepper J S. Personalized influential topic search via social network summarization. IEEE Trans. Knowledge and Data Engineering, 2016, 28(7): 1820-1834.CrossRefGoogle Scholar
  54. 54.
    Chen Y C, Zhu W Y, Peng W C, Lee W C, Lee S Y. CIM: Community-based influence maximization in social networks. ACM Trans. Intelligent Systems and Technology, 2014, 5(2): Article No. 25.Google Scholar
  55. 55.
    Budak C, Agrawal D, Abbadi A E. Limiting the spread of misinformation in social networks. In Proc. the 20th Int. Conf. World Wide Web, April 2011, pp.665-674.Google Scholar
  56. 56.
    Al-Garadi M A, Varathan K D, Ravana S D. Identification of influential spreaders in online social networks using interaction weighted K-core decomposition method. Physica A: Statistical Mechanics and its Applications, 2017, 468: 278-288.CrossRefGoogle Scholar
  57. 57.
    Chen W L, Cheng S Y, He X, Jiang F. InfluenceRank: An efficient social influence measurement for millions of users in microblog. In Proc. the 2nd Int. Conf. Cloud and Green Computing, November 2012, pp.563-570.Google Scholar
  58. 58.
    Brin S, Page L. The anatomy of a large-scale hypertextual web search engine. In Proc. the 7th Int. World-Wide Web Conf., April 1998, pp.107-117.Google Scholar
  59. 59.
    Lee S, Park S, Kahng M, Lee S G. PathRank: Ranking nodes on a heterogeneous graph for flexible hybrid recommender systems. Expert Systems with Applications, 2013, 40(2): 684-697.CrossRefGoogle Scholar
  60. 60.
    Boyd S, Vandenberghe L. Convex Optimization (7th edition). Cambridge University Press, 2009.Google Scholar
  61. 61.
    Goyal A, Lu W, Lakshmanan L V S. CELF++: Optimizing the greedy algorithm for influence maximization in social networks. In Proc. the 20th Int. Conf. Companion on World Wide Web, March 2011, pp.47-48.Google Scholar
  62. 62.
    Heidari M, Asadpour M, Faili H. SMG: Fast scalable greedy algorithm for influence maximization in social networks. Physica A: Statistical Mechanics and its Applications, 2015, 420: 124-133.CrossRefGoogle Scholar
  63. 63.
    Hu Y F. Efficient, high-quality force-directed graph drawing. The Mathematica Journal, 2006, 10(1): 37-71.Google Scholar
  64. 64.
    Bastian M, Heymann S, Jacomy M. Gephi: An open source software for exploring and manipulating networks. In Proc. the 3rd Int. AAAI Conf. Weblogs and Social Media , July 2009, pp.361-362.Google Scholar
  65. 65.
    Lancichinetti A, Fortunato S, Radicchi F. Benchmark graphs for testing community detection algorithms. Physical Review E, 2008, 78(4): Article No. 046110.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Modeling of Automated Reasoning Systems Research Laboratory LR17ES05 Higher Institute of Computer Science and TelecomUniversity of SousseSousseTunisia

Personalised recommendations