Predicting edge sign and finding prestige of nodes in networks

Xiaoping Jiang, Chenghua Li, Hao Ding, Jing Sun

Abstract: Recently, as a result of the popularity of online social networks, the analysis and comparison of their contents are in an incremental need. The study of social network and social interaction including both positive and negative connections, which is obviously significant. Our finding denotes that the contacts in the basic social networks, including their accuracy, are predictable. The trust of numerous users’ imparting on a node accounts for the form of networks. In this paper, We propose a model in this article to figure out the prestige on nodes in a network based on trust. This network also lays more emphasis to on trustworthy nodes. In the beginning, to achieve this goal, we try to indicate signed advantages in networks to predict an user’s opinion to another. After that, we present an algorithm, which can compute the prestige and trustworthiness. In their edge weight, we can find out the trust score. According to our experiments on the public dataset, we demonstrate the validity and efficiency of our algorithm.