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.
Chapter PDF
Similar content being viewed by others
Keywords
References
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)
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)
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)
Golbeck, J.A.: Computing and applying trust in web-based social networks, University of Maryland at College Park (2005)
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)
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)
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)
Luhmann, N.: Trust and Power. John Wiley & Sons Inc., Chichester (1979)
Marsh, S.P.: Formalising Trust as a Computational Concept, University of Stirling, Department of Mathematics and Computer Science (1994)
Golbeck, J.A.: Trust and nuanced profile similarity in online social networks. ACM Trans. Web 3, 1–33 (2009)
Sztompka, P.: Trust: A Sociological Theory. Cambridge University Press, Cambridge (2000)
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)
Coleman, J.: Foundations of Social Theory. The Belknap Press of Harvard University Press (1990)
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)
Williamson, O.: Calculativeness, Trust, and Economic Organization. Journal of Law and Economics 36, 453–486 (1993)
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)
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)
Golbeck, J.A. (ed.): Computing with Social Trust. Springer, Berlin (2008)
Gambetta, D.: Can We Trust Trust? In: Gambetta, D. (ed.) Trust: Making and Breaking Cooperative Relations, pp. 213–237. University of Oxford, Oxford (2000)
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)
Dasgupta, P.: Trust as a Commodity. In: Gambetta, D. (ed.) Trust: Making and Breaking Cooperative Relations, pp. 49–72. University of Oxford, Oxford (2000)
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)
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)
Chen, Y., Li, J., Chen, J.: A new algorithm for network probabilistic connectivity. In: Military Communications Conference Proceedings, pp. 920–923 (1999)
Fishman, G.: Monte Carlo: Concepts, Algorithms, and Applications. Springer, Berlin (1996)
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)
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)
Ziegler, C., Lausen, G.: Propagation Models for Trust and Distrust in Social Networks. Information Systems Frontiers 7, 337–358 (2005)
Rosenberg, J.L.: The 1941 Mission of Frank Aiken to the United States: An American Perspective. Irish Historical Studies 22, 162–177 (1980)
Sipser, M.: Introduction to the Theory of Computation. International Thomson Publishing (1996)
Cormen, T.H., Stein, C., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. B & T (2001)
Goldberg, A.V., Tarjan, R.E.: Expected Performance of Dijkstra’s Shortest Path Algorithm, NEC Research Institute Report (1996)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP
About this paper
Cite this paper
Nordheimer, K., Schulze, T., Veit, D. (2010). Trustworthiness in Networks: A Simulation Approach for Approximating Local Trust and Distrust Values. In: Nishigaki, M., Jøsang, A., Murayama, Y., Marsh, S. (eds) Trust Management IV. IFIPTM 2010. IFIP Advances in Information and Communication Technology, vol 321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13446-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-13446-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13445-6
Online ISBN: 978-3-642-13446-3
eBook Packages: Computer ScienceComputer Science (R0)