the most trustworthy path selection in online social networks
Clicks: 73
ID: 161084
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Popular Article
21.6
/100
73 views
22 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #854 of 1,093 articles by views in journal of power sources
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 1,093 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
In online social networks, it is crucial for a service consumer to find the most trustworthy path to a target service provider from numerous social trust paths between them. The selection of the most trustworthy path (namely, optimal social trust path (OSTP)) with multiple end-to-end quality of trust (QoT) constraints has been proved to be NP-Complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this challenging problem. However, existing solutions cannot guarantee the efficiency of searching; that is, they can hardly avoid obtaining partial optimal solutions during searching process. Quantum annealing uses delocalization and tunneling to avoid falling into local minima without sacrificing execution time. It has been proved to be a promising way to many optimization problems in recently published literature. In this paper, for the first time, QA based OSTP algorithm (QA_OSTP) is applied to the selection of the most trustworthy path. The experiment results show that QA based algorithm has better performance than its heuristic opponents.
| Reference Key |
liu2013mathematicalthe
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Lianggui Liu |
| Journal | journal of power sources |
| Year | 2013 |
| DOI |
10.1155/2013/408148
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.