[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Sign prediction in sparse social networks using clustering and collaborative filtering

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

Abstract

Today, social networks have created a wide variety of relationships between users. Friendships on Facebook and trust in the Epinions network are examples of these relationships. Most social media research has often focused on positive interpersonal relationships, such as friendships. However, in many real-world applications, there are also networks of negative relationships whose communication between users is either distrustful or hostile in nature. Such networks are called signed networks. In this work, sign prediction is made based on existing links between nodes. However, in real signed networks, links between nodes are usually sparse and sometimes absent. Therefore, existing methods are not appropriate to address the challenges of accurate sign prediction. To address the sparsity problem, this work aims to propose a method to predict the sign of positive and negative links based on clustering and collaborative filtering methods. Network clustering is done in such a way that the number of negative links between the clusters and the number of positive links within the clusters are as large as possible. As a result, the clusters are as close as possible to social balance. The main contribution of this work is using clustering and collaborative filtering methods, as well as proposing a new similarity criterion, to overcome the data sparseness problem and predict the unknown sign of links. Evaluations on the Epinions network have shown that the prediction accuracy of the proposed method has improved by 8% compared to previous studies.

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
£29.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 includes VAT (United Kingdom)

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

Similar content being viewed by others

References

  1. Barabási AL et al (2016) Network science. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  2. R. Guha, R. Kumar, P. Raghavan, A. Tomkins, in Proceedings of the 13th International Conference on World Wide Web (2004), pp. 403–412

  3. Yuan W, He K, Guan D, Han G (2017) Edge-dual graph preserving sign prediction for signed social networks. IEEE Access 5:19383

    Article  Google Scholar 

  4. Javari A, Jalili M (2014) Cluster-based collaborative filtering for sign prediction in social networks with positive and negative links. ACM Transactions Intell Syst Technol (TIST) 5(2):1

    Article  Google Scholar 

  5. Tang J, Chang Y, Aggarwal C, Liu H (2016) A survey of signed network mining in social media. ACM Comput Surv (CSUR) 49(3):1

    Article  Google Scholar 

  6. J. Leskovec, D. Huttenlocher, J. Kleinberg, in Proceedings of the 19th International Conference on World Wide Web (2010), pp. 641–650

  7. Leskovec J, Huttenlocher D, Kleinberg J (2010) Proceedings of the SIGCHI Conference on Human Factors in Computing Systems 1361–1370

  8. Papaoikonomou A, Kardara M, Tserpes K, Varvarigou TA (2014) Predicting edge signs in social networks using frequent subgraph discovery. IEEE Internet Comput 18(5):36

    Article  Google Scholar 

  9. Tang J, Chang S, Aggarwal C, Liu H (2015) Proceedings of the Eighth ACM International Conference on Web Search and Data Mining 87–96

  10. Shahriari M, Sichani OA, Gharibshah J, Jalili M (2016) Sign prediction in social networks based on users reputation and optimism. Soc Netw Anal Min 6(1):91

    Article  Google Scholar 

  11. Singh R, Adhikari B (2017) Measuring the balance of signed networks and its application to sign prediction. J Stat Mech: Theory Exp 2017(6):063302

    Article  MathSciNet  Google Scholar 

  12. Yuan W, Li C, Han G, Guan D, Zhou L, He K (2019) Negative sign prediction for signed social networks. Future Gener Comput Syst 93:962

    Article  Google Scholar 

  13. Q.V. Dang, in International Conference on Integrated Science (Springer, 2020), pp. 291–300

  14. Liu SY, Xiao J, Xu XK (2020) Sign prediction by motif naive Bayes model in social networks. Information Sciences 541:316

    Article  MathSciNet  Google Scholar 

  15. Pang J, Yuan W, Guan D (2021) Tri-Domain pattern preserving sign prediction for signed networks. Neurocomputing 421:234

    Article  Google Scholar 

  16. Chiang KY, Whang JJ, Dhillon IS (2012) in Proceedings of the 21st ACM International Conference on Information and Knowledge Management , pp. 615–624

  17. Askarisichani O, Lane JN, Bullo F, Friedkin NE, Singh AK, Uzzi B (2019) Structural balance emerges and explains performance in risky decision-making. Nature Commun 10(1):1

    Article  Google Scholar 

  18. Le Falher G, Cesa-Bianchi N, Gentile C, Vitale F (2016)

  19. Wu Z, Aggarwal CC, Sun J (2016) Proceedings of the Ninth ACM International Conference on Web Search and Data Mining 447–456

  20. Khodadadi A, Jalili M (2017) Sign prediction in social networks based on tendency rate of equivalent micro-structures. Neurocomputing 257:175

    Article  Google Scholar 

  21. Jung J, Jin W, Sael L, Kang U (2016) in 2016 IEEE 16th International Conference on Data Mining (ICDM) (IEEE), pp. 973–978

  22. Zhu X, Ma Y (2020) Sign prediction on social networks based nodal features. Complexity 2020

  23. Ahmadalinezhad M, Makrehchi M (2018) in International Conference on Social Computing, Behavioral-Cultural Modeling and Prediction and Behavior Representation in Modeling and Simulation (Springer), pp. 220–227

  24. Doreian P, Mrvar A (1996) A partitioning approach to structural balance. Soc Netw 18(2):149

    Article  Google Scholar 

  25. Leskovec J, Krevl A (2014) Snap datasets: Stanford large network dataset collection

  26. Yuan W, Pang J, Guan D, Tian Y, Al-Dhelaan A, Al-Dhelaan M (2019) Sign prediction on unlabeled social networks using branch and bound optimized transfer learning. Complexity 2019

Download references

Acknowledgements

This research was fully supported by the Graduate School of the University of Isfahan and the Iranian Ministry of Science, Research, and Technology.

Funding

None.

Author information

Authors and Affiliations

  1. Faculty of Computer Engineering, University of Isfahan, Isfahan, Iran

    Mina Nasrazadani, Afsaneh Fatemi & Mohammadali Nematbakhsh

Authors
  1. Mina Nasrazadani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Afsaneh Fatemi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohammadali Nematbakhsh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Afsaneh Fatemi.

Ethics declarations

Conflicts of interest

The authors declare that there is no conflict of interest.

Availability of data and material

Not applicable.

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

Nasrazadani, M., Fatemi, A. & Nematbakhsh, M. Sign prediction in sparse social networks using clustering and collaborative filtering. J Supercomput 78, 596–615 (2022). https://doi.org/10.1007/s11227-021-03902-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-021-03902-5

Keywords

Search

Navigation