DMCA
Optimal Social Trust Path Selection in Complex Social Networks
| Citations: | 5 - 3 self |
BibTeX
@MISC{Liu_optimalsocial,
author = {Guanfeng Liu and Yan Wang and Mehmet A. Orgun},
title = {Optimal Social Trust Path Selection in Complex Social Networks},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Online social networks are becoming increasingly pop-ular and are being used as the means for a variety of rich activities. This demands the evaluation of the trust-worthiness between two unknown participants along a certain social trust path between them in the social net-work. However, there are usually many social trust paths between participants. Thus, a challenging prob-lem is finding which social trust path is the optimal one that can yield the most trustworthy evaluation result. In this paper, we first present a new complex social network structure and a new concept of Quality of Trust (QoT) to illustrate the ability to guarantee a cer-tain level of trustworthiness in trust evaluation. We then model the optimal social trust path selection as a Multi-Constrained Optimal Path (MCOP) selection problem which is NP-Complete. For solving this prob-lem, we propose an efficient approximation algorithm MONTE K based on the Monte Carlo method. The re-sults of our experiments conducted on a real dataset of social networks illustrate that our proposed algorithm significantly outperforms existing approaches in both efficiency and the quality of selected social trust paths.
Keyphrases
optimal social trust path selection complex social network social trust path multi-constrained optimal path selection problem trustworthy evaluation result trust evaluation social network certain social trust path challenging prob-lem efficient approximation algorithm monte unknown participant new concept many social trust path monte carlo method online social network rich activity new complex social network structure optimal one cer-tain level social net-work real dataset
