Cart (Loading....) | Create Account
Close category search window
 

Finding K Optimal Social Trust Paths for the Selection of Trustworthy Service Providers in Complex Social Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Guanfeng Liu ; Dept. of Comput., Macquarie Univ., Sydney, NSW, Australia ; Yan Wang ; Orgun, M.A.

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.

Published in:

Web Services (ICWS), 2011 IEEE International Conference on

Date of Conference:

4-9 July 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.