Abstract
In a service-oriented online social network consisting of service providers and consumers as participants, a service consumer can search trustworthy service providers via the social network between them. This requires the evaluation of the trustworthiness of a service provider along a potentially very large number of social trust paths from the service consumer to the service provider. Thus, a challenging problem is how to identify K optimal social trust paths that can yield the K most trustworthy evaluation results based on service consumers' evaluation criteria. In this paper, we first present a complex social network structure and a concept, Quality of Trust (QoT). We then model the K optimal social trust paths selection with multiple end-to-end QoT constraints as the Multiple Constrained K Optimal Paths (MCOP-K) selection problem, which is NP-Complete. For solving this challenging problem, based on Dijkstra's shortest path algorithm and our optimization strategies, we propose a heuristic algorithm H-OSTP-K with the time complexity of O(m +Knlogn). The results of our experiments conducted on a real dataset of online social networks illustrate that H-OSTP-K outperforms existing methods in the quality of identified social trust paths.
Original language | English |
---|---|
Title of host publication | Proceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011 |
Editors | Ian Foster, Louise Moser, Jia Zhang |
Place of Publication | Los Alamitos, Calif. |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 41-48 |
Number of pages | 8 |
ISBN (Print) | 9780769544632 |
DOIs | |
Publication status | Published - 2011 |
Event | 2011 IEEE 9th International Conference on Web Services, ICWS 2011 - Washington, DC, United States Duration: 4 Jul 2011 → 9 Jul 2011 |
Other
Other | 2011 IEEE 9th International Conference on Web Services, ICWS 2011 |
---|---|
Country | United States |
City | Washington, DC |
Period | 4/07/11 → 9/07/11 |