Skip to end of banner
Go to start of banner

Golbeck, 2006

Skip to end of metadata
Go to start of metadata

You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 3 Current »

Computing with Trust: Definition, Properties, and Algorithms

Type

Article

Year

2006

Authors

Golbeck, J.

Conference

2006 Securecomm and Workshops, Baltimore, MD, USA

Abstract

Trust is an important facet of relationships in social networks. Whether it is for use in security, determining data access, or recommender systems, the definition of trust will guide the development of algorithms to make computations over the trust relationships. In this paper, we present a definition of trust based on sociological foundations. We then describe several properties of trust, including transitivity and composability, that follow from the definition and research in the social sciences, to help guide the methods used for computing with trust, and we discuss the range of values used for expressing trust. We then present a review of algorithms that compute trust in social networks.

(Golbeck, 2006, p. 1)

Citation

Golbeck, J., 2006. Computing with Trust: Definition, Properties, and Algorithms, in: 2006 Securecomm and Workshops. Presented at the 2006 Securecomm and Workshops, IEEE, Baltimore, MD, USA, pp. 1–7. https://doi.org/10.1109/SECCOMW.2006.359579

  • No labels