SignRank: A Novel Random Walking Based Ranking Algorithm in Signed Networks

Abstract EN

Social networks have become an indispensable part of modern life.

Signed networks, a class of social network with positive and negative edges, are becoming increasingly important.

Many social networks have adopted the use of signed networks to model like (trust) or dislike (distrust) relationships.

Consequently, how to rank nodes from positive and negative views has become an open issue of social network data mining.

Traditional ranking algorithms usually separate the signed network into positive and negative graphs so as to rank positive and negative scores separately.

However, much global information of signed network gets lost during the use of such methods, e.g., the influence of a friend’s enemy.

In this paper, we propose a novel ranking algorithm that computes a positive score and a negative score for each node in a signed network.

We introduce a random walking model for signed network which considers the walker has a negative or positive emotion.

The steady state probability of the walker visiting a node with negative or positive emotion represents the positive score or negative score.

In order to evaluate our algorithm, we use it to solve sign prediction problem, and the result shows that our algorithm has a higher prediction accuracy compared with some well-known ranking algorithms.