A Novel Optimal Social Trust Path Selection Algorithm for Large-Scale Complex Social Networks

Lianggui LIU; Huiling JIA

doi:10.1587/transcom.E97.B.1910

A Novel Optimal Social Trust Path Selection Algorithm for Large-Scale Complex Social Networks

Lianggui LIU, Huiling JIA

Full Text Views

0

Share
Cite this

Summary :

With the phenomenal explosion in online services, social networks are becoming an emerging ubiquitous platform for numerous services where service consumers require the selection of trustworthy service providers before invoking services with the help of other intermediate participants. Under this circumstance, evaluation of the trustworthiness of the service provider along the social trust paths from the service consumer to the service provider is required and to this end, selection of the optimal social trust path (OSTP) that can yield the most trustworthy evaluation result is a pre-requisite. OSTP selection with multiple quality of trust (QoT) constraints has been proven to be NP-Complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem. However, existing solutions cannot guarantee the search efficiency, that is, they have difficulty in avoiding suboptimal solutions during the search process. Quantum annealing uses delocalization and tunneling to avoid local minima without sacrificing execution time. Several recent studies have proven that it is a promising way to tackle many optimization problems. In this paper, we propose a novel quantum annealing based OSTP selection algorithm (QA_OSTP) for large-scale complex social networks. Experiments show that QA_OSTP has better performance than its heuristic counterparts.

Publication: IEICE TRANSACTIONS on Communications Vol.E97-B No.9 pp.1910-1920

Publication Date: 2014/09/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E97.B.1910

Type of Manuscript: PAPER

Category: Internet

Authors

Lianggui LIU
Zhejiang Sci-Tech University
Huiling JIA
Zhejiang Sci-Tech University

Keyword

quality of trust, optimal social trust path, quantum annealing, quantum tunneling, complex social networks

Cite this

Copy

Lianggui LIU, Huiling JIA, "A Novel Optimal Social Trust Path Selection Algorithm for Large-Scale Complex Social Networks" in IEICE TRANSACTIONS on Communications, vol. E97-B, no. 9, pp. 1910-1920, September 2014, doi: 10.1587/transcom.E97.B.1910.
Abstract: With the phenomenal explosion in online services, social networks are becoming an emerging ubiquitous platform for numerous services where service consumers require the selection of trustworthy service providers before invoking services with the help of other intermediate participants. Under this circumstance, evaluation of the trustworthiness of the service provider along the social trust paths from the service consumer to the service provider is required and to this end, selection of the optimal social trust path (OSTP) that can yield the most trustworthy evaluation result is a pre-requisite. OSTP selection with multiple quality of trust (QoT) constraints has been proven to be NP-Complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem. However, existing solutions cannot guarantee the search efficiency, that is, they have difficulty in avoiding suboptimal solutions during the search process. Quantum annealing uses delocalization and tunneling to avoid local minima without sacrificing execution time. Several recent studies have proven that it is a promising way to tackle many optimization problems. In this paper, we propose a novel quantum annealing based OSTP selection algorithm (QA_OSTP) for large-scale complex social networks. Experiments show that QA_OSTP has better performance than its heuristic counterparts.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E97.B.1910/_p

Copy

@ARTICLE{e97-b_9_1910,
author={Lianggui LIU, Huiling JIA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Novel Optimal Social Trust Path Selection Algorithm for Large-Scale Complex Social Networks},
year={2014},
volume={E97-B},
number={9},
pages={1910-1920},
abstract={With the phenomenal explosion in online services, social networks are becoming an emerging ubiquitous platform for numerous services where service consumers require the selection of trustworthy service providers before invoking services with the help of other intermediate participants. Under this circumstance, evaluation of the trustworthiness of the service provider along the social trust paths from the service consumer to the service provider is required and to this end, selection of the optimal social trust path (OSTP) that can yield the most trustworthy evaluation result is a pre-requisite. OSTP selection with multiple quality of trust (QoT) constraints has been proven to be NP-Complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem. However, existing solutions cannot guarantee the search efficiency, that is, they have difficulty in avoiding suboptimal solutions during the search process. Quantum annealing uses delocalization and tunneling to avoid local minima without sacrificing execution time. Several recent studies have proven that it is a promising way to tackle many optimization problems. In this paper, we propose a novel quantum annealing based OSTP selection algorithm (QA_OSTP) for large-scale complex social networks. Experiments show that QA_OSTP has better performance than its heuristic counterparts.},
keywords={},
doi={10.1587/transcom.E97.B.1910},
ISSN={1745-1345},
month={September},}

Copy

TY - JOUR
TI - A Novel Optimal Social Trust Path Selection Algorithm for Large-Scale Complex Social Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1910
EP - 1920
AU - Lianggui LIU
AU - Huiling JIA
PY - 2014
DO - 10.1587/transcom.E97.B.1910
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E97-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2014
AB - With the phenomenal explosion in online services, social networks are becoming an emerging ubiquitous platform for numerous services where service consumers require the selection of trustworthy service providers before invoking services with the help of other intermediate participants. Under this circumstance, evaluation of the trustworthiness of the service provider along the social trust paths from the service consumer to the service provider is required and to this end, selection of the optimal social trust path (OSTP) that can yield the most trustworthy evaluation result is a pre-requisite. OSTP selection with multiple quality of trust (QoT) constraints has been proven to be NP-Complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem. However, existing solutions cannot guarantee the search efficiency, that is, they have difficulty in avoiding suboptimal solutions during the search process. Quantum annealing uses delocalization and tunneling to avoid local minima without sacrificing execution time. Several recent studies have proven that it is a promising way to tackle many optimization problems. In this paper, we propose a novel quantum annealing based OSTP selection algorithm (QA_OSTP) for large-scale complex social networks. Experiments show that QA_OSTP has better performance than its heuristic counterparts.
ER -