Behavior‐Based Propagation of Trust in Social Networks with Restricted and Anonymous Participation

Abstract

Increasing interactions and engagements in social networks through monetary and material incentives is not always feasible. Some social networks, specifically those that are built on the basis of fairness, cannot incentivize members using tangible things and thus require an intangible way to do so. In such networks, a personalized recommender could provide an incentive for members to interact with other members in the community. Behavior‐based trust models that generally compute social trust values using the interactions of a member with other members in the community have proven to be good for this. These models, however, largely ignore the interactions of those members with whom a member has interacted, referred to as “friendship effects.” Results from social studies and behavioral science show that friends have a significant influence on the behavior of the members in the community. Following the famous Spanish proverb on friendship “Tell Me Your Friends and I Will Tell You Who You Are,” we extend our behavior‐based trust model by incorporating the “friendship effect” with the aim of improving the accuracy of the recommender system. In this article, we describe a trust propagation model based on associations that combines the behavior of both individual members and their friends. The propagation of trust in our model depends on three key factors: the density of interactions, the degree of separation, and the decay of friendship effect. We evaluate our model using a real data set and make observations on what happens in a social network with and without trust propagation to understand the expected impact of trust propagation on the ranking of the members in the recommended list. We present the model and the results of its evaluation. This work is in the context of moderated networks for which participation is by invitation only and in which members are anonymous and do not know each other outside the community. Copyright © 2014 John Wiley & Sons, Ltd.

On the Effect of High Order Reputation Information on Trust Prediction in Wikipedia's Vote Network

“…They propose a feature extraction and classification experiments showing results on Recall, precision, false positives and ROC area. Other recent works about Trust cover Trust, distrust and lack of confidence of users in online social media-sharing communities [11]; Recommender systems to propagation of trust in anonymous social networks [17]; and Predicting Trusts among Users of ONC using also Epinions database [15], giving a taxonomy to organize features is given. They propose some classification experiments showing results on Precision, Recall, F value.…”

FAIMCS: A fast and accurate influence maximization algorithm in social networks based on community structures

“…The firm can select a number of customers and provide them with the product for free, hoping that the select customer will recommend the product to their friends. The important point here is how to select initial customers who can well promote the product, so that the product is widely welcomed by their friends, friends of friends, and so on, ending up with the admission of the product by maximum number of individuals in the community 1 . Influence maximization problem in social networks refers to finding the set of influential nodes which can deliver information to a wide spectrum of other members of the network 2 .…”