Rigorous Probabilistic Trust-Inference with Applications to Clustering

The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how trustworthy its creator is. Since no individual can have direct knowledge of more than a small fraction of information authors, methods for inferring trust are needed. We propose a new trust inference scheme based on the idea that a trust network can be viewed as a random graph, and a chain of trust as a path in that graph. In addition to having an intuitive interpretation, our algorithm has several advantages, noteworthy among which is the creation of an inferred trust-metric space where the shorter the distance between two people, the higher their trust. Metric spaces have rigorous algorithms for clustering, visualization, and related problems, any of which is directly applicable to our results.

• Type: Conference
• Year: 2009
• Where: WEBI
• Authors: Thomas DuBois, Jennifer Golbeck, Aravind Srinivasan
• Keywords: Internet Technology, Trust, Trust Inference Scheme, WEBI 2009, World Wide Web