Advertisement

Trustworthiness in Networks: A Simulation Approach for Approximating Local Trust and Distrust Values

  • Khrystyna Nordheimer
  • Thimo Schulze
  • Daniel Veit
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 321)

Abstract

Trust is essential for most social and business networks in the web, and determining local trust values between two unfamiliar users is an important issue. However, many existing approaches to calculating these values have limitations in various constellations or network characteristics. We therefore propose an approach that interprets trust as probability and is able to estimate local trust values on large networks using a Monte Carlo simulation method. The estimation is based on existing indirect trust statements between two unfamiliar users. This approach is then extended to the SimTrust algorithm that incorporates both trust and distrust values. It is implemented and discussed in detail with examples. Our main contribution is a new approach which incorporates all available trust and distrust information in such a way that basic trust properties are satisfied.

Keywords

Trust network local trust values trust properties trust and distrust propagation connection probability Monte Carlo method 

References

  1. 1.
    Kuter, U., Golbeck, J.: SUNNY: a new algorithm for trust inference in social networks using probabilistic confidence models. In: Proceedings of the 22nd national conference on Artificial intelligence, pp. 1377–1382. AAAI Press, Menlo Park (2007)Google Scholar
  2. 2.
    O’Donovan, J., Smyth, B.: Trust in recommender systems. In: Proceedings of the 10th International Conference on Intelligent User Interfaces, pp. 167–174. ACM, San Diego (2005)CrossRefGoogle Scholar
  3. 3.
    Avesani, P., Massa, P., Tiella, R.: A trust-enhanced recommender system application: Moleskiing. In: Proceedings of the 2005 ACM symposium on Applied computing, pp. 1589–1593. ACM, Santa Fe (2005)CrossRefGoogle Scholar
  4. 4.
  5. 5.
    Golbeck, J.A.: Computing and applying trust in web-based social networks, University of Maryland at College Park (2005)Google Scholar
  6. 6.
    Richardson, M., Agrawal, R., Domingos, P.: Trust Management for the Semantic Web. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 351–368. Springer, Heidelberg (2003)Google Scholar
  7. 7.
    Guha, R., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: Proceedings of the 13th international conference on World Wide Web, pp. 403–412. ACM, New York (2004)Google Scholar
  8. 8.
    Massa, P., Avesani, P.: Controversial users demand local trust metrics: an experimental study on Epinions.com community. In: Proceedings of the 20th national conference on Artificial intelligence, pp. 121–126. AAAI Press, Pittsburgh (2005)Google Scholar
  9. 9.
    Luhmann, N.: Trust and Power. John Wiley & Sons Inc., Chichester (1979)Google Scholar
  10. 10.
    Marsh, S.P.: Formalising Trust as a Computational Concept, University of Stirling, Department of Mathematics and Computer Science (1994)Google Scholar
  11. 11.
    Golbeck, J.A.: Trust and nuanced profile similarity in online social networks. ACM Trans. Web 3, 1–33 (2009)CrossRefGoogle Scholar
  12. 12.
    Sztompka, P.: Trust: A Sociological Theory. Cambridge University Press, Cambridge (2000)Google Scholar
  13. 13.
    Luhmann, N.: Familiarity, Confidence, Trust: Problems and Alternatives. In: Gambetta, D. (ed.) Trust: Making and Breaking Cooperative Relations, pp. 94–107. University of Oxford, Oxford (2000)Google Scholar
  14. 14.
    Coleman, J.: Foundations of Social Theory. The Belknap Press of Harvard University Press (1990)Google Scholar
  15. 15.
    Falcone, R., Castelfranchi, C.: Social trust: a cognitive approach. In: Castelfranchi, C., Tan, Y. (eds.) Trust and deception in virtual societies, pp. 55–90. Kluwer Academic Publishers, Dordrecht (2001)Google Scholar
  16. 16.
    Williamson, O.: Calculativeness, Trust, and Economic Organization. Journal of Law and Economics 36, 453–486 (1993)CrossRefGoogle Scholar
  17. 17.
    Abdul-Rahman, A., Hailes, S.: Supporting Trust in Virtual Communities. In: Abdul-Rahman, A., Hailes, S. (eds.) HICSS 2000. Proceedings of the 33rd Hawaii International Conference on System Sciences (2000)Google Scholar
  18. 18.
    Massa, P., Bhattacharjee, B.: Using Trust in Recommender Systems: An Experimental Analysis. In: Jensen, C., Poslad, S., Dimitrakos, T. (eds.) iTrust 2004. LNCS, vol. 2995, pp. 221–235. Springer, Heidelberg (2004)Google Scholar
  19. 19.
    Golbeck, J.A. (ed.): Computing with Social Trust. Springer, Berlin (2008)Google Scholar
  20. 20.
    Gambetta, D.: Can We Trust Trust? In: Gambetta, D. (ed.) Trust: Making and Breaking Cooperative Relations, pp. 213–237. University of Oxford, Oxford (2000)Google Scholar
  21. 21.
    Castelfranchi, C., Falcone, R.: Trust Is Much More than Subjective Probability: Mental Components and Sources of Trust. In: Proceedings of the 33rd Hawaii International Conference on System Sciences. IEEE Computer Society, Los Alamitos (2000)Google Scholar
  22. 22.
    Dasgupta, P.: Trust as a Commodity. In: Gambetta, D. (ed.) Trust: Making and Breaking Cooperative Relations, pp. 49–72. University of Oxford, Oxford (2000)Google Scholar
  23. 23.
    DuBois, T., Golbeck, J., Srinivasan, A.: Rigorous Probabilistic Trust-Inference with Applications to Clustering. In: Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, pp. 655–658. IEEE Computer Society, Los Alamitos (2009)Google Scholar
  24. 24.
    Gulati, R.: Does Familiarity Breed Trust? The Implications of Repeated Ties for Contractual Choice in Alliances. The Academy of Management Journal 38, 85–112 (1995)CrossRefGoogle Scholar
  25. 25.
    Chen, Y., Li, J., Chen, J.: A new algorithm for network probabilistic connectivity. In: Military Communications Conference Proceedings, pp. 920–923 (1999)Google Scholar
  26. 26.
    Fishman, G.: Monte Carlo: Concepts, Algorithms, and Applications. Springer, Berlin (1996)zbMATHGoogle Scholar
  27. 27.
    Provan, J.S., Ball, M.O.: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected. SIAM Journal on Computing 12, 777–788 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    Agrawal, A., Satyanarayana, A.: An O(∣E∣) Time Algorithm for Computing the Reliability of a Class of Directed Networks. Operations research 32, 493–515 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    Ziegler, C., Lausen, G.: Propagation Models for Trust and Distrust in Social Networks. Information Systems Frontiers 7, 337–358 (2005)CrossRefGoogle Scholar
  30. 30.
    Rosenberg, J.L.: The 1941 Mission of Frank Aiken to the United States: An American Perspective. Irish Historical Studies 22, 162–177 (1980)Google Scholar
  31. 31.
  32. 32.
    Sipser, M.: Introduction to the Theory of Computation. International Thomson Publishing (1996)Google Scholar
  33. 33.
    Cormen, T.H., Stein, C., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. B & T (2001)Google Scholar
  34. 34.
    Goldberg, A.V., Tarjan, R.E.: Expected Performance of Dijkstra’s Shortest Path Algorithm, NEC Research Institute Report (1996)Google Scholar
  35. 35.
    Roditty, L., Zwick, U.: A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pp. 184–191. ACM, Chicago (2004)CrossRefGoogle Scholar
  36. 36.
    Khoussainov, B., Liu, J., Khaliq, I.: A Dynamic Algorithm for Reachability Games Played on Trees. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 477–488. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  37. 37.
    Wang, H., He, H., Yang, J., Yu, P.S., Yu, J.X.: Dual Labeling: Answering Graph Reachability Queries in Constant Time. In: Proceedings of the 22nd International Conference on Data Engineering (ICDE 2006), pp. 75–87. IEEE Computer Society, Los Alamitos (2006)CrossRefGoogle Scholar

Copyright information

© IFIP 2010

Authors and Affiliations

  • Khrystyna Nordheimer
    • 1
  • Thimo Schulze
    • 1
    • 2
  • Daniel Veit
    • 2
  1. 1.Chair in Information Systems IIIUniversity of MannheimMannheimGermany
  2. 2.Dieter Schwarz Chair of Business Administration, E-Business and E-GovernmentUniversity of MannheimMannheimGermany

Personalised recommendations