A dynamic sampling algorithm based on learning automata for stochastic trust networks

Mina Ghavipour

doi:10.1016/j.knosys.2020.106620

2021-01-01

PRE

Mina Ghavipour *

Mohammad Reza Meybodi

DOI：10.1016/j.knosys.2020.106620

原文链接

原文求助

摘要

En 中文

Trust is known as an important social concept and an effective factor in all human interactions in social networks. Users tend to interact with trusted people with whom they have had positive experiences. Trust is updated over time as a result of these repeated interactions. Even though dynamicity is a universally accepted property of the social trust, trust networks are often modeled as static digraphs. In this paper, we first propose that a stochastic graph model, where the weights associated with edges are random variables with unknown distributions, may be a better candidate for representing trust networks. Then, we review the literature on analyzing complex networks and determine graph measures which are most appropriate with respect to the special properties of the concept of trust. Considering trust-specific measures, we finally propose a dynamic algorithm for sampling from stochastic trust networks, which is an extension of Frontier sampling. Even though there exist a few sampling methods which address edge weights and their variations over time through the sampling process, these methods are unable to accurately preserve the properties of trust networks. The proposed algorithm in this paper uses learning automata to tackle the disconnectivity problem of sampled subgraphs by Frontier sampling and, at the same time, capture the changes of edge weights through the sampling process. Our experimental results on the well-known trust network datasets indicate that the proposed sampling algorithm preserves more accurately the trust-specific measures of trust networks compared to existing sampling methods. (C) 2020 Elsevier B.V. All rights reserved.

Keyword:

Trust networks

Stochastic graphs

Graph measures

Network sampling

Learning automata