An Algorithm for Predicting Local Trust based on Trust Propagation in Online Social Networks

  • Bhattacharya M
  • Nesa N
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

The objective of online social networking sites is to make it possible to connect people who share common interests and pursuits across different geographical locations. With this, the concept of trust also comes into perspective as the participants reveal a great quantity of personal information in the Web environment. This work adopts web-based Social Networks as the principle means for studying trust. Goal of this work is to find ways to utilize the structure of social graph and the trust relationships between them to accurately deduce how much two individuals that are not directly connected might trust one another. This paper presents an algorithm for inferring trust propagation between indirectly connected individuals in the network by the use of weighted trust ratings along the shortest and the most trusted path. The accuracy of this algorithm in predicting propagated trust is calculated and compared with that of simple average strategy and the multiplicative strategy algorithm [17]. This algorithm is tested with five real-world trust datasets and tried to discover that there exists a significant strong positive correlation between direct trusts and the corresponding propagated trusts obtained through this approach.

Cite

CITATION STYLE

APA

Bhattacharya, M., & Nesa, N. (2016). An Algorithm for Predicting Local Trust based on Trust Propagation in Online Social Networks. International Journal of Computer Applications, 156(7), 8–15. https://doi.org/10.5120/ijca2016912461

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free