@misc{10481/65110,
year = {2010},
url = {http://hdl.handle.net/10481/65110},
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.},
organization = {F-META project, MEC-FEDER, Spain 	
TIN2007-67494},
organization = {FWO},
organization = {Institute for the Promotion of Innovation by Science and Technology in Flanders (IWT)},
organization = {Andalucian excellence project 	
TIC05299},
organization = {Feder Fund in FUZZYLING project 	
TIN2007-61079},
organization = {Feder Fund in PETRI project 	
PET 2007-0460},
publisher = {Springer Nature},
keywords = {Recommender system},
keywords = {Central Authority},
keywords = {Aggregation operators},
keywords = {Trust Score},
keywords = {Trust Network},
title = {Strategies for Incorporating Knowledge Defects and Path Length in Trust Aggregation},
doi = {10.1007/978-3-642-13033-5_46},
author = {Verbiest, Nele and Cornelis, Chris and Victor, Patricia and Herrera Viedma, Enrique},
}