Strategies for incorporating knowledge defects and path length in trust aggregation

Authors:
Nele Verbiest;Chris Cornelis;Patricia Victor;Enrique Herrera-Viedma
Affiliations:
Dept. of Appl. Math. and Comp. Sci., Ghent University, Gent, Belgium;Dept. of Appl. Math. and Comp. Sci., Ghent University, Gent, Belgium;Dept. of Appl. Math. and Comp. Sci., Ghent University, Gent, Belgium;Dept. of Comp. Sci. and AI, University of Granada, Granada, Spain
Venue:
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
Year:
2010

Citing 6
Cited 1

On ordered weighted averaging aggregation operators in multicriteria decisionmaking

IEEE Transactions on Systems, Man and Cybernetics
Computing and applying trust in web-based social networks

Computing and applying trust in web-based social networks
Trust-aware recommender systems

Proceedings of the 2007 ACM conference on Recommender systems
Gradual trust and distrust in recommender systems

Fuzzy Sets and Systems
Trust based recommender system for the semantic web

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Induced ordered weighted averaging operators

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Practical aggregation operators for gradual trust and distrust

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The ability for a user to accurately estimate the amount of trust to be placed in a peer user is gaining more and more attention in social network applications. Trust aggregation provides this ability by identifying paths that connect users in the network, and by merging trust opinions expressed by users along these paths. However, as individual trust opinions are not always based on perfect knowledge, and since the quality of a trust estimation propagated along a given path may diminish as its length increases, mechanisms are needed to handle these imperfections. In this paper, we propose a set of trust aggregation operators that take into account knowledge defects and path length. We investigate their properties, and discuss how they may be implemented in practice, taking into account characteristics of the network such as the availability of a central authority, or the need to preserve users' privacy by not publically disclosing their trust information.