Skip to main content
SpringerLink
Log in

Ranking Nodes in Signed Social Networks

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

Abstract

Social networks are inevitable part of modern life. A class of social networks is those with both positive (friendship or trust) and negative (enmity or distrust) links. Ranking nodes in signed networks remains a hot topic in computer science. In this manuscript, we review different ranking algorithms to rank the nodes in signed networks, and apply them to the sign prediction problem. Ranking scores are used to obtain reputation and optimism, which are used as features in the sign prediction problem. Reputation of a node shows patterns of voting towards the node and its optimism demonstrates how optimistic a node thinks about others. To assess the performance of different ranking algorithms, we apply them on three signed networks including Epinions, Slashdot and Wikipedia. In this paper, we introduce three novel ranking algorithms for signed networks and compare their ability in predicting signs of edges with already existing ones. We use logistic regression as the predictor and the reputation and optimism values for the trustee and trustor as features (that are obtained based on different ranking algorithms). We find that ranking algorithms resulting in correlated ranking scores, leads to almost the same prediction accuracy. Furthermore, our analysis identifies a number of ranking algorithms that result in higher prediction accuracy compared to others.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

References

  • Babaei M, Mirzasoleiman B, Safari M, Jalili M (2012) Revenue Maximization in Social Networks Through Discounting. Social Network Analysis and Mining. doi:10.1007/s13278-012-0085-5

    Google Scholar 

  • Barabási AL (2009) Scale-free networks: a decade and beyond. Science 325:412–413

    Article  MathSciNet  Google Scholar 

  • Barabasi A-L, Albert R (1999) Emergence of scaling in random networks 286:5009–5012

    MathSciNet  Google Scholar 

  • Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang DU (2006) Complex networks: structure and dynamics. Phys Rep 426:175–308

    Article  MathSciNet  Google Scholar 

  • Burke, M., & Kraut, R. (2008). Mopping up: modeling wikipedia promotion decisions. Paper presented at the CSCW’08: Proceedings of the 2008 ACM conference on Computer supported cooperative work,, 27–36. doi:10.1145/1460563.1460571

  • Cartwright D, Harary F (1956) Structure balance: A generalization of Heider’s theory. Psychol Rev 63(5):277–293

    Article  Google Scholar 

  • Chiang, K.-Y., Natarajan, N., Tewari, A., & Dhillon, I. S. (2011). Exploiting longer cycles for link prediction in signed networks. Paper presented at the ACM Conference on Information and Knowledge Management (pp. 1157–1162). Glasgow, Scotland, UK. doi:10.1145/2063576.2063742

  • Cristobald, de K., & Dooren, P. V. (2008). The PageTrust algorithm: How to rank web pages when negative links are allowed? Paper presented at the Proc. SIAM Int. Conf. on Data Mining. (pp. 346–352)

  • DuBois T, Golbeck J (2011) & Srinivasan, A. Predicting trust and distrust in social networks. In SocialCom/PASSAT, IEEE, pp 418–424

    Google Scholar 

  • Easley, D., & Kleinberg, J. (2010). Networks, crowds, and markets: Reasoning About a Highly Connected World: Cambridge University Press. Cambridge University Press New York, NY, USA ©2010

  • Esslimani Ilham, Armelle Brun AB (2011) Densifying a behavioral recommender system by social networks link prediction methods. Social Network Analysis and Mining 1(3):159–172. doi:10.1007/s13278-010-0004-6

    Article  Google Scholar 

  • Estrada E, Rodríguez-Velázquez JA (2005) Subgraph centrality in complex networks. Phys Rev E 71:056103

    Article  MathSciNet  Google Scholar 

  • Farahat A, Lofaro T, Miller JC, Rae G, Ward LA (2006) Authority rankings from HITS, PageRank, and SALSA: existence, uniqueness, and effect of initialization. SIAM J Sci Comput 27(4):1181–1201

    Article  MathSciNet  MATH  Google Scholar 

  • Guha, R., Kumar, R., Raghavan, P., & Tomkins, a. A. (2004). Propagation of trust and distrust. In Proceedings of the 13th conference on World Wide Web- WWW (pp. 403–412). New York, New York, USA. doi:10.1145/988672.988727

  • Hasan, M. Al, & Zaki, M. J. (2011). A Survey of Link Prediction in Social Networks. Social Network Analysis and Mining, 243–275

  • Leskovec, Jure, Huttenlocher, D., & Kleinberg, J. (2010). Predicting Positive and Negative Links in Online Social Networks. In Proceedings of the 19th international conference on World wide web (pp. 641–650). doi:10.1145/1772690.1772756

  • Ilyas, M. U., & Radha, H. (2011). Identifying Influential Nodes in Online Social Networks Using Principal Component Centrality. IEEE International Conference on In Communications (ICC) (pp. 1–5)

  • Jiao, J., Yan, J., Zhao, H., & Fan, W. (2009). ExpertRank: An Expert User Ranking Algorithm in Online Communities. International Conference on New Trends in Information and Service Science, (pp. 674–679). Beijing. doi:10.1109/NISS.2009.75

  • Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003). The EigenTrust algorithm for reputation management in P2P networks. Paper presented at the Proceedings of the Twelfth International World Wide Web (pp. 640–651). Budapest. doi:10.1145/775152.775242

  • Kleinberg, J. M. (1999). Authoritative sources in a hyperlinked environment. Journal of the ACM, (46(5)), 604–632

    Google Scholar 

  • Korovaiko N, Thomo A (2013) Trust prediction from user-item ratings. Social Network Analysis and Mining. doi:10.1007/s13278-013-0122-z

    Google Scholar 

  • Kunegis, J., Lommatzsch, A., & Bauckhage, C. (2009). The Slashdot Zoo: Mining a social network with negative edges. Paper presented at the the 18th international conference on World wide web (pp. 741–750). New York, NY, USA. doi:10.1145/1526709.1526809

  • Langville AN, Meyer CD (2004) Deeper inside PageRank. Internet Mathematics. Internet Mathematics 1(3):335–380

    Article  MathSciNet  MATH  Google Scholar 

  • Lempel R, Moran S (2000) The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Comput Netw 33(1–6):387–401

    Article  Google Scholar 

  • Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010a). Signed networks in social media. Paper presented at the 28th international conference on Human factors in computing systems (pp. 1361–1370). New York, NY, USA. doi:10.1145/1753326.1753532

  • Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010b). Predicting positive and negative links in online social networks. Paper presented at the the 19th international conference on World wide web New York, NY, USA. (pp. 641–650). doi:10.1145/1772690.1772756

  • Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010c). Predicting positive and negative links in online social networks. Paper presented at the the 19th international conference on World wide web New York, NY, USA. (pp. 26–30). New York, NY, USA

  • Liaghat Z, Rasekh AH, Mahdavi A (2013) Application of data mining methods for link prediction in social networks. Social Network Analysis and Mining 3(2):143–150

    Article  Google Scholar 

  • Mishra,.A, & Bhattacharya, A. (2011). Finding the bias and prestige of nodes in networks based on trust scores. In Proceedings of the 20th international conference on World wide web (pp. 567–576)

  • Newman MEJ (2003) The structure and function of complex networks. SIAM Review 145(2):167–256

    Article  Google Scholar 

  • Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The PageRank citation ranking: bringing order to the web: Standford University

  • Sahand. (2010). Iterative Ranking from Pair-wise Comparisons, 1–9

  • Shahriari, M., Sichani, O. A., Gharibshah, J., & Jalili, M. (2012). Predicting sign of edges in social networks based on users reputation and optimism. submited to Transactions on Knowledge Discovery from Data

  • Symeonidis, P., & Tiakas, E. (2013). Transitive node similarity: predicting and recommending links in signed social networks. Proceedings of the fourth ACM conference on Recommender systems (pp. 183–190). doi:10.1145/1864708.1864744

  • Symeonidis, P., Tiakas, E., & Manolopoulos, Y. (2010). Transitive node similarity for link prediction in social networks with positive and negative links. Proceedings of the fourth ACM conference on Recommender systems—RecSys’10, 183–190. doi:10.1145/1864708.1864744

  • Traag VA, Nesterov YE, Dooren P Van (2010) Exponential Ranking: taking into account negative links. Social Informatics 6430:192–202

    Article  Google Scholar 

  • Zhang Z, Wang K (2012) A trust model for multimedia social networks. Social Network Analysis and Mining. doi:10.1007/s13278-012-0078-4

    Google Scholar 

  • Ziegler C-N, Lausen G (2005) Propagation models for trust and distrust in social networks. Information Systems Frontiers 7(4–5):337–358. doi:10.1007/s10796-005-4807-3

    Article  Google Scholar 

  • Zolfaghar, K., & Aghaie, A. (2010). Mining Trust and Distrust Relationships in Social Web Applications. Paper presented at the IEEE 6th International Conference on Intelligent Computer Communication and Processing (pp. 73–80). Cluj-Napoca, Romania

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Sharif University of Technology, Azadi Avenue, Tehran, Iran

    Moshen Shahriari & Mahdi Jalili

Authors
  1. Moshen Shahriari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mahdi Jalili
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mahdi Jalili.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shahriari, M., Jalili, M. Ranking Nodes in Signed Social Networks. Soc. Netw. Anal. Min. 4, 172 (2014). https://doi.org/10.1007/s13278-014-0172-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13278-014-0172-x

Keywords

Search

Navigation