An efficient method to find the optimal social trust path in contextual social graphs

Liu, Guangeng, Zhao, Lei, Zheng, Kai, Liu, An, Xu, Jiajie, Li, Zhixu and Bouguettaya, Athman (2015). An efficient method to find the optimal social trust path in contextual social graphs. In: Matthias Renz, Cyrus Shahabi, Xiaofang Zhou and Muhammad Aamir Cheema, Database Systems for Advanced Applications - 20th International Conference, DASFAA 2015, Hanoi, Vietnam, April 20-23, 2015 Proceedings, Part II. 20th International Conference on Database Systems for Advanced Applications, DASFAA 2015, Hanoi, Vietnam, (399-417). 20-23 April 2015. doi:10.1007/978-3-319-18123-3_24


Author Liu, Guangeng
Zhao, Lei
Zheng, Kai
Liu, An
Xu, Jiajie
Li, Zhixu
Bouguettaya, Athman
Title of paper An efficient method to find the optimal social trust path in contextual social graphs
Conference name 20th International Conference on Database Systems for Advanced Applications, DASFAA 2015
Conference location Hanoi, Vietnam
Conference dates 20-23 April 2015
Proceedings title Database Systems for Advanced Applications - 20th International Conference, DASFAA 2015, Hanoi, Vietnam, April 20-23, 2015 Proceedings, Part II   Check publisher's open access policy
Journal name Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   Check publisher's open access policy
Series Lecture Notes in Computer Science
Place of Publication Heidelberg, Germany
Publisher Springer
Publication Year 2015
Sub-type Fully published paper
DOI 10.1007/978-3-319-18123-3_24
Open Access Status Not Open Access
ISBN 9783319181226
9783319181233
ISSN 1611-3349
0302-9743
Editor Matthias Renz
Cyrus Shahabi
Xiaofang Zhou
Muhammad Aamir Cheema
Volume 9050
Start page 399
End page 417
Total pages 19
Collection year 2016
Language eng
Abstract/Summary Online Social Networks (OSN) have been used as platforms for many emerging applications, where trust is a critical factor for participants’ decision making. In order to evaluate the trustworthiness between two unknown participants, we need to perform trust inference along the social trust paths formed by the interactions among the intermediate participants. However, there are usually a large number of social trust paths between two participants. Thus, a challenging problem is how to effectively and efficiently find the optimal social trust path that can yield the most trustworthy evaluation result based on the requirements of participants. In this paper, the core problem of finding the optimal social trust path with multiple constraints of social contexts is modelled as the classical NP-Complete Multi-Constrained Optimal Path (MCOP) selection problem. To make this problem practically solvable, we propose an efficient and effective approximation algorithm, called T-MONTE-K, by combining Monte Carlo method and our optimised search strategies. Lastly we conduct extensive experiments based on a real-world OSN dataset and the results demonstrate that the proposed T-MONTE-K algorithm can outperform state-of-the-art MONTE_K algorithm significantly.
Q-Index Code C1
Q-Index Status Confirmed Code
Institutional Status UQ

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Tue, 13 Oct 2015, 03:39:22 EST by System User on behalf of Scholarly Communication and Digitisation Service