|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
Finding the Optimal Social Trust Path for the Selection of Trustworthy Service Providers in Complex Social Networks
PrePrint
ISSN: 1939-1374
| ASCII Text | x | ||
| Guanfeng Liu, Yan Wang, Mehmet A. Orgun, Ee-Peng Lim, "Finding the Optimal Social Trust Path for the Selection of Trustworthy Service Providers in Complex Social Networks," IEEE Transactions on Services Computing, vol. 99, no. 1, pp. , , 5555. | |||
| BibTex | x | ||
| @article{ 10.1109/TSC.2011.58, author = {Guanfeng Liu and Yan Wang and Mehmet A. Orgun and Ee-Peng Lim}, title = {Finding the Optimal Social Trust Path for the Selection of Trustworthy Service Providers in Complex Social Networks}, journal ={IEEE Transactions on Services Computing}, volume = {99}, number = {1}, issn = {1939-1374}, year = {5555}, doi = {http://doi.ieeecomputersociety.org/10.1109/TSC.2011.58}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Services Computing TI - Finding the Optimal Social Trust Path for the Selection of Trustworthy Service Providers in Complex Social Networks IS - 1 SN - 1939-1374 SP EP EPD - A1 - Guanfeng Liu, A1 - Yan Wang, A1 - Mehmet A. Orgun, A1 - Ee-Peng Lim, PY - 5555 KW - trust KW - social networks KW - trust path selection KW - service selection VL - 99 JA - IEEE Transactions on Services Computing ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TSC.2011.58
Online Social networks have provided the foundation for some new applications in recent years, e.g., for the recommendation of service providers or services. In these applications, trust is one of the most important indications for consumers' decision making that requires the evaluation of the trustworthiness of a service provider along the social trust paths from a service consumer to the service provider. However, there are usually many social trust paths. Also, some social information, e.g., social relationships and recommendation roles of participants, has significant influence on trust evaluation and should be considered. In this paper, we first present a novel complex social network structure incorporating trust and important social information. We also present a new concept, Quality of Trust (QoT), and model the optimal social trust path selection with multiple end-to-end QoT constraints as an NP-Complete Multi-Constrained Optimal Path (MCOP) selection problem. Towards solving this challenging problem, we propose a novel Multiple Foreseen Path Based Heuristic algorithm MFPB-HOSTP. The results of our experiments conducted on a real dataset of online social networks illustrate that MFPB-HOSTP can efficiently identify the social trust paths with better quality than our previously proposed H_OSTP algorithm that outperforms prior algorithms for the MCOP selection problem.
Index Terms:
trust, social networks, trust path selection, service selection
Citation:
Guanfeng Liu, Yan Wang, Mehmet A. Orgun, Ee-Peng Lim, "Finding the Optimal Social Trust Path for the Selection of Trustworthy Service Providers in Complex Social Networks," IEEE Transactions on Services Computing, 15 Dec. 2011. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TSC.2011.58>
Usage of this product signifies your acceptance of the Terms of Use.

