Finding K optimal social trust paths for the selection of trustworthy service providers in complex social networks

Guanfeng Liu*, Yan Wang, Mehmet A. Orgun

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

27 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011
EditorsIan Foster, Louise Moser, Jia Zhang
Place of PublicationLos Alamitos, Calif.
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages41-48
Number of pages8
ISBN (Print)9780769544632
DOIs
Publication statusPublished - 2011
Event2011 IEEE 9th International Conference on Web Services, ICWS 2011 - Washington, DC, United States
Duration: 4 Jul 20119 Jul 2011

Other

Other2011 IEEE 9th International Conference on Web Services, ICWS 2011
CountryUnited States
CityWashington, DC
Period4/07/119/07/11

Fingerprint Dive into the research topics of 'Finding K optimal social trust paths for the selection of trustworthy service providers in complex social networks'. Together they form a unique fingerprint.

Cite this