Skip to main content
Log in

Signed PageRank on Online Rating Systems

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

The ratings in many user-object online rating systems can reflect whether users like or dislike the objects, and in some online rating systems, users can directly choose whether to like an object. So these systems can be represented by signed bipartite networks, but the original unsigned node evaluation algorithm cannot be directly used on the signed networks. This paper proposes the Signed PageRank algorithm for signed bipartite networks to evaluate the object and user nodes at the same time. Based on the global information, the nodes can be sorted by the Signed PageRank values in descending order, and the result is SR Ranking. The authors analyze the characteristics of top and bottom nodes of the real networks and find out that for objects, the SR Ranking can provide a more reasonable ranking which combines the degree and rating of node, and the algorithm also can help us to identify users with specific rating patterns. By discussing the location of negative edges and the sensitivity of object SR Ranking to negative edges, the authors also explore that the negative edges play an important role in the algorithm and explain that why the bad reviews are more important in real networks.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Tao Z, Jie R, Mat M, et al., Bipartite network projection and personal recommendation, Physical Review E, 2007, 76(4 Pt 2): 046115.

    Article  Google Scholar 

  2. Huang Z, Chung W, and Chen H, A graph model for e-commerce recommender systems, Journal of the American Society for Information Science & Technology, 2014, 55(3): 259–274.

    Article  Google Scholar 

  3. Anglade A, Tiemann M, and Vignoli F, Complex-network theoretic clustering for identifying groups of similar listeners in p2p systems, Proceedings of the 2007 ACM conference on Recommender Systems, Minneapolis, MN, USA, 2007.

  4. Huang Z, Zeng D D, and Chen H, Analyzing consumer-product graphs: Empirical findings and applications in recommender systems, Management Science, 2007, 53(7): 1146–1164.

    Article  Google Scholar 

  5. Ke G, Ying F, An Z, et al., Analysis on large-scale rating systems based on the signed network, Physica A: Statistical Mechanics and Its Applications, 2018, 507: 99–109.

    Article  Google Scholar 

  6. Lü L, Medo, et al., Recommender systems, Physics Reports A Review, 2012, 519(1): 1–9.

    Article  Google Scholar 

  7. Jannach D, Zanker M, Felfernig A, et al., An Introduction to Recommender Systems, Cambridge University Press, Cambridge, 2011.

    Google Scholar 

  8. Schafer, Ben J, Konstan, et al., E-commerce recommendation applications, Data Mining and Knowledge Discovery, 2001, 5: 115–153.

    Article  Google Scholar 

  9. Ali K and Stam W V, TIVo: Making show recommendations using a distributed collaborative filtering architecture, Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, 2004.

  10. Zhang C J and Zeng A, Behavior patterns of online users and the effect on information filtering, Physica A Statistical Mechanics & Its Applications, 2012, 391(4): 1822–1830.

    Article  Google Scholar 

  11. Kunegis J, Lommatzsch J, and Bauckhage C, The slashdot zoo: Mining a social network with negative edges, Proceedings of the 18th International Conference on World Wide Web, Geneva, 2009.

  12. Symeonidis P, Tiakas E, and Manolopoulos Y, Transitive node similarity for link prediction in social networks with positive and negative links, Proceedings of the 2010 ACM Conference on Recommender Systems, Barcelona, 2010.

  13. Leskovec J, Huttenlocher D, and Kleinberg J, Predicting positive and negative links in online social networks, Proceedings of the 19th International Conference on World Wide Web, Raleigh North Carolina, 2010.

  14. Singh R and Adhikari B, Measuring the balance of signed networks and its application to sign prediction, Journal of Statistical Mechanics Theory and Experiment, 2017, 2017(6): 063302.

    Article  MathSciNet  Google Scholar 

  15. Zeng W, Zhu Y X, Lü L, et al., Negative ratings play a positive role in information filtering, Physica A: Statistical Mechanics and Its Applications, 2011, 390(23–24): 4486–4493.

    Article  MathSciNet  Google Scholar 

  16. Shams B and Haratizadeh S, SibRank: Signed bipartite network analysis for neighbor-based collaborative ranking, Physica A: Statistical Mechanics and Its Applications, 2016, 458: 364–377.

    Article  MathSciNet  Google Scholar 

  17. Liang H, Liang R, and Lin W, A reconsideration of negative ratings for network-based recommendation, Physica A: Statistical Mechanics and Its Applications, 2018, 490: 690–701.

    Article  Google Scholar 

  18. Zhang P, Song X, Xue L, et al., A new recommender algorithm on signed networks, Physica A: Statistical Mechanics and Its Applications, 2019, 520: 317–321.

    Article  Google Scholar 

  19. Page L, Brin S, Motwani R, et al., The PageRank Citation Ranking: Bringing Order to the Web, Technical Report SIDL-WP-1999-0120, Stanford Digital Library Technologies Project, 1998

  20. Yao L, Wei T, Zeng A, et al., Ranking scientific publications: The effect of nonlinearity, Scientific Reports, 2014, 4: 6663–6668.

    Article  Google Scholar 

  21. Nykl M, Jezek K, Fiala D, et al., PageRank variants in the evaluation of citation networks, Journal of Informetrics, 2014, 8(3): 683–692.

    Article  Google Scholar 

  22. Fiala D, Time-aware PageRank for bibliographic networks, Journal of Informetrics, 2012, 6(3): 370–388.

    Article  Google Scholar 

  23. Zhou J L, Zeng A, Fan Y, et al., Ranking scientific publications with similarity-preferential mechanism, Scientometrics, 2016, 106(2): 805–816.

    Article  Google Scholar 

  24. Zhang T, Jiang H, Bao Z, et al., Characterization and edge sign prediction in signed networks, Journal of Industrial and Intelligent Information, 2013, 1(1): 19–24.

    Article  Google Scholar 

  25. Shahriari M and Jalili M, Ranking nodes in signed social networks, Social Network Analysis & Mining, 2014, 4(1): 172–183.

    Article  Google Scholar 

  26. Jung J, Jin W, Sael L, et al., Personalized ranking in signed networks using signed random walk with restart, IEEE 16th International Conference on Data Mining (ICDM), Barcelona, 2016.

  27. Tang J, Aggarwal C, and Liu H, Recommendations in signed social networks, Proceedings of the 25th International Conference on World Wide Web, International World Wide Web Conferences Steering Committee, Montral Qubec, 2016.

  28. Sayyadi H and Getoor L, FutureRank: Ranking scientific articles by predicting their future Pagerank, Proceedings of the SIAM International Conference on Data Mining, Sparks, Nevada, USA. DBLP, 2009.

  29. Brin S and Page L, The anatomy of a large-scale hypertextual web search engine, Computer Networks and ISDN Systems, 1998, 30(1–7): 107–117.

    Article  Google Scholar 

  30. Shang M S, Lü L Y, Zhang Y C, et al., Empirical analysis of web-based user-object bipartite networks, EPL (Europhysics Letters), 2009, 90(4): 1303–1324.

    Google Scholar 

  31. Barber M J, Modularity and community detection in bipartite networks, Physical Review E Statistical Nonlinear & Soft Matter Physics, 2007, 76(2): 066102.

    Article  MathSciNet  Google Scholar 

  32. Liao H, Zeng A, Xiao R, et al., Ranking reputation and quality in online rating systems, PLoS ONE, 2014, 9(5): e97146.

    Article  Google Scholar 

  33. Zhou T, Kuscsik Z, Liu J G, et al., Solving the apparent diversity-accuracy dilemma of recommender systems, Proceedings of the National Academy of Sciences of the United States of America, 2010, 107(10): 4511–4515.

    Article  Google Scholar 

  34. Liu X L, Liu J G, Yang K, et al., Identifying online user reputation of user’s object bipartite networks, Physica A Statistical Mechanics & Its Applications, 2017, 467: 508–516.

    Article  Google Scholar 

  35. Lee S H, Kim P J, and Jeong H, Statistical properties of sampled networks, Physical Review E, 2006, 73(1 Pt 2): 016102.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ying Fan.

Additional information

This research was supported by the National Natural Science Foundation of China under Grant Nos. 61573065 and 71731002.

This paper was recommended for publication by Editor HAN Jing.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gu, K., Fan, Y. & Di, Z. Signed PageRank on Online Rating Systems. J Syst Sci Complex 35, 58–80 (2022). https://doi.org/10.1007/s11424-021-0124-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-021-0124-2

Keywords

Navigation