Skip to main content
SpringerLink
Log in

Predicting edge sign and finding prestige of nodes in networks

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Recently, as a result of the popularity of online social networks, the analysis and comparison of their contents are in an incremental need. The study of social network and social interaction including both positive and negative connections, which is obviously significant. Our finding denotes that the contacts in the basic social networks, including their accuracy, are predictable. The trust of numerous users’ imparting on a node accounts for the form of networks. In this paper, We propose a model in this article to figure out the prestige on nodes in a network based on trust. This network also lays more emphasis to on trustworthy nodes. In the beginning, to achieve this goal, we try to indicate signed advantages in networks to predict an user’s opinion to another. After that, we present an algorithm, which can compute the prestige and trustworthiness. In their edge weight, we can find out the trust score. According to our experiments on the public dataset, we demonstrate the validity and efficiency of our algorithm.

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
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Ceren, B., Divyakant, A., Amr E.A.: Limiting the spread of misinformation in social networks. In: Proceeding of the WWW2011, pp. 665–674 (2011)

  2. Liran, K., Edo, L., Oren, S.: Estimating sizes of social networks via biased sampling. In: Proceeding of the WWW2011, pp. 597–604 (2011)

  3. Lin, W.Q,. Kong, X.N., Philip, S.Y.: Community detection in incomplete information networks. In: Proceeding of the WWW2012, pp. 341–350 (2012)

  4. Pang, B., Lee, L.: Opinion mining and sentinment analysis. Found. Trends Inf. Retr. 2(1), 144–155 (2008)

    Google Scholar 

  5. Hughes, B.D.: Random Walks and Random Environments. Oxford University Press, Oxford (1996)

    MATH  Google Scholar 

  6. Scott, J.: Social Nework Analysis. Sage, London (2000)

    Google Scholar 

  7. Hogg, T., Wilkinson, D., Szabo, G., Brzozowski, M.: Multiple relationship types in online communities and social networks. In: Proceeding of AAAI, pp. 556–565 (2008)

  8. Yang, B., Cheung, W., Liu, J.: Community mining form signed social networks. Knowl. Data Eng. 19(10), 1333–1348 (2007)

    Article  Google Scholar 

  9. Kechove, C., Dooren, P.V.: The pagetrust algorithm: how to rank web pages when negative links are allowed? In: Proceeding of he SIAM, pp. 346–352 (2008)

  10. Koren, Y.: Factor in the neighbors: scalable and accurate collaborative filtering. ACM Trans. Knowl. Discov. Data 4(1), 1–24 (2009)

    Article  MathSciNet  Google Scholar 

  11. Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small -world’ networks. Nature 393(6684), 440–442 (1998)

    Article  MATH  Google Scholar 

  12. Kalna, G., Higham, D.J.: A clustering coefficient for weighted networks, with application to gene expression data. AI Commun. 20(4), 263–271 (2007)

    MathSciNet  MATH  Google Scholar 

  13. Liben, N.D., Kleinberg, J.: The link prediction problem for social networks. In: Proceedings of International conference on Information and Knowledge Management, pp. 556–559 (2003)

  14. White, S., Smyth, P.: Algorithms for estimating relative importance in networks. In: Proceedings of International conference on Knowledge Discovery and Data Mining, pp. 266–275 (2003)

  15. Golub, G., Loan, C.F.V.: Matrix Computations. Johns Hopkins University Press, Baltimore (1996)

    MATH  Google Scholar 

  16. Kamvar, S.D., Schlosser, M.T., Molina, H.G.: The eigentrust algorithm for reputation management in P2P networks. In: Proceedings of WWW2003, pp. 640–651 (2003)

  17. Kerchove, C., Dooren, P.V.: The pagetrust algorithm: how to rank web pages when negative links are allowed? In: Proceeding of SDM, pp. 346–352 (2008)

  18. Guha R.V., Kumar R., Raghavan P., Tomkins A.: Propagatin of trust and distrust. In: Proceeding of WWW2004, pp. 403–412 (2004)

  19. Kynch, R.M., Ledger, P.D.: Resolving the sign conflict problem for hp—hexahedral Nédélec elements with application to eddy current problems. Comput. Struct. 181, 41–54 (2016)

    Article  Google Scholar 

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

  21. Zhang, L., Yang, L., Hu, G., et al.: Link prediction via sparse gaussian graphical model. Math. Probl. Eng. 2016(2), 1–11 (2016)

    MathSciNet  Google Scholar 

  22. Alshareef, A., Bakar, A.A., Hamdan, A.R, et al.: Pattern discovery algorithm for weather prediction problem. In: Science and Information Conference, pp. 572–577 (2015)

  23. Lee, K., Park, J., Baik, J.: Location-based web service QoS prediction via preference propagation for improving cold start problem. In: IEEE International Conference on Web Services. IEEE, pp. 177–184 (2015)

  24. Crowley, J.M., Tahirkheli, J., Iii, W.A.G.: Resolution of the band gap prediction problem for materials design. J. Phys. Chem. Lett. 7(7), 1198 (2016)

    Article  Google Scholar 

Download references

Acknowledgements

The research is supported by the National Natural Science Foundation of China (Nos. 61402544, 61403156).

Author information

Authors and Affiliations

  1. College of Electronics and Information Engineering, Hubei Key Laboratory of Intelligent Wireless Communications, South-Central University for Nationalities, Wuhan, China

    Xiaoping Jiang, Chenghua Li, Hao Ding & Jing Sun

Authors
  1. Xiaoping Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chenghua Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hao Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jing Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoping Jiang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jiang, X., Li, C., Ding, H. et al. Predicting edge sign and finding prestige of nodes in networks. Cluster Comput 20, 1473–1481 (2017). https://doi.org/10.1007/s10586-017-0865-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-017-0865-9

Keywords

Search

Navigation