A heuristic algorithm for trust-oriented service provider selection in complex social networks

In a service-oriented online social network consisting of service providers and consumers, a service consumer can search trustworthy service providers via the social network. This requires the evaluation of the trustworthiness of a service provider along a certain social trust path from the service...

Full description

Saved in:
Bibliographic Details
Main Authors: LIU, Guanfeng, WANG, Yan, ORGUN, Mehmet A., LIM, Ee Peng
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2010
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/627
https://ink.library.smu.edu.sg/context/sis_research/article/1626/viewcontent/T_SCC_HeuristicAlgorithm.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-1626
record_format dspace
spelling sg-smu-ink.sis_research-16262018-06-19T07:20:09Z A heuristic algorithm for trust-oriented service provider selection in complex social networks LIU, Guanfeng WANG, Yan ORGUN, Mehmet A. LIM, Ee Peng In a service-oriented online social network consisting of service providers and consumers, a service consumer can search trustworthy service providers via the social network. This requires the evaluation of the trustworthiness of a service provider along a certain social trust path from the service consumer to the service provider. However, there are usually many social trust paths between participants in social networks. Thus, a challenging problem is which social trust path is the optimal one that can yield the most trustworthy evaluation result. In this paper, we first present a novel complex social network structure and a new concept, Quality of Trust (QoT). We then model the optimal social trust path selection with multiple end-to-end QoT constraints as a Multi-Constrained Optimal Path (MCOP) selection problem which is NP-Complete. For solving this challenging problem, we propose an efficient heuristic algorithm, H OSTP. The results of our experiments conducted on a large real dataset of online social networks illustrate that our proposed algorithm significantly outperforms existing approaches. 2010-07-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/627 info:doi/10.1109/SCC.2010.47 https://ink.library.smu.edu.sg/context/sis_research/article/1626/viewcontent/T_SCC_HeuristicAlgorithm.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Social network Trust Trust path Communication Technology and New Media Databases and Information Systems
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Social network
Trust
Trust path
Communication Technology and New Media
Databases and Information Systems
spellingShingle Social network
Trust
Trust path
Communication Technology and New Media
Databases and Information Systems
LIU, Guanfeng
WANG, Yan
ORGUN, Mehmet A.
LIM, Ee Peng
A heuristic algorithm for trust-oriented service provider selection in complex social networks
description In a service-oriented online social network consisting of service providers and consumers, a service consumer can search trustworthy service providers via the social network. This requires the evaluation of the trustworthiness of a service provider along a certain social trust path from the service consumer to the service provider. However, there are usually many social trust paths between participants in social networks. Thus, a challenging problem is which social trust path is the optimal one that can yield the most trustworthy evaluation result. In this paper, we first present a novel complex social network structure and a new concept, Quality of Trust (QoT). We then model the optimal social trust path selection with multiple end-to-end QoT constraints as a Multi-Constrained Optimal Path (MCOP) selection problem which is NP-Complete. For solving this challenging problem, we propose an efficient heuristic algorithm, H OSTP. The results of our experiments conducted on a large real dataset of online social networks illustrate that our proposed algorithm significantly outperforms existing approaches.
format text
author LIU, Guanfeng
WANG, Yan
ORGUN, Mehmet A.
LIM, Ee Peng
author_facet LIU, Guanfeng
WANG, Yan
ORGUN, Mehmet A.
LIM, Ee Peng
author_sort LIU, Guanfeng
title A heuristic algorithm for trust-oriented service provider selection in complex social networks
title_short A heuristic algorithm for trust-oriented service provider selection in complex social networks
title_full A heuristic algorithm for trust-oriented service provider selection in complex social networks
title_fullStr A heuristic algorithm for trust-oriented service provider selection in complex social networks
title_full_unstemmed A heuristic algorithm for trust-oriented service provider selection in complex social networks
title_sort heuristic algorithm for trust-oriented service provider selection in complex social networks
publisher Institutional Knowledge at Singapore Management University
publishDate 2010
url https://ink.library.smu.edu.sg/sis_research/627
https://ink.library.smu.edu.sg/context/sis_research/article/1626/viewcontent/T_SCC_HeuristicAlgorithm.pdf
_version_ 1770570625742536704