DocumentCode :
3130528
Title :
Incorporating evidence into trust propagation models using Markov Random Fields
Author :
Tosun, Hasari ; Sheppard, John W.
Author_Institution :
Dept. of Comput. Sci., Montana State Univ., Bozeman, MT, USA
fYear :
2011
fDate :
21-25 March 2011
Firstpage :
263
Lastpage :
269
Abstract :
Current trust models for social networks commonly rely on explicit voting mechanisms where individuals vote for each other as a form of trust statement. However, there is a wealth of information about individuals beyond trust voting in emerging web based social networks. Incorporating sources of evidence into trust models for social networks has not been studied to date. We explore a trust model for social networks based on Markov Random Fields, which we call MRFTrust, that allows us to incorporate sources of evidence. To allow comparative evaluation, a state-of-the-art local trust algorithm-MoleTrust-is also investigated. Experimental results of the algorithms reveal that our trust algorithm that incorporates evidence performs better in terms of coverage. It is competitive with the MoleTrust algorithm in prediction accuracy and superior when focusing on controversial users.
Keywords :
Markov processes; data privacy; social networking (online); Markov random fields; MoleTrust algorithm; Web-based social networks; explicit voting mechanisms; trust propagation models; Algorithm design and analysis; Belief propagation; Computational modeling; Markov random fields; Measurement; Prediction algorithms; Social network services; Markov Random Fields; Reputation System; Social Network; Trust Metrics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Pervasive Computing and Communications Workshops (PERCOM Workshops), 2011 IEEE International Conference on
Conference_Location :
Seattle, WA
Print_ISBN :
978-1-61284-938-6
Electronic_ISBN :
978-1-61284-936-2
Type :
conf
DOI :
10.1109/PERCOMW.2011.5766880
Filename :
5766880
Link To Document :
بازگشت