Skip to main content

Which Group Do You Belong To? Sentiment-Based PageRank to Measure Formal and Informal Influence of Nodes in Networks

  • Conference paper
  • First Online:
Complex Networks & Their Applications IX (COMPLEX NETWORKS 2020 2020)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 944))

Included in the following conference series:

Abstract

Organizational networks are often hierarchical by nature as individuals take on roles or functions at various job levels. Prior studies have used either text-level (e.g., sentiment, affect) or structural-level features (e.g., PageRank, various centrality metrics) to identify influential nodes in networks. In this study, we use a combination of these two levels of information to develop a novel ranking method that combines sentiment analysis and PageRank to infer node-level influence in a real-world organizational network. We detect sentiment scores for all actor pairs based on the content of their email-based communication, and calculate their influence index using an enhanced PageRank method. Finally, we group individual nodes into distinct clusters according to their influence index. Compared to established network metrics designed or used to infer formal and informal influence and ground truth data on job levels, our metric achieves the highest accuracy for inferring formal influence (60.7%) and second highest for inferring informal influence (69.0%). Our approach shows that combining text-level and structural-level information is effective for identifying the job level of nodes in an organizational network.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://www.cs.cmu.edu/~./enron/.

References

  1. Agarwal, A., Omuya, A., Harnly, A., Rambow, O.: A comprehensive gold standard for the Enron organizational hierarchy. In: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), pp. 161–165. Association for Computational Linguistics (2012)

    Google Scholar 

  2. Bollen, J., Rodriquez, M.A., Van de Sompel, H.: Journal status. Scientometrics 69(3), 669–687 (2006)

    Article  Google Scholar 

  3. Bramsen, P., Escobar-Molano, M., Patel, A., Alonso, R.: Extracting social power relationships from natural language. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, vol. 1, pp. 773–782. Association for Computational Linguistics (2011)

    Google Scholar 

  4. Clauset, A., Moore, C., Newman, M.E.: Structural inference of hierarchies in networks. In: ICML Workshop on Statistical Network Analysis, pp. 1–13. Springer (2006)

    Google Scholar 

  5. Diesner, J., Carley, K.M.: Extraktion relationaler daten aus texten. In: Handbuch Netzwerkforschung, pp. 507–521. Springer (2010)

    Google Scholar 

  6. Diesner, J., Carley, K.M.: A methodology for integrating network theory and topic modeling and its application to innovation diffusion. In: Proceedings of the 2010 IEEE 2nd International Conference on Social Computing, pp. 687–692. IEEE (2010)

    Google Scholar 

  7. Diesner, J., Evans, C.S.: Little bad concerns: using sentiment analysis to assess structural balance in communication networks. In: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015, pp. 342–348 (2015)

    Google Scholar 

  8. Diesner, J., Frantz, T.L., Carley, K.M.: Communication networks from the Enron email corpus: “it’s always about the people. Enron is no different”. Comput. Math. Organ. Theor. 11(3), 201–228 (2005)

    Article  Google Scholar 

  9. Dinh, L., Rezapour, R., Jiang, L., Diesner, J.: Structural balance in signed digraphs: considering transitivity to measure balance in graphs constructed by using different link signing methods. arXiv preprint arXiv:2006.02565 (2020)

  10. Gilbert, E.: Phrases that signal workplace hierarchy. In: Proceedings of the ACM 2012 Conference on Computer Supported Cooperative Work, pp. 1037–1046 (2012)

    Google Scholar 

  11. He, X., Du, H., Feldman, M.W., Li, G.: Information diffusion in signed networks. PLOS ONE 14(10), e0224177 (2019)

    Article  Google Scholar 

  12. Heidemann, J., Klier, M., Probst, F.: Identifying key users in online social networks: a PageRank based approach. In: Proceedings of the International Conference on Information Systems (2010)

    Google Scholar 

  13. Honnibal, M., Johnson, M.: An improved non-monotonic transition system for dependency parsing. In: Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pp. 1373–1378 (2015)

    Google Scholar 

  14. Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. (CSUR) 31(3), 264–323 (1999)

    Article  Google Scholar 

  15. Knight, P.A.: The Sinkhorn-Knopp algorithm: convergence and applications. SIAM J. Matrix Anal. Appl. 30(1), 261–275 (2008)

    Article  MathSciNet  Google Scholar 

  16. Krackhardt, D.: Assessing the political landscape: structure, cognition, and power in organizations. Adm. Sci. Q., 342–369 (1990)

    Google Scholar 

  17. Krackhardt, D.: Graph theoretical dimensions of informal organizations. In: Computational Organization Theory, pp. 89–111. Lawrence Erlbaum Associates Inc. (1994)

    Google Scholar 

  18. Loper, E., Bird, S.: NLTK: the natural language toolkit. In: Proceedings of the ACL on Interactive Poster and Demonstration Sessions, pp. 31–44. Association for Computational Linguistics (2002)

    Google Scholar 

  19. MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Oakland, CA, USA, pp. 281–297 (1967)

    Google Scholar 

  20. McCallum, A., Wang, X., Corrada-Emmanuel, A.: Topic and role discovery in social networks with experiments on Enron and academic email. J. Artif. Intell. Res. 30, 249–272 (2007)

    Article  Google Scholar 

  21. Michalski, R., Palus, S., Kazienko, P.: Matching organizational structure and social network extracted from email communication. In: Proceedings of the International Conference on Business Information Systems, pp. 197–206. Springer (2011)

    Google Scholar 

  22. Ngoc, P.T., Yoo, M.: The lexicon-based sentiment analysis for fan page ranking in Facebook. In: Proceedings of the International Conference on Information Networking 2014, ICOIN 2014, pp. 444–448. IEEE (2014)

    Google Scholar 

  23. Nurek, M., Michalski, R.: Combining machine learning and social network analysis to reveal the organizational structures. Appl. Sci. 10(5), 1699 (2020). https://doi.org/10.3390/app10051699

    Article  Google Scholar 

  24. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab (1999)

    Google Scholar 

  25. Prabhakaran, V., Rambow, O.: Predicting power relations between participants in written dialog from a single thread. In: Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), pp. 339–344 (2014)

    Google Scholar 

  26. Priebe, C.E., Conroy, J.M., Marchette, D.J., Park, Y.: Scan statistics on Enron graphs. Comput. Math. Organ. Theor. 11(3), 229–247 (2005)

    Article  Google Scholar 

  27. Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846–850 (1971)

    Article  Google Scholar 

  28. Reynolds, D.A.: Gaussian mixture models. In: Encyclopedia of Biometrics, vol. 741 (2009)

    Google Scholar 

  29. Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat., 400–407 (1951)

    Google Scholar 

  30. Rowe, R., Creamer, G., Hershkop, S., Stolfo, S.J.: Automated social hierarchy detection through email network analysis. In: Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis, pp. 109–117 (2007)

    Google Scholar 

  31. Tchokni, S.E., Séaghdha, D.O., Quercia, D.: Emoticons and phrases: status symbols in social media. In: Proceedings of the 8th International AAAI Conference on Weblogs and Social Media (2014)

    Google Scholar 

  32. Weng, J., Lim, E.P., Jiang, J., He, Q.: Twitterrank: finding topic-sensitive influential twitterers. In: Proceedings of the 3rd ACM International Conference on Web Search and Data Mining, pp. 261–270 (2010)

    Google Scholar 

  33. Wiebe, J., Riloff, E.: Creating subjective and objective sentence classifiers from unannotated texts. In: Proceedings of the International Conference on Intelligent Text Processing and Computational Linguistics, pp. 486–497. Springer (2005)

    Google Scholar 

  34. Xing, W., Ghorbani, A.: Weighted PageRank algorithm. In: 2004 Proceedings of the 2nd Annual Conference on Communication Networks and Services Research, pp. 305–314. IEEE (2004)

    Google Scholar 

  35. Zhao, Y., Karypis, G.: Criterion functions for document clustering: Experiments and analysis. Technical report, TR 01–40, Department of Computer Science, University of Minnesota (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lan Jiang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jiang, L., Dinh, L., Rezapour, R., Diesner, J. (2021). Which Group Do You Belong To? Sentiment-Based PageRank to Measure Formal and Informal Influence of Nodes in Networks. In: Benito, R.M., Cherifi, C., Cherifi, H., Moro, E., Rocha, L.M., Sales-Pardo, M. (eds) Complex Networks & Their Applications IX. COMPLEX NETWORKS 2020 2020. Studies in Computational Intelligence, vol 944. Springer, Cham. https://doi.org/10.1007/978-3-030-65351-4_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-65351-4_50

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-65350-7

  • Online ISBN: 978-3-030-65351-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics