A Probabilistic Framework for Decentralized Management of Trust and Quality

Abstract

In this paper, we propose a probabilistic framework targeting three important issues in the computation of quality and trust in decentralized systems. Specifically, our approach addresses the multi-dimensionality of quality and trust, taking into account credibility of the collected data sources for more reliable estimates, while also enabling the personalization of the computation. We use graphical models to represent peers’ qualitative behaviors and exploit appropriate probabilistic learning and inference algorithms to evaluate their quality and trustworthiness based on related reports. Our implementation of the framework introduces the most typical quality models, uses the Expectation-Maximization algorithm to learn their parameters, and applies the Junction Tree algorithm to inference on them for the estimation of quality and trust. The experimental results validate the advantages of our approach: first, using an appropriate personalized quality model, our computational framework can produce good estimates, even with a sparse and incomplete recommendation data set; second, the output of our solution has well-defined semantics and useful meanings for many purposes; third, the framework is scalable in terms of performance, computation, and communication cost. Furthermore, our solution can be shown as a generalization or serve as the theoretical basis of many existing trust computational approaches.

The work presented in this paper was (partly) supported by the Swiss National Science Foundation as part of the project: “Computational Reputation Mechanisms for Enabling Peer-to-Peer Commerce in Decentralized Networks”, contract No. 205121-105287. We also thank Radu Jurca, Wojciech Galuba, Vasilios Darlagiannis and the reviewers for their useful comments on this paper.