In this paper, we address the personalized node ranking (PNR) problem for signed networks, which aims to rank nodes in an order most relevant to a given seed node in a signed network. The recently-proposed PNR methods introduce the concept of the signed random surfer, denoted as SRSurfer, that performs the score propagation between nodes using the balance theory. However, in real settings of signed networks, edge relationships often do not strictly follow the rules of the balance theory. Therefore, SRSurfer-based PNR methods frequently perform in correct score propagation to nodes, thereby degrading the accuracy of PNR. To address this limitation, we propose a novel random-walk based PNR approach with sign verification, named as OBOE (lOok Before yOu lEap). Specifically, OBOE carefully verifies the score propagation of SRSurfer by using the topological features of nodes. Then, OBOE corrects all incorrect score propagation cases by exploiting the statistics of a given network.The experiments on 3 real-world signed networks show that OBOE consistently and significantly outperforms 5 competing methods with improvement up to 13%, 94%, and 221% in top-𝑘 PNR, bottom-𝑘 PNR, and troll identification tasks, respectively.

• Look Before You Leap: Confirming Edge Signs in Random Walk with Restart for Personalized Node Ranking in Signed Networks

Wonchang Lee*, Yeon-Chang Lee*, Dongwon Lee, and Sang-Wook Kim (*equal contribution)

ACM Int’l Conf. on Research and Development in Information Retrieval (SIGIR), July 11-15, 2021.

We encourage you to cite our paper if you have used the code in your work. You can use the following BibTex citation:

@inproceedings{Lee21sigir,

author = {Wonchang Lee, Yeon{-}Chang Lee, Dongwon Lee, and Sang{-}Wook Kim},

title = {Look Before You Leap: Confirming Edge Signs in Random Walk with Restart for Personalized Node Ranking in Signed Networks},

booktitle = {International ACM SIGIR Conference on Research and Development in Information Retrieval (ACM SIGIR)},

year = {2021}

}