Skip to main content

Advertisement

Springer Nature Link
Log in

NodeRank: Finding influential nodes in social networks based on interests

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Finding influential members in social networks received a lot of interest in recent literature. Several algorithms have been proposed that provide techniques for extracting a set of the most influential people in a certain social network. However, most of these algorithms find influential nodes based solely on the topological structure of the network. In this paper, a new algorithm, namely NodeRank, is proposed that ranks every user in a given social network based on the topological structure as well as the interests of the users (nodes). Higher ranks are given to people with great influence on other members of the network. Furthermore, the paper investigates a MapReduce version of the algorithm that enables the algorithm to run on multiple machines simultaneously. Experiments showed that the MapReduce model is not suitable for the NodeRank algorithm since MapReduce is only applicable for batch processes and the NodeRank is highly iterative. For that reason, a parallel version of the algorithm is proposed that utilizes Hadoop Spark, a framework for parallel processes that supports batch operations as well as iterative and recursive algorithms. Several experiments have been carried out to test the accuracy as well as the scalability of the algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. Said A, Abbasi RA, Maqbool O, Daud A, Aljohani NR (2018) Cc-ga: A clustering coefficient based genetic algorithm for detecting communities in social networks. Appl Soft Comput 63:59–70

    Article  Google Scholar 

  2. Zhao Z, Li C, Zhang X, Chiclana F, Viedma EH (2019) An incremental method to detect communities in dynamic evolving social networks. Knowl-Based Syst 163:404–415

    Article  Google Scholar 

  3. Al-Garadi MA, Varathan KD, Ravana SD, Ahmed E, Mujtaba G, Khan MUS, Khan SU (2018) Analysis of online social network connections for identification of influential users: Survey and open research issues. ACM Comput Surv (CSUR) 51(1):1–37

    Article  Google Scholar 

  4. Khomami MMD, Rezvanian A, Meybodi MR, Bagheri A (2020) Cfin: A community-based algorithm for finding influential nodes in complex social networks. J Supercomput 77(2021):2207–2236

    Google Scholar 

  5. Zaharia M, Chowdhury M, Franklin MJ, Shenker S, Stoica I (2010) Spark: Cluster computing with working sets. HotCloud 10(10):95

    Google Scholar 

  6. Aldrich DP (2017) The importance of social capital in building community resilience. Springer, Cham, pp 357–364

    Google Scholar 

  7. Al Aghbari Z, Bahutair M, Kamel I (2019) “Geosimmr: A mapreduce algorithm for detecting communities based on distance and interest in social networks,” Data Science Journal, 18(1),

  8. Huang LV, Liu PL (2017) Ties that work: Investigating the relationships among coworker connections, work-related facebook utility, online social capital, and employee outcomes. Comput Hum Behav 72:512–524

    Article  Google Scholar 

  9. Richardson M, Domingos P (2002) “Mining knowledge-sharing sites for viral marketing,” in Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp. 61–70

  10. Kempe D, Kleinberg J, Tardos É (2015) Maximizing the spread of influence through a social network. Theory Comput 11(4):105–147

    Article  MathSciNet  Google Scholar 

  11. Shakarian P, Bhatnagar A, Aleali A, Shaabani E, Guo R (2015) The independent cascade and linear threshold models. Diffusion in Social Networks. Springer, Cham, pp 35–48

    Chapter  Google Scholar 

  12. Narayanam R, Narahari Y (2011) A shapley value-based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng 8(1):130–147

    Article  Google Scholar 

  13. Papapetrou P, Gionis A, Mannila H (2011) “A shapley value approach for influence attribution,” in Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, pp. 549–564

  14. 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. ACM, pp. 199–208

  15. Ben-Zwi O, Hermelin D, Lokshtanov D, Newman I (2009) “An exact almost optimal algorithm for target set selection in social networks,” in Proceedings of the 10th ACM conference on Electronic commerce. ACM, pp. 355–362

  16. Chen N (2009) On the approximability of influence in social networks. SIAM J Discrete Math 23(3):1400–1415

    Article  MathSciNet  Google Scholar 

  17. Singer Y (2012)“How to win friends and influence people, truthfully: influence maximization mechanisms for social networks,” in Proceedings of the fifth ACM international conference on Web search and data mining. ACM, pp. 733–742

  18. Khorasgani RR, Chen J, Zaïane OR (2010) “Top leaders community detection approach in information networks,” in 4th SNA-KDD Workshop on Social Network Mining and Analysis. Citeseer, Washington DC

  19. Hosseini R, Rezvanian A (2020) Antlp: ant-based label propagation algorithm for community detection in social networks. CAAI Trans Intell Technol 5(1):34–41

    Article  Google Scholar 

  20. Li X, Cao C, Zhang T (2020) “Block diagonal dominance-based dynamic programming for detecting community,” The Journal of Supercomputing, pp. 1–14

  21. Goyal A, Bonchi F, Lakshmanan LV (2008) “Discovering leaders from community actions,” in Proceedings of the 17th ACM conference on Information and knowledge management. ACM, pp. 499–508

  22. Agarwal N, Liu H, Tang L, Yu PS (2008) “Identifying the influential bloggers in a community,” in Proceedings of the 2008 international conference on web search and data mining. ACM, pp. 207–218

  23. Ilyas MU, Radha H (2011) “Identifying influential nodes in online social networks using principal component centrality,” in 2011 IEEE International Conference on Communications (ICC). IEEE, pp. 1–5

  24. Ilyas MU, Radha H (2010) “A klt-inspired node centrality for identifying influential neighborhoods in graphs,” in Information Sciences and Systems (CISS), 2010 44th Annual Conference on. IEEE, pp. 1–7

  25. Zareie A, Sheikhahmadi A, Jalili M (2019) Influential node ranking in social networks based on neighborhood diversity. Future Gener Comput Syst 94:120–129

    Article  Google Scholar 

  26. Cha M, Haddadi H, Benevenuto F, Gummadi PK (2010) Measuring user influence in twitter: The million follower fallacy. ICWSM 10(10–17):30

    Google Scholar 

  27. Romero DM, Galuba W, Asur S, Huberman BA (2011) “Influence and passivity in social media,” in Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, pp. 18–33

  28. Aral S, Walker D (2012) Identifying influential and susceptible members of social networks. Science 337(6092):337–341

    Article  MathSciNet  Google Scholar 

  29. Fang Q, Sang J, Xu C, Rui Y (2014) Topic-sensitive influencer mining in interest-based social media networks via hypergraph learning. IEEE Trans Multimedia 16(3):796–812

    Article  Google Scholar 

  30. Amato F, Moscato V, Picariello A, Sperlí G (2017) “Influence maximization in social media networks using hypergraphs,” in International Conference on Green, Pervasive, and Cloud Computing. Springer, pp. 207–221

  31. Miller GA (1995) Wordnet: A lexical database for english. Commun ACM 38(11):39–41

    Article  Google Scholar 

  32. Lin D (1998) “An information-theoretic definition of similarity,” in Proceedings of the Fifteenth International Conference on Machine Learning, ser. ICML ’98. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., pp. 296–304

  33. Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107–113

    Article  Google Scholar 

  34. Zheng C, Wang J, Jain A (2015) “All-pairs shortest paths in spark,”

Download references

Author information

Authors and Affiliations

  1. University of Sharjah, Sharjah, UAE

    Mohammed Bahutair, Zaher Al Aghbari & Ibrahim Kamel

Authors
  1. Mohammed Bahutair
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Zaher Al Aghbari
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Ibrahim Kamel
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Zaher Al Aghbari.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bahutair, M., Al Aghbari, Z. & Kamel, I. NodeRank: Finding influential nodes in social networks based on interests. J Supercomput 78, 2098–2124 (2022). https://doi.org/10.1007/s11227-021-03947-6

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-021-03947-6

Keywords