How can we rank nodes in signed social networks? Relationships between nodes in a signed network are represented as positive (trust) or negative (distrust) edges. Many social networks have adopted signed networks to express trust between users. Consequently, ranking friends or enemies in signed networks has received much attention from the data mining community. The ranking problem, however, is challenging because it is difficult to interpret negative edges. Traditional random walk based methods such as PageRank and Random Walk with Restart (RWR) cannot provide effective rankings in signed networks since they assume only non-negative edges.
In this work, we propose Signed Random Walk with Restart (SRWR)
, a novel ranking model for personalized ranking in signed networks.
We introduce a signed random surfer so that she considers negative edges by changing her sign for walking.
Our model provides appropriate rankings reflecting intricate edge relationships based on the signed random surfer.
SRWR is described in the following paper:
Personalized Ranking in Signed Networks using Signed Random Walk with Restart
Jinhong Jung, Woojung Jin, Lee Sael, and U Kang
IEEE International Conference on Data Mining (ICDM) 2016, Barcelona, Spain.
You can find a long journal version of the above paper at [LINK]
The binary codes used in the paper are available. [Download]